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.r549-tall-171734897700043.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 CO4-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734897700043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 97K Jun 2 16:33 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 CO4-PT-06-LTLCardinality-00
FORMULA_NAME CO4-PT-06-LTLCardinality-01
FORMULA_NAME CO4-PT-06-LTLCardinality-02
FORMULA_NAME CO4-PT-06-LTLCardinality-03
FORMULA_NAME CO4-PT-06-LTLCardinality-04
FORMULA_NAME CO4-PT-06-LTLCardinality-05
FORMULA_NAME CO4-PT-06-LTLCardinality-06
FORMULA_NAME CO4-PT-06-LTLCardinality-07
FORMULA_NAME CO4-PT-06-LTLCardinality-08
FORMULA_NAME CO4-PT-06-LTLCardinality-09
FORMULA_NAME CO4-PT-06-LTLCardinality-10
FORMULA_NAME CO4-PT-06-LTLCardinality-11
FORMULA_NAME CO4-PT-06-LTLCardinality-12
FORMULA_NAME CO4-PT-06-LTLCardinality-13
FORMULA_NAME CO4-PT-06-LTLCardinality-14
FORMULA_NAME CO4-PT-06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717351385179

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:03:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 18:03:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:03:06] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-06-02 18:03:06] [INFO ] Transformed 383 places.
[2024-06-02 18:03:06] [INFO ] Transformed 454 transitions.
[2024-06-02 18:03:06] [INFO ] Found NUPN structural information;
[2024-06-02 18:03:06] [INFO ] Parsed PT model containing 383 places and 454 transitions and 1016 arcs in 175 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 2 formulas.
Deduced a syphon composed of 100 places in 5 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 334/334 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 274 transition count 333
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 67 place count 217 transition count 274
Iterating global reduction 1 with 57 rules applied. Total rules applied 124 place count 217 transition count 274
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 127 place count 217 transition count 271
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 153 place count 191 transition count 245
Iterating global reduction 2 with 26 rules applied. Total rules applied 179 place count 191 transition count 245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 180 place count 191 transition count 244
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 185 place count 186 transition count 236
Iterating global reduction 3 with 5 rules applied. Total rules applied 190 place count 186 transition count 236
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 193 place count 183 transition count 233
Iterating global reduction 3 with 3 rules applied. Total rules applied 196 place count 183 transition count 233
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 197 place count 182 transition count 232
Iterating global reduction 3 with 1 rules applied. Total rules applied 198 place count 182 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 199 place count 182 transition count 231
Applied a total of 199 rules in 80 ms. Remains 182 /283 variables (removed 101) and now considering 231/334 (removed 103) transitions.
// Phase 1: matrix 231 rows 182 cols
[2024-06-02 18:03:06] [INFO ] Computed 4 invariants in 16 ms
[2024-06-02 18:03:06] [INFO ] Implicit Places using invariants in 223 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 252 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 181/283 places, 231/334 transitions.
Applied a total of 0 rules in 4 ms. Remains 181 /181 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 352 ms. Remains : 181/283 places, 231/334 transitions.
Support contains 16 out of 181 places after structural reductions.
[2024-06-02 18:03:07] [INFO ] Flatten gal took : 49 ms
[2024-06-02 18:03:07] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:03:07] [INFO ] Input system was already deterministic with 231 transitions.
Support contains 14 out of 181 places (down from 16) after GAL structural reductions.
RANDOM walk for 40000 steps (59 resets) in 1328 ms. (30 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40000 steps (60 resets) in 329 ms. (121 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (48 resets) in 236 ms. (168 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (56 resets) in 227 ms. (175 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (66 resets) in 160 ms. (248 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (20 resets) in 169 ms. (235 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (54 resets) in 174 ms. (228 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (61 resets) in 118 ms. (336 steps per ms) remains 7/7 properties
// Phase 1: matrix 231 rows 181 cols
[2024-06-02 18:03:08] [INFO ] Computed 3 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 17/26 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 77/103 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 174/277 variables, 76/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 10/287 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 4/291 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 100/391 variables, 67/170 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/391 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 17/408 variables, 12/182 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 4/412 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/412 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/412 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 184 constraints, problems are : Problem set: 0 solved, 7 unsolved in 574 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 17/26 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 77/103 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 174/277 variables, 76/107 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 10/287 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/287 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 4/291 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 100/391 variables, 67/177 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/391 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 17/408 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/408 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 4/412 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/412 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/412 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 412/412 variables, and 191 constraints, problems are : Problem set: 0 solved, 7 unsolved in 642 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 1242ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Finished Parikh walk after 75 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=75 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 37 ms.
Computed a total of 10 stabilizing places and 12 stable transitions
Graph (complete) has 298 edges and 181 vertex of which 176 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 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 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 231/231 transitions.
Graph (trivial) has 190 edges and 181 vertex of which 2 / 181 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 297 edges and 180 vertex of which 175 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 175 transition count 163
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 127 place count 113 transition count 162
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 127 place count 113 transition count 141
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 169 place count 92 transition count 141
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 91 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 91 transition count 140
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 172 place count 90 transition count 139
Iterating global reduction 2 with 1 rules applied. Total rules applied 173 place count 90 transition count 139
Performed 30 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 233 place count 60 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 236 place count 60 transition count 97
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 238 place count 58 transition count 95
Iterating global reduction 3 with 2 rules applied. Total rules applied 240 place count 58 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 244 place count 56 transition count 93
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 272 place count 42 transition count 94
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 280 place count 42 transition count 86
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 290 place count 32 transition count 66
Iterating global reduction 4 with 10 rules applied. Total rules applied 300 place count 32 transition count 66
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 307 place count 32 transition count 59
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 310 place count 29 transition count 50
Iterating global reduction 5 with 3 rules applied. Total rules applied 313 place count 29 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 315 place count 29 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 319 place count 29 transition count 44
Applied a total of 319 rules in 47 ms. Remains 29 /181 variables (removed 152) and now considering 44/231 (removed 187) transitions.
[2024-06-02 18:03:09] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
// Phase 1: matrix 40 rows 29 cols
[2024-06-02 18:03:09] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:03:09] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-02 18:03:09] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
[2024-06-02 18:03:09] [INFO ] Invariant cache hit.
[2024-06-02 18:03:09] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 18:03:09] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-06-02 18:03:09] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
[2024-06-02 18:03:09] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
[2024-06-02 18:03:09] [INFO ] Invariant cache hit.
[2024-06-02 18:03:09] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 39/68 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 1/69 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/69 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 44 constraints, problems are : Problem set: 0 solved, 43 unsolved in 566 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 29/29 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 39/68 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 43/86 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 1/69 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 87 constraints, problems are : Problem set: 0 solved, 43 unsolved in 693 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 29/29 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1282ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1283ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/181 places, 44/231 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1413 ms. Remains : 29/181 places, 44/231 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-06-LTLCardinality-04
Product exploration explored 100000 steps with 3 reset in 161 ms.
Stack based approach found an accepted trace after 38 steps with 4 reset with depth 3 and stack size 3 in 0 ms.
FORMULA CO4-PT-06-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CO4-PT-06-LTLCardinality-04 finished in 1793 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&&G(p1))))'
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 231/231 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 175 transition count 225
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 175 transition count 225
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 170 transition count 220
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 170 transition count 220
Applied a total of 22 rules in 7 ms. Remains 170 /181 variables (removed 11) and now considering 220/231 (removed 11) transitions.
// Phase 1: matrix 220 rows 170 cols
[2024-06-02 18:03:11] [INFO ] Computed 3 invariants in 4 ms
[2024-06-02 18:03:11] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 18:03:11] [INFO ] Invariant cache hit.
[2024-06-02 18:03:11] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-06-02 18:03:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 220/389 variables, 169/172 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-02 18:03:15] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 10 ms to minimize.
[2024-06-02 18:03:15] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 1/390 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 0/390 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 175 constraints, problems are : Problem set: 0 solved, 219 unsolved in 9343 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/389 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 218/392 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 1/390 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 0/390 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 394 constraints, problems are : Problem set: 0 solved, 219 unsolved in 12173 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints]
After SMT, in 21599ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 21602ms
Starting structural reductions in LTL mode, iteration 1 : 170/181 places, 220/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21830 ms. Remains : 170/181 places, 220/231 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-06-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CO4-PT-06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLCardinality-08 finished in 22085 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||F(p1)))))'
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 231/231 transitions.
Graph (trivial) has 188 edges and 181 vertex of which 2 / 181 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 297 edges and 180 vertex of which 175 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 174 transition count 163
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 113 transition count 162
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 125 place count 113 transition count 141
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 167 place count 92 transition count 141
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 168 place count 91 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 169 place count 91 transition count 140
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 90 transition count 139
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 90 transition count 139
Performed 29 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
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 229 place count 61 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 232 place count 61 transition count 98
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 234 place count 59 transition count 96
Iterating global reduction 3 with 2 rules applied. Total rules applied 236 place count 59 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 240 place count 57 transition count 94
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 266 place count 44 transition count 95
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 274 place count 44 transition count 87
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 283 place count 35 transition count 69
Iterating global reduction 4 with 9 rules applied. Total rules applied 292 place count 35 transition count 69
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 299 place count 35 transition count 62
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 301 place count 33 transition count 56
Iterating global reduction 5 with 2 rules applied. Total rules applied 303 place count 33 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 305 place count 33 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 309 place count 33 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 311 place count 31 transition count 48
Applied a total of 311 rules in 34 ms. Remains 31 /181 variables (removed 150) and now considering 48/231 (removed 183) transitions.
[2024-06-02 18:03:33] [INFO ] Flow matrix only has 43 transitions (discarded 5 similar events)
// Phase 1: matrix 43 rows 31 cols
[2024-06-02 18:03:33] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 18:03:33] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-02 18:03:33] [INFO ] Flow matrix only has 43 transitions (discarded 5 similar events)
[2024-06-02 18:03:33] [INFO ] Invariant cache hit.
[2024-06-02 18:03:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:03:33] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-06-02 18:03:33] [INFO ] Redundant transitions in 1 ms returned []
Running 38 sub problems to find dead transitions.
[2024-06-02 18:03:33] [INFO ] Flow matrix only has 43 transitions (discarded 5 similar events)
[2024-06-02 18:03:33] [INFO ] Invariant cache hit.
[2024-06-02 18:03:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 42/73 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 1/74 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/74 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 35 constraints, problems are : Problem set: 0 solved, 38 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 31/31 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 42/73 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 38/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 1/74 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/74 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 73 constraints, problems are : Problem set: 0 solved, 38 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 31/31 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
After SMT, in 805ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 805ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/181 places, 48/231 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 908 ms. Remains : 31/181 places, 48/231 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-06-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 119 ms.
Product exploration explored 100000 steps with 1 reset in 88 ms.
Computed a total of 6 stabilizing places and 9 stable transitions
Computed a total of 6 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 107 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 38393 steps (5425 resets) in 510 ms. (75 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 334 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-06-02 18:03:35] [INFO ] Flow matrix only has 43 transitions (discarded 5 similar events)
[2024-06-02 18:03:35] [INFO ] Invariant cache hit.
[2024-06-02 18:03:35] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 18:03:35] [INFO ] Flow matrix only has 43 transitions (discarded 5 similar events)
[2024-06-02 18:03:35] [INFO ] Invariant cache hit.
[2024-06-02 18:03:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:03:35] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-06-02 18:03:35] [INFO ] Redundant transitions in 0 ms returned []
Running 38 sub problems to find dead transitions.
[2024-06-02 18:03:35] [INFO ] Flow matrix only has 43 transitions (discarded 5 similar events)
[2024-06-02 18:03:35] [INFO ] Invariant cache hit.
[2024-06-02 18:03:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 42/73 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 1/74 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/74 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 35 constraints, problems are : Problem set: 0 solved, 38 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 31/31 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 42/73 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 38/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 1/74 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/74 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 73 constraints, problems are : Problem set: 0 solved, 38 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 31/31 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
After SMT, in 955ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 956ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1087 ms. Remains : 31/31 places, 48/48 transitions.
Computed a total of 6 stabilizing places and 9 stable transitions
Computed a total of 6 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 146 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 39727 steps (5605 resets) in 95 ms. (413 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 303 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7 reset in 35 ms.
Product exploration explored 100000 steps with 4 reset in 105 ms.
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 48/48 transitions.
Applied a total of 0 rules in 16 ms. Remains 31 /31 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-06-02 18:03:37] [INFO ] Flow matrix only has 43 transitions (discarded 5 similar events)
[2024-06-02 18:03:37] [INFO ] Invariant cache hit.
[2024-06-02 18:03:37] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 18:03:37] [INFO ] Flow matrix only has 43 transitions (discarded 5 similar events)
[2024-06-02 18:03:37] [INFO ] Invariant cache hit.
[2024-06-02 18:03:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:03:38] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-06-02 18:03:38] [INFO ] Redundant transitions in 1 ms returned []
Running 38 sub problems to find dead transitions.
[2024-06-02 18:03:38] [INFO ] Flow matrix only has 43 transitions (discarded 5 similar events)
[2024-06-02 18:03:38] [INFO ] Invariant cache hit.
[2024-06-02 18:03:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 42/73 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 1/74 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/74 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 35 constraints, problems are : Problem set: 0 solved, 38 unsolved in 416 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 31/31 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 42/73 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 38/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 1/74 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/74 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 73 constraints, problems are : Problem set: 0 solved, 38 unsolved in 414 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 31/31 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
After SMT, in 874ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 875ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 998 ms. Remains : 31/31 places, 48/48 transitions.
Treatment of property CO4-PT-06-LTLCardinality-09 finished in 5437 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))))'
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 231/231 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 180 transition count 231
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 172 transition count 223
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 172 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 172 transition count 221
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 24 place count 167 transition count 216
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 167 transition count 216
Applied a total of 29 rules in 4 ms. Remains 167 /181 variables (removed 14) and now considering 216/231 (removed 15) transitions.
// Phase 1: matrix 216 rows 167 cols
[2024-06-02 18:03:39] [INFO ] Computed 3 invariants in 3 ms
[2024-06-02 18:03:39] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 18:03:39] [INFO ] Invariant cache hit.
[2024-06-02 18:03:39] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-06-02 18:03:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 216/383 variables, 167/170 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-02 18:03:43] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 2 ms to minimize.
[2024-06-02 18:03:43] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/383 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 172 constraints, problems are : Problem set: 0 solved, 215 unsolved in 8385 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/383 variables, 167/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 215/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/383 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 387 constraints, problems are : Problem set: 0 solved, 215 unsolved in 7524 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints]
After SMT, in 15969ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 15974ms
Starting structural reductions in LTL mode, iteration 1 : 167/181 places, 216/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16176 ms. Remains : 167/181 places, 216/231 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-06-LTLCardinality-10
Product exploration explored 100000 steps with 9 reset in 61 ms.
Product exploration explored 100000 steps with 5 reset in 72 ms.
Computed a total of 10 stabilizing places and 12 stable transitions
Graph (complete) has 281 edges and 167 vertex of which 164 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 10 stabilizing places and 12 stable transitions
Detected a total of 10/167 stabilizing places and 12/216 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 : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 30426 steps (58 resets) in 74 ms. (405 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 167 /167 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-02 18:03:56] [INFO ] Invariant cache hit.
[2024-06-02 18:03:56] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 18:03:56] [INFO ] Invariant cache hit.
[2024-06-02 18:03:56] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-06-02 18:03:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 216/383 variables, 167/170 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-02 18:03:59] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 2 ms to minimize.
[2024-06-02 18:03:59] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/383 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 172 constraints, problems are : Problem set: 0 solved, 215 unsolved in 7336 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/383 variables, 167/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 215/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/383 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 387 constraints, problems are : Problem set: 0 solved, 215 unsolved in 7378 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints]
After SMT, in 14747ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 14750ms
Finished structural reductions in LTL mode , in 1 iterations and 14895 ms. Remains : 167/167 places, 216/216 transitions.
Computed a total of 10 stabilizing places and 12 stable transitions
Graph (complete) has 281 edges and 167 vertex of which 164 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 10 stabilizing places and 12 stable transitions
Detected a total of 10/167 stabilizing places and 12/216 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 : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (47 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30378 steps (15 resets) in 39 ms. (759 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10 reset in 59 ms.
Product exploration explored 100000 steps with 17 reset in 102 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 216/216 transitions.
Graph (trivial) has 177 edges and 167 vertex of which 2 / 167 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 280 edges and 166 vertex of which 163 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 163 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 163 transition count 211
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 57 place count 163 transition count 232
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 79 place count 163 transition count 232
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 90 place count 152 transition count 221
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 101 place count 152 transition count 221
Performed 20 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 121 place count 152 transition count 241
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 125 place count 152 transition count 237
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 137 place count 140 transition count 223
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 149 place count 140 transition count 223
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 140 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 151 place count 140 transition count 222
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 153 place count 138 transition count 220
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 155 place count 138 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 138 transition count 220
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 157 place count 137 transition count 219
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 158 place count 137 transition count 219
Performed 23 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 97 places in 1 ms
Iterating global reduction 4 with 23 rules applied. Total rules applied 181 place count 137 transition count 319
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 202 place count 137 transition count 298
Discarding 44 places :
Symmetric choice reduction at 5 with 44 rule applications. Total rules 246 place count 93 transition count 196
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 5 with 44 rules applied. Total rules applied 290 place count 93 transition count 196
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 307 place count 93 transition count 179
Discarding 29 places :
Symmetric choice reduction at 6 with 29 rule applications. Total rules 336 place count 64 transition count 125
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 6 with 29 rules applied. Total rules applied 365 place count 64 transition count 125
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 368 place count 64 transition count 122
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 374 place count 58 transition count 110
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 380 place count 58 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 381 place count 58 transition count 135
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 388 place count 58 transition count 128
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 391 place count 55 transition count 110
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 394 place count 55 transition count 110
Deduced a syphon composed of 30 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 401 place count 55 transition count 103
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 401 rules in 57 ms. Remains 55 /167 variables (removed 112) and now considering 103/216 (removed 113) transitions.
[2024-06-02 18:04:12] [INFO ] Redundant transitions in 1 ms returned []
Running 102 sub problems to find dead transitions.
[2024-06-02 18:04:12] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
// Phase 1: matrix 100 rows 55 cols
[2024-06-02 18:04:12] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 18:04:12] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-02 18:04:12] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
[2024-06-02 18:04:12] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-02 18:04:12] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 3/6 constraints. Problems are: Problem set: 9 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 9 solved, 93 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
At refinement iteration 4 (OVERLAPS) 99/154 variables, 55/61 constraints. Problems are: Problem set: 66 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 11/72 constraints. Problems are: Problem set: 66 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/72 constraints. Problems are: Problem set: 66 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 1/155 variables, 1/73 constraints. Problems are: Problem set: 66 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/73 constraints. Problems are: Problem set: 66 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 0/155 variables, 0/73 constraints. Problems are: Problem set: 66 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 73 constraints, problems are : Problem set: 66 solved, 36 unsolved in 1185 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 55/55 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 66 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 66 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 8/32 variables, 3/3 constraints. Problems are: Problem set: 66 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 3/6 constraints. Problems are: Problem set: 66 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 66 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 93/125 variables, 32/38 constraints. Problems are: Problem set: 66 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 11/49 constraints. Problems are: Problem set: 66 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 36/85 constraints. Problems are: Problem set: 66 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/85 constraints. Problems are: Problem set: 66 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 29/154 variables, 23/108 constraints. Problems are: Problem set: 66 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/108 constraints. Problems are: Problem set: 66 solved, 36 unsolved
At refinement iteration 10 (OVERLAPS) 1/155 variables, 1/109 constraints. Problems are: Problem set: 66 solved, 36 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 0/109 constraints. Problems are: Problem set: 66 solved, 36 unsolved
At refinement iteration 12 (OVERLAPS) 0/155 variables, 0/109 constraints. Problems are: Problem set: 66 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 109 constraints, problems are : Problem set: 66 solved, 36 unsolved in 821 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 55/55 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 36/102 constraints, Known Traps: 3/3 constraints]
After SMT, in 2034ms problems are : Problem set: 66 solved, 36 unsolved
Search for dead transitions found 66 dead transitions in 2037ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 55/167 places, 37/216 transitions.
Graph (complete) has 75 edges and 55 vertex of which 25 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 25 /55 variables (removed 30) and now considering 37/37 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/167 places, 37/216 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2112 ms. Remains : 25/167 places, 37/216 transitions.
Support contains 1 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 167 /167 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 167 cols
[2024-06-02 18:04:14] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:04:14] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-02 18:04:14] [INFO ] Invariant cache hit.
[2024-06-02 18:04:14] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-06-02 18:04:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 216/383 variables, 167/170 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-02 18:04:17] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
[2024-06-02 18:04:17] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/383 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 172 constraints, problems are : Problem set: 0 solved, 215 unsolved in 7392 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/383 variables, 167/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 215/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/383 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 387 constraints, problems are : Problem set: 0 solved, 215 unsolved in 7740 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints]
After SMT, in 15158ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 15160ms
Finished structural reductions in LTL mode , in 1 iterations and 15296 ms. Remains : 167/167 places, 216/216 transitions.
Treatment of property CO4-PT-06-LTLCardinality-10 finished in 50707 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 U p1)&&F(p2))))'
Support contains 6 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 231/231 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 180 transition count 231
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 175 transition count 226
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 175 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 175 transition count 224
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 16 place count 172 transition count 221
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 172 transition count 221
Applied a total of 19 rules in 4 ms. Remains 172 /181 variables (removed 9) and now considering 221/231 (removed 10) transitions.
// Phase 1: matrix 221 rows 172 cols
[2024-06-02 18:04:29] [INFO ] Computed 3 invariants in 3 ms
[2024-06-02 18:04:29] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-06-02 18:04:29] [INFO ] Invariant cache hit.
[2024-06-02 18:04:29] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-06-02 18:04:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 221/393 variables, 172/175 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-02 18:04:33] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 5 ms to minimize.
[2024-06-02 18:04:33] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/393 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 177 constraints, problems are : Problem set: 0 solved, 220 unsolved in 7894 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/393 variables, 172/177 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 220/397 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/393 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/393 variables, and 397 constraints, problems are : Problem set: 0 solved, 220 unsolved in 7408 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 2/2 constraints]
After SMT, in 15333ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 15335ms
Starting structural reductions in LTL mode, iteration 1 : 172/181 places, 221/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15634 ms. Remains : 172/181 places, 221/231 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : CO4-PT-06-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 435 ms.
Product exploration explored 100000 steps with 50000 reset in 182 ms.
Computed a total of 10 stabilizing places and 12 stable transitions
Graph (complete) has 288 edges and 172 vertex of which 169 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 10 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 76 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-06-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-06-LTLCardinality-12 finished in 16557 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 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 231/231 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 180 transition count 231
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 173 transition count 224
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 173 transition count 224
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 173 transition count 222
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 21 place count 169 transition count 218
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 169 transition count 218
Applied a total of 25 rules in 13 ms. Remains 169 /181 variables (removed 12) and now considering 218/231 (removed 13) transitions.
// Phase 1: matrix 218 rows 169 cols
[2024-06-02 18:04:46] [INFO ] Computed 3 invariants in 2 ms
[2024-06-02 18:04:46] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 18:04:46] [INFO ] Invariant cache hit.
[2024-06-02 18:04:46] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 18:04:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/387 variables, 169/172 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 18:04:49] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:04:49] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/387 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/387 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 174 constraints, problems are : Problem set: 0 solved, 217 unsolved in 7730 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/387 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 217/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/387 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 391 constraints, problems are : Problem set: 0 solved, 217 unsolved in 6771 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints]
After SMT, in 14532ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 14535ms
Starting structural reductions in LTL mode, iteration 1 : 169/181 places, 218/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14699 ms. Remains : 169/181 places, 218/231 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-06-LTLCardinality-14
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 1 ms.
FORMULA CO4-PT-06-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLCardinality-14 finished in 14786 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||F(p1)))))'
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))))'
Found a Lengthening insensitive property : CO4-PT-06-LTLCardinality-10
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 181/181 places, 231/231 transitions.
Graph (trivial) has 191 edges and 181 vertex of which 2 / 181 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 297 edges and 180 vertex of which 175 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 174 transition count 160
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 110 transition count 159
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 131 place count 110 transition count 138
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 173 place count 89 transition count 138
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 174 place count 88 transition count 137
Iterating global reduction 2 with 1 rules applied. Total rules applied 175 place count 88 transition count 137
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 176 place count 87 transition count 136
Iterating global reduction 2 with 1 rules applied. Total rules applied 177 place count 87 transition count 136
Performed 29 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
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 235 place count 58 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 238 place count 58 transition count 95
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 240 place count 56 transition count 93
Iterating global reduction 3 with 2 rules applied. Total rules applied 242 place count 56 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 246 place count 54 transition count 91
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 274 place count 40 transition count 92
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 283 place count 40 transition count 83
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 294 place count 29 transition count 61
Iterating global reduction 4 with 11 rules applied. Total rules applied 305 place count 29 transition count 61
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 313 place count 29 transition count 53
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 316 place count 26 transition count 44
Iterating global reduction 5 with 3 rules applied. Total rules applied 319 place count 26 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 321 place count 26 transition count 42
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 323 place count 24 transition count 40
Applied a total of 323 rules in 25 ms. Remains 24 /181 variables (removed 157) and now considering 40/231 (removed 191) transitions.
[2024-06-02 18:05:01] [INFO ] Flow matrix only has 37 transitions (discarded 3 similar events)
// Phase 1: matrix 37 rows 24 cols
[2024-06-02 18:05:01] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 18:05:01] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-02 18:05:01] [INFO ] Flow matrix only has 37 transitions (discarded 3 similar events)
[2024-06-02 18:05:01] [INFO ] Invariant cache hit.
[2024-06-02 18:05:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:05:01] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2024-06-02 18:05:01] [INFO ] Flow matrix only has 37 transitions (discarded 3 similar events)
[2024-06-02 18:05:01] [INFO ] Invariant cache hit.
[2024-06-02 18:05:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 36/60 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 1/61 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 0/61 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 28 constraints, problems are : Problem set: 0 solved, 29 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 36/60 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 29/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 1/61 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 0/61 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 57 constraints, problems are : Problem set: 0 solved, 29 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
After SMT, in 540ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 540ms
Starting structural reductions in LI_LTL mode, iteration 1 : 24/181 places, 40/231 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 630 ms. Remains : 24/181 places, 40/231 transitions.
Running random walk in product with property : CO4-PT-06-LTLCardinality-10
Product exploration explored 100000 steps with 3 reset in 76 ms.
Product exploration explored 100000 steps with 7 reset in 67 ms.
Computed a total of 6 stabilizing places and 12 stable transitions
Computed a total of 6 stabilizing places and 12 stable transitions
Detected a total of 6/24 stabilizing places and 12/40 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be false thanks to negative knowledge :(X (X (NOT p0)))
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
Treatment of property CO4-PT-06-LTLCardinality-10 finished in 1147 ms.
FORMULA CO4-PT-06-LTLCardinality-10 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-02 18:05:02] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:05:02] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-02 18:05:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 181 places, 231 transitions and 524 arcs took 2 ms.
Total runtime 116012 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CO4-PT-06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 181
TRANSITIONS: 231
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.000s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 1120
MODEL NAME: /home/mcc/execution/410/model
181 places, 231 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 CO4-PT-06-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CO4-PT-06-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717351517187

--------------------
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

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="CO4-PT-06"
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 CO4-PT-06, 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 r549-tall-171734897700043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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