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.r579-smll-171734921300115.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 ltsminxred
Input is MedleyA-PT-15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921300115
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 110K 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 MedleyA-PT-15-LTLCardinality-00
FORMULA_NAME MedleyA-PT-15-LTLCardinality-01
FORMULA_NAME MedleyA-PT-15-LTLCardinality-02
FORMULA_NAME MedleyA-PT-15-LTLCardinality-03
FORMULA_NAME MedleyA-PT-15-LTLCardinality-04
FORMULA_NAME MedleyA-PT-15-LTLCardinality-05
FORMULA_NAME MedleyA-PT-15-LTLCardinality-06
FORMULA_NAME MedleyA-PT-15-LTLCardinality-07
FORMULA_NAME MedleyA-PT-15-LTLCardinality-08
FORMULA_NAME MedleyA-PT-15-LTLCardinality-09
FORMULA_NAME MedleyA-PT-15-LTLCardinality-10
FORMULA_NAME MedleyA-PT-15-LTLCardinality-11
FORMULA_NAME MedleyA-PT-15-LTLCardinality-12
FORMULA_NAME MedleyA-PT-15-LTLCardinality-13
FORMULA_NAME MedleyA-PT-15-LTLCardinality-14
FORMULA_NAME MedleyA-PT-15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717357762460

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:49:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 19:49:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:49:24] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2024-06-02 19:49:24] [INFO ] Transformed 192 places.
[2024-06-02 19:49:24] [INFO ] Transformed 475 transitions.
[2024-06-02 19:49:24] [INFO ] Found NUPN structural information;
[2024-06-02 19:49:24] [INFO ] Parsed PT model containing 192 places and 475 transitions and 1522 arcs in 336 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-15-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-15-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-15-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-15-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-15-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-15-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-15-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-15-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-15-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-15-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-15-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 473/473 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 146 transition count 397
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 146 transition count 397
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 115 place count 146 transition count 374
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 117 place count 144 transition count 370
Iterating global reduction 1 with 2 rules applied. Total rules applied 119 place count 144 transition count 370
Applied a total of 119 rules in 66 ms. Remains 144 /192 variables (removed 48) and now considering 370/473 (removed 103) transitions.
// Phase 1: matrix 370 rows 144 cols
[2024-06-02 19:49:25] [INFO ] Computed 7 invariants in 41 ms
[2024-06-02 19:49:25] [INFO ] Implicit Places using invariants in 480 ms returned []
[2024-06-02 19:49:25] [INFO ] Invariant cache hit.
[2024-06-02 19:49:26] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 950 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2024-06-02 19:49:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-02 19:49:30] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 23 ms to minimize.
[2024-06-02 19:49:30] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 3 ms to minimize.
[2024-06-02 19:49:31] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 4 ms to minimize.
[2024-06-02 19:49:31] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 3 ms to minimize.
[2024-06-02 19:49:31] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 4 ms to minimize.
[2024-06-02 19:49:31] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 2 ms to minimize.
[2024-06-02 19:49:31] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 2 ms to minimize.
[2024-06-02 19:49:31] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
[2024-06-02 19:49:32] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 2 ms to minimize.
[2024-06-02 19:49:32] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 1 ms to minimize.
[2024-06-02 19:49:32] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-06-02 19:49:32] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-06-02 19:49:32] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 1 ms to minimize.
[2024-06-02 19:49:32] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 3 ms to minimize.
[2024-06-02 19:49:32] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 3 ms to minimize.
[2024-06-02 19:49:32] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:49:33] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 3 ms to minimize.
[2024-06-02 19:49:33] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 2 ms to minimize.
[2024-06-02 19:49:34] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-02 19:49:35] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 2 ms to minimize.
[2024-06-02 19:49:35] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 2 ms to minimize.
[2024-06-02 19:49:35] [INFO ] Deduced a trap composed of 24 places in 213 ms of which 4 ms to minimize.
[2024-06-02 19:49:36] [INFO ] Deduced a trap composed of 83 places in 162 ms of which 2 ms to minimize.
[2024-06-02 19:49:36] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 3 ms to minimize.
[2024-06-02 19:49:37] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-02 19:49:40] [INFO ] Deduced a trap composed of 93 places in 155 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (OVERLAPS) 370/514 variables, 144/177 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-02 19:49:52] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-06-02 19:49:53] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/514 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-02 19:49:55] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/514 variables, and 180 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (OVERLAPS) 370/514 variables, 144/180 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 369/549 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 7 (OVERLAPS) 0/514 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 369 unsolved
No progress, stopping.
After SMT solving in domain Int declared 514/514 variables, and 549 constraints, problems are : Problem set: 0 solved, 369 unsolved in 28568 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 29/29 constraints]
After SMT, in 59207ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 59248ms
Starting structural reductions in LTL mode, iteration 1 : 144/192 places, 370/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60307 ms. Remains : 144/192 places, 370/473 transitions.
Support contains 10 out of 144 places after structural reductions.
[2024-06-02 19:50:26] [INFO ] Flatten gal took : 112 ms
[2024-06-02 19:50:26] [INFO ] Flatten gal took : 50 ms
[2024-06-02 19:50:26] [INFO ] Input system was already deterministic with 370 transitions.
RANDOM walk for 40000 steps (8 resets) in 2511 ms. (15 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 511 ms. (78 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 215 ms. (185 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
[2024-06-02 19:50:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 107/114 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/144 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 370/514 variables, 144/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/514 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 151 constraints, problems are : Problem set: 0 solved, 4 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 107/114 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/144 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 370/514 variables, 144/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:50:28] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/514 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 514/514 variables, and 156 constraints, problems are : Problem set: 0 solved, 4 unsolved in 638 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 910ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 885 ms.
Support contains 6 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 370/370 transitions.
Graph (trivial) has 133 edges and 144 vertex of which 9 / 144 are part of one of the 3 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 138 transition count 344
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 121 transition count 343
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 120 transition count 343
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 37 place count 120 transition count 336
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 51 place count 113 transition count 336
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 55 place count 109 transition count 330
Iterating global reduction 3 with 4 rules applied. Total rules applied 59 place count 109 transition count 330
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 62 place count 109 transition count 327
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 62 place count 109 transition count 325
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 66 place count 107 transition count 325
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 67 place count 107 transition count 324
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 97 place count 92 transition count 309
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 99 place count 90 transition count 302
Iterating global reduction 5 with 2 rules applied. Total rules applied 101 place count 90 transition count 302
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 133 place count 74 transition count 401
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 136 place count 74 transition count 398
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 6 with 33 rules applied. Total rules applied 169 place count 74 transition count 365
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 173 place count 72 transition count 388
Free-agglomeration rule applied 20 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 193 place count 72 transition count 361
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 6 with 44 rules applied. Total rules applied 237 place count 52 transition count 337
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 7 with 29 rules applied. Total rules applied 266 place count 52 transition count 308
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 267 place count 51 transition count 307
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 37 edges and 49 vertex of which 10 / 49 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 270 place count 44 transition count 307
Drop transitions (Empty/Sink Transition effects.) removed 56 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 8 with 74 rules applied. Total rules applied 344 place count 44 transition count 233
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 348 place count 40 transition count 211
Iterating global reduction 9 with 4 rules applied. Total rules applied 352 place count 40 transition count 211
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 354 place count 40 transition count 209
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 10 with 40 rules applied. Total rules applied 394 place count 40 transition count 169
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 400 place count 37 transition count 166
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 402 place count 36 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 10 with 14 rules applied. Total rules applied 416 place count 36 transition count 158
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 417 place count 36 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 418 place count 35 transition count 157
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 419 place count 35 transition count 157
Applied a total of 419 rules in 245 ms. Remains 35 /144 variables (removed 109) and now considering 157/370 (removed 213) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 35/144 places, 157/370 transitions.
RANDOM walk for 30116 steps (119 resets) in 792 ms. (37 steps per ms) remains 0/3 properties
Computed a total of 14 stabilizing places and 14 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 370/370 transitions.
Graph (trivial) has 140 edges and 144 vertex of which 9 / 144 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 137 transition count 345
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 119 transition count 345
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 37 place count 119 transition count 337
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 53 place count 111 transition count 337
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 108 transition count 332
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 108 transition count 332
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 59 place count 108 transition count 331
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 107 transition count 331
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 93 place count 91 transition count 315
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 89 transition count 308
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 89 transition count 308
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -117
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 131 place count 72 transition count 425
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 2 with 36 rules applied. Total rules applied 167 place count 72 transition count 389
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 175 place count 68 transition count 437
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 67 transition count 436
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 61 edges and 66 vertex of which 13 / 66 are part of one of the 5 SCC in 1 ms
Free SCC test removed 8 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 178 place count 58 transition count 436
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 216 place count 58 transition count 398
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 218 place count 56 transition count 360
Iterating global reduction 4 with 2 rules applied. Total rules applied 220 place count 56 transition count 360
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 222 place count 55 transition count 371
Drop transitions (Redundant composition of simpler transitions.) removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 4 with 70 rules applied. Total rules applied 292 place count 55 transition count 301
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 293 place count 54 transition count 285
Iterating global reduction 4 with 1 rules applied. Total rules applied 294 place count 54 transition count 285
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 307 place count 54 transition count 272
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 308 place count 53 transition count 259
Iterating global reduction 5 with 1 rules applied. Total rules applied 309 place count 53 transition count 259
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 315 place count 50 transition count 286
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 5 with 32 rules applied. Total rules applied 347 place count 50 transition count 254
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 348 place count 49 transition count 248
Iterating global reduction 5 with 1 rules applied. Total rules applied 349 place count 49 transition count 248
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 354 place count 49 transition count 243
Applied a total of 354 rules in 164 ms. Remains 49 /144 variables (removed 95) and now considering 243/370 (removed 127) transitions.
[2024-06-02 19:50:30] [INFO ] Flow matrix only has 181 transitions (discarded 62 similar events)
// Phase 1: matrix 181 rows 49 cols
[2024-06-02 19:50:30] [INFO ] Computed 6 invariants in 4 ms
[2024-06-02 19:50:30] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 19:50:30] [INFO ] Flow matrix only has 181 transitions (discarded 62 similar events)
[2024-06-02 19:50:30] [INFO ] Invariant cache hit.
[2024-06-02 19:50:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 19:50:30] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2024-06-02 19:50:30] [INFO ] Redundant transitions in 43 ms returned [229, 240]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 233 sub problems to find dead transitions.
[2024-06-02 19:50:30] [INFO ] Flow matrix only has 179 transitions (discarded 62 similar events)
// Phase 1: matrix 179 rows 49 cols
[2024-06-02 19:50:30] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 19:50:30] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-02 19:50:31] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:50:31] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:50:32] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:50:32] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (OVERLAPS) 1/49 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-02 19:50:34] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:50:34] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-06-02 19:50:34] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (OVERLAPS) 178/227 variables, 49/62 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 42/104 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-02 19:50:36] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 10 (OVERLAPS) 0/227 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/228 variables, and 105 constraints, problems are : Problem set: 0 solved, 233 unsolved in 10881 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 49/49 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (OVERLAPS) 1/49 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (OVERLAPS) 178/227 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 42/105 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 233/338 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (OVERLAPS) 0/227 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/228 variables, and 338 constraints, problems are : Problem set: 0 solved, 233 unsolved in 13928 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 49/49 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 8/8 constraints]
After SMT, in 25203ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 25211ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/144 places, 241/370 transitions.
Applied a total of 0 rules in 6 ms. Remains 49 /49 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 25731 ms. Remains : 49/144 places, 241/370 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 308 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 7 in 1 ms.
FORMULA MedleyA-PT-15-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-15-LTLCardinality-01 finished in 26334 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(p0))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 370/370 transitions.
Graph (trivial) has 139 edges and 144 vertex of which 9 / 144 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 137 transition count 345
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 119 transition count 345
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 37 place count 119 transition count 338
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 51 place count 112 transition count 338
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 107 transition count 331
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 107 transition count 331
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 107 transition count 328
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 64 place count 107 transition count 325
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 70 place count 104 transition count 325
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 98 place count 90 transition count 311
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 88 transition count 304
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 88 transition count 304
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -117
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 136 place count 71 transition count 421
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 3 with 37 rules applied. Total rules applied 173 place count 71 transition count 384
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
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 177 place count 69 transition count 407
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 68 transition count 406
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 77 edges and 66 vertex of which 28 / 66 are part of one of the 11 SCC in 1 ms
Free SCC test removed 17 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 181 place count 49 transition count 406
Ensure Unique test removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Iterating post reduction 4 with 85 rules applied. Total rules applied 266 place count 49 transition count 321
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 271 place count 44 transition count 256
Iterating global reduction 5 with 5 rules applied. Total rules applied 276 place count 44 transition count 256
Drop transitions (Redundant composition of simpler transitions.) removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 5 with 80 rules applied. Total rules applied 356 place count 44 transition count 176
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 357 place count 44 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 358 place count 43 transition count 175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 358 place count 43 transition count 174
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 360 place count 42 transition count 174
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 7 with 4 rules applied. Total rules applied 364 place count 40 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 369 place count 40 transition count 167
Applied a total of 369 rules in 110 ms. Remains 40 /144 variables (removed 104) and now considering 167/370 (removed 203) transitions.
[2024-06-02 19:50:56] [INFO ] Flow matrix only has 150 transitions (discarded 17 similar events)
// Phase 1: matrix 150 rows 40 cols
[2024-06-02 19:50:56] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 19:50:56] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 19:50:56] [INFO ] Flow matrix only has 150 transitions (discarded 17 similar events)
[2024-06-02 19:50:56] [INFO ] Invariant cache hit.
[2024-06-02 19:50:56] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 19:50:56] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-06-02 19:50:56] [INFO ] Redundant transitions in 58 ms returned [103, 133, 134, 135, 157, 163, 165, 166]
Found 8 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 8 transitions
Redundant transitions reduction (with SMT) removed 8 transitions.
Running 153 sub problems to find dead transitions.
[2024-06-02 19:50:56] [INFO ] Flow matrix only has 142 transitions (discarded 17 similar events)
// Phase 1: matrix 142 rows 40 cols
[2024-06-02 19:50:56] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 19:50:56] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-02 19:50:57] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:50:57] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
[2024-06-02 19:50:57] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-06-02 19:50:57] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 141/181 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 35/84 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 0/181 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/182 variables, and 84 constraints, problems are : Problem set: 0 solved, 153 unsolved in 5455 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 40/40 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 141/181 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 35/84 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 153/237 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-02 19:51:05] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (OVERLAPS) 0/181 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/182 variables, and 238 constraints, problems are : Problem set: 0 solved, 153 unsolved in 7736 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 40/40 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 5/5 constraints]
After SMT, in 13371ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 13374ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/144 places, 159/370 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 40 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 39 transition count 158
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 39 transition count 157
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 38 transition count 157
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 37 transition count 155
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 37 transition count 155
Applied a total of 6 rules in 9 ms. Remains 37 /40 variables (removed 3) and now considering 155/159 (removed 4) transitions.
[2024-06-02 19:51:10] [INFO ] Flow matrix only has 138 transitions (discarded 17 similar events)
// Phase 1: matrix 138 rows 37 cols
[2024-06-02 19:51:10] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 19:51:10] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 19:51:10] [INFO ] Flow matrix only has 138 transitions (discarded 17 similar events)
[2024-06-02 19:51:10] [INFO ] Invariant cache hit.
[2024-06-02 19:51:10] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 19:51:10] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/144 places, 155/370 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14094 ms. Remains : 37/144 places, 155/370 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-15-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-15-LTLCardinality-09 finished in 14159 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(p0)&&F(G(p1))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 370/370 transitions.
Graph (trivial) has 138 edges and 144 vertex of which 9 / 144 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 137 transition count 345
Reduce places removed 18 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 119 transition count 343
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 117 transition count 343
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 41 place count 117 transition count 337
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 53 place count 111 transition count 337
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 58 place count 106 transition count 330
Iterating global reduction 3 with 5 rules applied. Total rules applied 63 place count 106 transition count 330
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 66 place count 106 transition count 327
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 66 place count 106 transition count 324
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 72 place count 103 transition count 324
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 100 place count 89 transition count 310
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 101 place count 88 transition count 306
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 88 transition count 306
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -126
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 136 place count 71 transition count 432
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 176 place count 71 transition count 392
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 182 place count 68 transition count 428
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 183 place count 67 transition count 427
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 71 edges and 65 vertex of which 26 / 65 are part of one of the 10 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 186 place count 49 transition count 427
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 5 with 84 rules applied. Total rules applied 270 place count 49 transition count 343
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 274 place count 45 transition count 291
Iterating global reduction 6 with 4 rules applied. Total rules applied 278 place count 45 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 91 transitions
Redundant transition composition rules discarded 91 transitions
Iterating global reduction 6 with 91 rules applied. Total rules applied 369 place count 45 transition count 200
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 369 place count 45 transition count 198
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 373 place count 43 transition count 198
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 6 with 4 rules applied. Total rules applied 377 place count 41 transition count 196
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 383 place count 41 transition count 190
Applied a total of 383 rules in 100 ms. Remains 41 /144 variables (removed 103) and now considering 190/370 (removed 180) transitions.
[2024-06-02 19:51:10] [INFO ] Flow matrix only has 170 transitions (discarded 20 similar events)
// Phase 1: matrix 170 rows 41 cols
[2024-06-02 19:51:10] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 19:51:10] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 19:51:10] [INFO ] Flow matrix only has 170 transitions (discarded 20 similar events)
[2024-06-02 19:51:10] [INFO ] Invariant cache hit.
[2024-06-02 19:51:10] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 19:51:10] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2024-06-02 19:51:10] [INFO ] Redundant transitions in 51 ms returned [107, 108, 110, 137, 138, 139, 140, 181, 182, 186, 187, 189]
Found 12 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 12 transitions
Redundant transitions reduction (with SMT) removed 12 transitions.
Running 172 sub problems to find dead transitions.
[2024-06-02 19:51:10] [INFO ] Flow matrix only has 158 transitions (discarded 20 similar events)
// Phase 1: matrix 158 rows 41 cols
[2024-06-02 19:51:10] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 19:51:10] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-02 19:51:11] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:51:11] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:51:11] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:51:11] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:51:12] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (OVERLAPS) 157/198 variables, 41/51 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 36/87 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-02 19:51:14] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/199 variables, and 88 constraints, problems are : Problem set: 0 solved, 172 unsolved in 7753 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (OVERLAPS) 157/198 variables, 41/52 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 36/88 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 172/260 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/199 variables, and 260 constraints, problems are : Problem set: 0 solved, 172 unsolved in 7199 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 6/6 constraints]
After SMT, in 15178ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 15181ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/144 places, 178/370 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 41 transition count 176
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 39 transition count 176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 38 transition count 174
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 38 transition count 174
Applied a total of 6 rules in 11 ms. Remains 38 /41 variables (removed 3) and now considering 174/178 (removed 4) transitions.
[2024-06-02 19:51:25] [INFO ] Flow matrix only has 154 transitions (discarded 20 similar events)
// Phase 1: matrix 154 rows 38 cols
[2024-06-02 19:51:25] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 19:51:26] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 19:51:26] [INFO ] Flow matrix only has 154 transitions (discarded 20 similar events)
[2024-06-02 19:51:26] [INFO ] Invariant cache hit.
[2024-06-02 19:51:26] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 19:51:26] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/144 places, 174/370 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15802 ms. Remains : 38/144 places, 174/370 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-15-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 106 ms.
Product exploration explored 100000 steps with 0 reset in 128 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 129 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
RANDOM walk for 6118 steps (1514 resets) in 42 ms. (142 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Support contains 2 out of 38 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 174/174 transitions.
Applied a total of 0 rules in 4 ms. Remains 38 /38 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-06-02 19:51:26] [INFO ] Flow matrix only has 154 transitions (discarded 20 similar events)
[2024-06-02 19:51:26] [INFO ] Invariant cache hit.
[2024-06-02 19:51:27] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 19:51:27] [INFO ] Flow matrix only has 154 transitions (discarded 20 similar events)
[2024-06-02 19:51:27] [INFO ] Invariant cache hit.
[2024-06-02 19:51:27] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 19:51:27] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2024-06-02 19:51:27] [INFO ] Redundant transitions in 18 ms returned []
Running 168 sub problems to find dead transitions.
[2024-06-02 19:51:27] [INFO ] Flow matrix only has 154 transitions (discarded 20 similar events)
[2024-06-02 19:51:27] [INFO ] Invariant cache hit.
[2024-06-02 19:51:27] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-02 19:51:27] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:51:27] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:51:27] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:51:28] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:51:28] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 153/191 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 36/84 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-02 19:51:29] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/192 variables, and 85 constraints, problems are : Problem set: 0 solved, 168 unsolved in 5839 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 38/38 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 153/191 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 36/85 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 168/253 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-02 19:51:36] [INFO ] Deduced a trap composed of 16 places in 400 ms of which 23 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/192 variables, and 254 constraints, problems are : Problem set: 0 solved, 168 unsolved in 10974 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 38/38 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 7/7 constraints]
After SMT, in 16998ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 17000ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17212 ms. Remains : 38/38 places, 174/174 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
RANDOM walk for 13170 steps (3284 resets) in 26 ms. (487 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 59 ms.
Product exploration explored 100000 steps with 0 reset in 317 ms.
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 174/174 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 38 transition count 173
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 37 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 36 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 36 transition count 163
Applied a total of 4 rules in 6 ms. Remains 36 /38 variables (removed 2) and now considering 163/174 (removed 11) transitions.
[2024-06-02 19:51:44] [INFO ] Flow matrix only has 143 transitions (discarded 20 similar events)
// Phase 1: matrix 143 rows 36 cols
[2024-06-02 19:51:44] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 19:51:45] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 19:51:45] [INFO ] Flow matrix only has 143 transitions (discarded 20 similar events)
[2024-06-02 19:51:45] [INFO ] Invariant cache hit.
[2024-06-02 19:51:45] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 19:51:45] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-06-02 19:51:45] [INFO ] Redundant transitions in 27 ms returned []
Running 157 sub problems to find dead transitions.
[2024-06-02 19:51:45] [INFO ] Flow matrix only has 143 transitions (discarded 20 similar events)
[2024-06-02 19:51:45] [INFO ] Invariant cache hit.
[2024-06-02 19:51:45] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-06-02 19:51:45] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 12 ms to minimize.
[2024-06-02 19:51:45] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 2 ms to minimize.
[2024-06-02 19:51:46] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-06-02 19:51:46] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:51:46] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-06-02 19:51:46] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:51:46] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (OVERLAPS) 142/178 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 36/84 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-06-02 19:51:48] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 0/178 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/179 variables, and 85 constraints, problems are : Problem set: 0 solved, 157 unsolved in 6556 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (OVERLAPS) 142/178 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 36/85 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 157/242 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 0/178 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/179 variables, and 242 constraints, problems are : Problem set: 0 solved, 157 unsolved in 7913 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 8/8 constraints]
After SMT, in 14610ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 14612ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/38 places, 163/174 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14910 ms. Remains : 36/38 places, 163/174 transitions.
Treatment of property MedleyA-PT-15-LTLCardinality-10 finished in 49650 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 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 370/370 transitions.
Graph (trivial) has 140 edges and 144 vertex of which 9 / 144 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 137 transition count 344
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 118 transition count 344
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 39 place count 118 transition count 337
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 53 place count 111 transition count 337
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 57 place count 107 transition count 331
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 107 transition count 331
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 107 transition count 328
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 64 place count 107 transition count 326
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 68 place count 105 transition count 326
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 98 place count 90 transition count 311
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 88 transition count 304
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 88 transition count 304
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 134 place count 72 transition count 403
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 3 with 34 rules applied. Total rules applied 168 place count 72 transition count 369
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 176 place count 68 transition count 416
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 177 place count 67 transition count 415
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 74 edges and 65 vertex of which 28 / 65 are part of one of the 11 SCC in 0 ms
Free SCC test removed 17 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 180 place count 48 transition count 415
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 4 with 86 rules applied. Total rules applied 266 place count 48 transition count 329
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 271 place count 43 transition count 265
Iterating global reduction 5 with 5 rules applied. Total rules applied 276 place count 43 transition count 265
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 285 place count 43 transition count 256
Drop transitions (Redundant composition of simpler transitions.) removed 78 transitions
Redundant transition composition rules discarded 78 transitions
Iterating global reduction 6 with 78 rules applied. Total rules applied 363 place count 43 transition count 178
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 363 place count 43 transition count 176
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 367 place count 41 transition count 176
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 368 place count 40 transition count 170
Iterating global reduction 6 with 1 rules applied. Total rules applied 369 place count 40 transition count 170
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 6 with 4 rules applied. Total rules applied 373 place count 38 transition count 168
Applied a total of 373 rules in 82 ms. Remains 38 /144 variables (removed 106) and now considering 168/370 (removed 202) transitions.
[2024-06-02 19:52:00] [INFO ] Flow matrix only has 148 transitions (discarded 20 similar events)
// Phase 1: matrix 148 rows 38 cols
[2024-06-02 19:52:00] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 19:52:00] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 19:52:00] [INFO ] Flow matrix only has 148 transitions (discarded 20 similar events)
[2024-06-02 19:52:00] [INFO ] Invariant cache hit.
[2024-06-02 19:52:00] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-02 19:52:00] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2024-06-02 19:52:00] [INFO ] Redundant transitions in 40 ms returned [117, 119, 162, 164, 166, 167]
Found 6 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 6 transitions
Redundant transitions reduction (with SMT) removed 6 transitions.
Running 156 sub problems to find dead transitions.
[2024-06-02 19:52:00] [INFO ] Flow matrix only has 142 transitions (discarded 20 similar events)
// Phase 1: matrix 142 rows 38 cols
[2024-06-02 19:52:00] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 19:52:00] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-02 19:52:01] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:52:01] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:52:01] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:52:01] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 141/179 variables, 38/47 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 32/79 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-02 19:52:03] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 0/179 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/180 variables, and 80 constraints, problems are : Problem set: 0 solved, 156 unsolved in 6778 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 38/38 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 141/179 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 32/80 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 156/236 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-02 19:52:09] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (OVERLAPS) 0/179 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/180 variables, and 237 constraints, problems are : Problem set: 0 solved, 156 unsolved in 9040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 38/38 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 6/6 constraints]
After SMT, in 16024ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 16027ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/144 places, 162/370 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 38 transition count 161
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 37 transition count 161
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 36 transition count 160
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 12 place count 36 transition count 152
Applied a total of 12 rules in 9 ms. Remains 36 /38 variables (removed 2) and now considering 152/162 (removed 10) transitions.
[2024-06-02 19:52:16] [INFO ] Flow matrix only has 135 transitions (discarded 17 similar events)
// Phase 1: matrix 135 rows 36 cols
[2024-06-02 19:52:16] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 19:52:16] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 19:52:16] [INFO ] Flow matrix only has 135 transitions (discarded 17 similar events)
[2024-06-02 19:52:16] [INFO ] Invariant cache hit.
[2024-06-02 19:52:16] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-02 19:52:16] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/144 places, 152/370 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16650 ms. Remains : 36/144 places, 152/370 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLCardinality-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-15-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-15-LTLCardinality-11 finished in 16723 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 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 370/370 transitions.
Graph (trivial) has 139 edges and 144 vertex of which 9 / 144 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 137 transition count 343
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 117 transition count 343
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 41 place count 117 transition count 336
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 55 place count 110 transition count 336
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 60 place count 105 transition count 329
Iterating global reduction 2 with 5 rules applied. Total rules applied 65 place count 105 transition count 329
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 105 transition count 326
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 68 place count 105 transition count 323
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 74 place count 102 transition count 323
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 102 place count 88 transition count 309
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 86 transition count 302
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 86 transition count 302
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -117
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 136 place count 71 transition count 419
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 3 with 48 rules applied. Total rules applied 184 place count 71 transition count 371
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
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 188 place count 69 transition count 393
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 189 place count 68 transition count 392
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 79 edges and 66 vertex of which 28 / 66 are part of one of the 11 SCC in 1 ms
Free SCC test removed 17 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 192 place count 49 transition count 392
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 4 with 87 rules applied. Total rules applied 279 place count 49 transition count 305
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 284 place count 44 transition count 238
Iterating global reduction 5 with 5 rules applied. Total rules applied 289 place count 44 transition count 238
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 299 place count 44 transition count 228
Drop transitions (Redundant composition of simpler transitions.) removed 83 transitions
Redundant transition composition rules discarded 83 transitions
Iterating global reduction 6 with 83 rules applied. Total rules applied 382 place count 44 transition count 145
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 382 place count 44 transition count 143
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 386 place count 42 transition count 143
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 387 place count 41 transition count 137
Iterating global reduction 6 with 1 rules applied. Total rules applied 388 place count 41 transition count 137
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 6 with 4 rules applied. Total rules applied 392 place count 39 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 395 place count 39 transition count 132
Applied a total of 395 rules in 65 ms. Remains 39 /144 variables (removed 105) and now considering 132/370 (removed 238) transitions.
[2024-06-02 19:52:16] [INFO ] Flow matrix only has 124 transitions (discarded 8 similar events)
// Phase 1: matrix 124 rows 39 cols
[2024-06-02 19:52:16] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 19:52:16] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 19:52:16] [INFO ] Flow matrix only has 124 transitions (discarded 8 similar events)
[2024-06-02 19:52:16] [INFO ] Invariant cache hit.
[2024-06-02 19:52:16] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-02 19:52:16] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-06-02 19:52:17] [INFO ] Redundant transitions in 35 ms returned [105, 106, 128, 129, 131]
Found 5 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 5 transitions
Redundant transitions reduction (with SMT) removed 5 transitions.
Running 121 sub problems to find dead transitions.
[2024-06-02 19:52:17] [INFO ] Flow matrix only has 119 transitions (discarded 8 similar events)
// Phase 1: matrix 119 rows 39 cols
[2024-06-02 19:52:17] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 19:52:17] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-02 19:52:17] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:52:17] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-06-02 19:52:17] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:52:17] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:52:17] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-02 19:52:18] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 118/157 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 32/82 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/157 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/158 variables, and 82 constraints, problems are : Problem set: 0 solved, 121 unsolved in 3999 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-02 19:52:21] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 118/157 variables, 39/51 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 32/83 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 121/204 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/157 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/158 variables, and 204 constraints, problems are : Problem set: 0 solved, 121 unsolved in 5212 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 7/7 constraints]
After SMT, in 9316ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 9319ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/144 places, 127/370 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 39 transition count 126
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 38 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 37 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 37 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 36 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 36 transition count 117
Applied a total of 12 rules in 13 ms. Remains 36 /39 variables (removed 3) and now considering 117/127 (removed 10) transitions.
[2024-06-02 19:52:26] [INFO ] Flow matrix only has 110 transitions (discarded 7 similar events)
// Phase 1: matrix 110 rows 36 cols
[2024-06-02 19:52:26] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 19:52:26] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 19:52:26] [INFO ] Flow matrix only has 110 transitions (discarded 7 similar events)
[2024-06-02 19:52:26] [INFO ] Invariant cache hit.
[2024-06-02 19:52:26] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-02 19:52:26] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/144 places, 117/370 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9866 ms. Remains : 36/144 places, 117/370 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLCardinality-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-15-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-15-LTLCardinality-12 finished in 9934 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(p0)&&F(G(p1))))'
[2024-06-02 19:52:27] [INFO ] Flatten gal took : 44 ms
[2024-06-02 19:52:27] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-02 19:52:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 144 places, 370 transitions and 1270 arcs took 13 ms.
Total runtime 182557 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA MedleyA-PT-15-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717357947562

--------------------
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
mcc2024
ltl formula name MedleyA-PT-15-LTLCardinality-10
ltl formula formula --ltl=/tmp/1032/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 144 places, 370 transitions and 1270 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1032/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1032/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1032/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1032/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 145 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 145, there are 387 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~102!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 146
pnml2lts-mc( 0/ 4): unique states count: 1003
pnml2lts-mc( 0/ 4): unique transitions count: 3549
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1447
pnml2lts-mc( 0/ 4): - claim found count: 599
pnml2lts-mc( 0/ 4): - claim success count: 1027
pnml2lts-mc( 0/ 4): - cum. max stack depth: 237
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1034 states 3636 transitions, fanout: 3.516
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 51700, Transitions per second: 181800
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 13.3 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 373 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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="MedleyA-PT-15"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is MedleyA-PT-15, 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 r579-smll-171734921300115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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