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.r575-smll-171734919600123.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is MedleyA-PT-16, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919600123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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 89K 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-16-LTLCardinality-00
FORMULA_NAME MedleyA-PT-16-LTLCardinality-01
FORMULA_NAME MedleyA-PT-16-LTLCardinality-02
FORMULA_NAME MedleyA-PT-16-LTLCardinality-03
FORMULA_NAME MedleyA-PT-16-LTLCardinality-04
FORMULA_NAME MedleyA-PT-16-LTLCardinality-05
FORMULA_NAME MedleyA-PT-16-LTLCardinality-06
FORMULA_NAME MedleyA-PT-16-LTLCardinality-07
FORMULA_NAME MedleyA-PT-16-LTLCardinality-08
FORMULA_NAME MedleyA-PT-16-LTLCardinality-09
FORMULA_NAME MedleyA-PT-16-LTLCardinality-10
FORMULA_NAME MedleyA-PT-16-LTLCardinality-11
FORMULA_NAME MedleyA-PT-16-LTLCardinality-12
FORMULA_NAME MedleyA-PT-16-LTLCardinality-13
FORMULA_NAME MedleyA-PT-16-LTLCardinality-14
FORMULA_NAME MedleyA-PT-16-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717365306944

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 21:55:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 21:55:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:55:10] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2024-06-02 21:55:10] [INFO ] Transformed 196 places.
[2024-06-02 21:55:10] [INFO ] Transformed 392 transitions.
[2024-06-02 21:55:10] [INFO ] Found NUPN structural information;
[2024-06-02 21:55:10] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 572 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-16-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 390/390 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 166 transition count 341
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 166 transition count 341
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 70 place count 166 transition count 331
Applied a total of 70 rules in 85 ms. Remains 166 /196 variables (removed 30) and now considering 331/390 (removed 59) transitions.
// Phase 1: matrix 331 rows 166 cols
[2024-06-02 21:55:10] [INFO ] Computed 7 invariants in 58 ms
[2024-06-02 21:55:11] [INFO ] Implicit Places using invariants in 528 ms returned []
[2024-06-02 21:55:11] [INFO ] Invariant cache hit.
[2024-06-02 21:55:11] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 1126 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
[2024-06-02 21:55:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 21:55:16] [INFO ] Deduced a trap composed of 26 places in 221 ms of which 35 ms to minimize.
[2024-06-02 21:55:17] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 3 ms to minimize.
[2024-06-02 21:55:17] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 4 ms to minimize.
[2024-06-02 21:55:17] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 3 ms to minimize.
[2024-06-02 21:55:17] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 3 ms to minimize.
[2024-06-02 21:55:17] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 3 ms to minimize.
[2024-06-02 21:55:17] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 1 ms to minimize.
[2024-06-02 21:55:17] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-06-02 21:55:18] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 3 ms to minimize.
[2024-06-02 21:55:18] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-06-02 21:55:18] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 3 ms to minimize.
[2024-06-02 21:55:18] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 3 ms to minimize.
[2024-06-02 21:55:18] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 5 ms to minimize.
[2024-06-02 21:55:19] [INFO ] Deduced a trap composed of 109 places in 94 ms of which 2 ms to minimize.
[2024-06-02 21:55:19] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-06-02 21:55:19] [INFO ] Deduced a trap composed of 123 places in 99 ms of which 2 ms to minimize.
[2024-06-02 21:55:19] [INFO ] Deduced a trap composed of 118 places in 126 ms of which 2 ms to minimize.
[2024-06-02 21:55:19] [INFO ] Deduced a trap composed of 122 places in 116 ms of which 3 ms to minimize.
[2024-06-02 21:55:20] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
[2024-06-02 21:55:20] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 21:55:20] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
[2024-06-02 21:55:20] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 3 ms to minimize.
[2024-06-02 21:55:21] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (OVERLAPS) 331/497 variables, 166/196 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 21:55:28] [INFO ] Deduced a trap composed of 96 places in 175 ms of which 4 ms to minimize.
[2024-06-02 21:55:28] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 21:55:39] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-06-02 21:55:39] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 497/497 variables, and 200 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 21:55:45] [INFO ] Deduced a trap composed of 119 places in 167 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 21:55:48] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 3 ms to minimize.
[2024-06-02 21:55:48] [INFO ] Deduced a trap composed of 114 places in 164 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 21:55:50] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (OVERLAPS) 331/497 variables, 166/204 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 330/534 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 21:55:59] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 3 ms to minimize.
[2024-06-02 21:56:01] [INFO ] Deduced a trap composed of 42 places in 152 ms of which 3 ms to minimize.
[2024-06-02 21:56:02] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/497 variables, 3/537 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 21:56:11] [INFO ] Deduced a trap composed of 114 places in 142 ms of which 7 ms to minimize.
[2024-06-02 21:56:11] [INFO ] Deduced a trap composed of 111 places in 167 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/497 variables, and 539 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 36/36 constraints]
After SMT, in 60516ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 60557ms
Starting structural reductions in LTL mode, iteration 1 : 166/196 places, 331/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61816 ms. Remains : 166/196 places, 331/390 transitions.
Support contains 27 out of 166 places after structural reductions.
[2024-06-02 21:56:12] [INFO ] Flatten gal took : 110 ms
[2024-06-02 21:56:12] [INFO ] Flatten gal took : 50 ms
[2024-06-02 21:56:12] [INFO ] Input system was already deterministic with 331 transitions.
Support contains 25 out of 166 places (down from 27) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (8 resets) in 2293 ms. (17 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 712 ms. (56 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (8 resets) in 413 ms. (96 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 213 ms. (186 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 196 ms. (203 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 167 ms. (238 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 106 ms. (373 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (8 resets) in 161 ms. (246 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 258 ms. (154 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 223 ms. (178 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 158 ms. (251 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 128 ms. (310 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 221 ms. (180 steps per ms) remains 11/12 properties
[2024-06-02 21:56:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 129/150 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 16/166 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 331/497 variables, 166/173 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/497 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 173 constraints, problems are : Problem set: 0 solved, 11 unsolved in 635 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 129/150 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-02 21:56:15] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 3 ms to minimize.
[2024-06-02 21:56:15] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 16/166 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 331/497 variables, 166/175 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 11/186 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-02 21:56:16] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/497 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/497 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 187 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 3/3 constraints]
After SMT, in 2667ms problems are : Problem set: 0 solved, 11 unsolved
Parikh walk visited 9 properties in 5410 ms.
Support contains 5 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 331/331 transitions.
Graph (trivial) has 168 edges and 166 vertex of which 13 / 166 are part of one of the 3 SCC in 6 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 156 transition count 288
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 65 place count 126 transition count 284
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 124 transition count 284
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 67 place count 124 transition count 276
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 83 place count 116 transition count 276
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 84 place count 116 transition count 275
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 91 place count 109 transition count 262
Iterating global reduction 4 with 7 rules applied. Total rules applied 98 place count 109 transition count 262
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 4 with 1 rules applied. Total rules applied 99 place count 109 transition count 261
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 100 place count 108 transition count 261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 100 place count 108 transition count 260
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 102 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 103 place count 106 transition count 258
Iterating global reduction 6 with 1 rules applied. Total rules applied 104 place count 106 transition count 258
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 150 place count 83 transition count 235
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 156 place count 83 transition count 229
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 159 place count 80 transition count 221
Iterating global reduction 7 with 3 rules applied. Total rules applied 162 place count 80 transition count 221
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -127
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 198 place count 62 transition count 348
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 204 place count 62 transition count 342
Drop transitions (Redundant composition of simpler transitions.) removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 8 with 49 rules applied. Total rules applied 253 place count 62 transition count 293
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 257 place count 60 transition count 319
Free-agglomeration rule applied 15 times with reduction of 6 identical transitions.
Iterating global reduction 8 with 15 rules applied. Total rules applied 272 place count 60 transition count 298
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 32 rules applied. Total rules applied 304 place count 45 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 9 with 15 rules applied. Total rules applied 319 place count 45 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 320 place count 44 transition count 265
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 20 edges and 42 vertex of which 4 / 42 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 9 with 3 rules applied. Total rules applied 323 place count 40 transition count 265
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 10 with 26 rules applied. Total rules applied 349 place count 40 transition count 239
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 350 place count 39 transition count 233
Iterating global reduction 11 with 1 rules applied. Total rules applied 351 place count 39 transition count 233
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 11 with 41 rules applied. Total rules applied 392 place count 39 transition count 192
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 393 place count 38 transition count 191
Iterating global reduction 11 with 1 rules applied. Total rules applied 394 place count 38 transition count 191
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 395 place count 37 transition count 186
Iterating global reduction 11 with 1 rules applied. Total rules applied 396 place count 37 transition count 186
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 11 with 4 rules applied. Total rules applied 400 place count 35 transition count 184
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 405 place count 35 transition count 179
Applied a total of 405 rules in 167 ms. Remains 35 /166 variables (removed 131) and now considering 179/331 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 35/166 places, 179/331 transitions.
RANDOM walk for 681 steps (67 resets) in 51 ms. (13 steps per ms) remains 0/2 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' '!((G(p0)||X(X(F(!p0)))))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 156 transition count 316
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 156 transition count 316
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 25 place count 156 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 155 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 155 transition count 310
Applied a total of 27 rules in 21 ms. Remains 155 /166 variables (removed 11) and now considering 310/331 (removed 21) transitions.
// Phase 1: matrix 310 rows 155 cols
[2024-06-02 21:56:23] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:56:23] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 21:56:23] [INFO ] Invariant cache hit.
[2024-06-02 21:56:23] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2024-06-02 21:56:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 21:56:26] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 3 ms to minimize.
[2024-06-02 21:56:26] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 3 ms to minimize.
[2024-06-02 21:56:26] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:56:27] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 2 ms to minimize.
[2024-06-02 21:56:27] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 3 ms to minimize.
[2024-06-02 21:56:27] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 3 ms to minimize.
[2024-06-02 21:56:27] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 3 ms to minimize.
[2024-06-02 21:56:27] [INFO ] Deduced a trap composed of 89 places in 157 ms of which 2 ms to minimize.
[2024-06-02 21:56:27] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 3 ms to minimize.
[2024-06-02 21:56:28] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 2 ms to minimize.
[2024-06-02 21:56:28] [INFO ] Deduced a trap composed of 89 places in 144 ms of which 3 ms to minimize.
[2024-06-02 21:56:28] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 4 ms to minimize.
[2024-06-02 21:56:29] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
[2024-06-02 21:56:29] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-06-02 21:56:29] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 3 ms to minimize.
[2024-06-02 21:56:29] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 21:56:31] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 5 ms to minimize.
[2024-06-02 21:56:31] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 3 ms to minimize.
[2024-06-02 21:56:31] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 3 ms to minimize.
[2024-06-02 21:56:32] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 2 ms to minimize.
[2024-06-02 21:56:32] [INFO ] Deduced a trap composed of 114 places in 154 ms of which 3 ms to minimize.
[2024-06-02 21:56:32] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 21:56:36] [INFO ] Deduced a trap composed of 102 places in 136 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 21:56:39] [INFO ] Deduced a trap composed of 108 places in 156 ms of which 3 ms to minimize.
[2024-06-02 21:56:39] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (OVERLAPS) 310/465 variables, 155/187 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 309 unsolved
(s121 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/465 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 465/465 variables, and 187 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 310/465 variables, 155/187 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 309/496 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 21:57:03] [INFO ] Deduced a trap composed of 95 places in 159 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/465 variables, and 497 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 26/26 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Starting structural reductions in LTL mode, iteration 1 : 155/166 places, 310/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60460 ms. Remains : 155/166 places, 310/331 transitions.
Stuttering acceptance computed with spot in 447 ms :[p0, false, p0, false]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 483 ms.
Product exploration explored 100000 steps with 50000 reset in 292 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 23 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-16-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-16-LTLCardinality-02 finished in 61817 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 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Graph (trivial) has 172 edges and 166 vertex of which 13 / 166 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 155 transition count 290
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 125 transition count 288
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 67 place count 124 transition count 285
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 72 place count 121 transition count 283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 120 transition count 283
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 73 place count 120 transition count 274
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 91 place count 111 transition count 274
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 99 place count 103 transition count 259
Iterating global reduction 5 with 8 rules applied. Total rules applied 107 place count 103 transition count 259
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 6 rules applied. Total rules applied 113 place count 103 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 114 place count 102 transition count 253
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 114 place count 102 transition count 252
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 116 place count 101 transition count 252
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 118 place count 99 transition count 246
Iterating global reduction 7 with 2 rules applied. Total rules applied 120 place count 99 transition count 246
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 162 place count 78 transition count 225
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 167 place count 78 transition count 220
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 170 place count 75 transition count 213
Iterating global reduction 8 with 3 rules applied. Total rules applied 173 place count 75 transition count 213
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -125
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 38 rules applied. Total rules applied 211 place count 56 transition count 338
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 225 place count 56 transition count 324
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 9 with 28 rules applied. Total rules applied 253 place count 56 transition count 296
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 257 place count 54 transition count 322
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 258 place count 53 transition count 321
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 49 edges and 51 vertex of which 16 / 51 are part of one of the 7 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 9 with 3 rules applied. Total rules applied 261 place count 42 transition count 321
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 10 with 37 rules applied. Total rules applied 298 place count 42 transition count 284
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 300 place count 40 transition count 260
Iterating global reduction 11 with 2 rules applied. Total rules applied 302 place count 40 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 74 transitions
Redundant transition composition rules discarded 74 transitions
Iterating global reduction 11 with 74 rules applied. Total rules applied 376 place count 40 transition count 186
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 378 place count 38 transition count 176
Iterating global reduction 11 with 2 rules applied. Total rules applied 380 place count 38 transition count 176
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 11 with 4 rules applied. Total rules applied 384 place count 36 transition count 174
Applied a total of 384 rules in 131 ms. Remains 36 /166 variables (removed 130) and now considering 174/331 (removed 157) transitions.
[2024-06-02 21:57:25] [INFO ] Flow matrix only has 154 transitions (discarded 20 similar events)
// Phase 1: matrix 154 rows 36 cols
[2024-06-02 21:57:25] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 21:57:25] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 21:57:25] [INFO ] Flow matrix only has 154 transitions (discarded 20 similar events)
[2024-06-02 21:57:25] [INFO ] Invariant cache hit.
[2024-06-02 21:57:25] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 21:57:25] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2024-06-02 21:57:25] [INFO ] Redundant transitions in 52 ms returned [95, 123, 169, 173]
Found 4 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions.
Running 166 sub problems to find dead transitions.
[2024-06-02 21:57:25] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
// Phase 1: matrix 150 rows 36 cols
[2024-06-02 21:57:25] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:57:25] [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, 166 unsolved
[2024-06-02 21:57:26] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-06-02 21:57:26] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-06-02 21:57:26] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-06-02 21:57:26] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 149/185 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 36/81 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-02 21:57:28] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 0/185 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/186 variables, and 82 constraints, problems are : Problem set: 0 solved, 166 unsolved in 5754 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 149/185 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 36/82 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 166/248 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-02 21:57:37] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2024-06-02 21:57:37] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-06-02 21:57:37] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/185 variables, 3/251 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (OVERLAPS) 0/185 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/186 variables, and 251 constraints, problems are : Problem set: 0 solved, 166 unsolved in 12651 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 8/8 constraints]
After SMT, in 18629ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 18632ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/166 places, 170/331 transitions.
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 2 place count 35 transition count 169
Applied a total of 2 rules in 9 ms. Remains 35 /36 variables (removed 1) and now considering 169/170 (removed 1) transitions.
[2024-06-02 21:57:44] [INFO ] Flow matrix only has 149 transitions (discarded 20 similar events)
// Phase 1: matrix 149 rows 35 cols
[2024-06-02 21:57:44] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 21:57:44] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 21:57:44] [INFO ] Flow matrix only has 149 transitions (discarded 20 similar events)
[2024-06-02 21:57:44] [INFO ] Invariant cache hit.
[2024-06-02 21:57:44] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 21:57:44] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/166 places, 169/331 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19279 ms. Remains : 35/166 places, 169/331 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-03 finished in 19354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(p0)))))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 156 transition count 316
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 156 transition count 316
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 25 place count 156 transition count 311
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 154 transition count 309
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 154 transition count 309
Applied a total of 29 rules in 9 ms. Remains 154 /166 variables (removed 12) and now considering 309/331 (removed 22) transitions.
// Phase 1: matrix 309 rows 154 cols
[2024-06-02 21:57:44] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:57:44] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-02 21:57:44] [INFO ] Invariant cache hit.
[2024-06-02 21:57:44] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2024-06-02 21:57:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 21:57:48] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 3 ms to minimize.
[2024-06-02 21:57:48] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 2 ms to minimize.
[2024-06-02 21:57:48] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 6 ms to minimize.
[2024-06-02 21:57:49] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 2 ms to minimize.
[2024-06-02 21:57:49] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 3 ms to minimize.
[2024-06-02 21:57:49] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 2 ms to minimize.
[2024-06-02 21:57:49] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 3 ms to minimize.
[2024-06-02 21:57:49] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 2 ms to minimize.
[2024-06-02 21:57:49] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 2 ms to minimize.
[2024-06-02 21:57:50] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 3 ms to minimize.
[2024-06-02 21:57:50] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 3 ms to minimize.
[2024-06-02 21:57:50] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 3 ms to minimize.
[2024-06-02 21:57:50] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 3 ms to minimize.
[2024-06-02 21:57:51] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 3 ms to minimize.
[2024-06-02 21:57:51] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 3 ms to minimize.
[2024-06-02 21:57:51] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 3 ms to minimize.
[2024-06-02 21:57:51] [INFO ] Deduced a trap composed of 101 places in 165 ms of which 3 ms to minimize.
[2024-06-02 21:57:52] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 3 ms to minimize.
[2024-06-02 21:57:52] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 3 ms to minimize.
[2024-06-02 21:57:52] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 21:57:53] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 3 ms to minimize.
[2024-06-02 21:57:53] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 3 ms to minimize.
[2024-06-02 21:57:54] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 3 ms to minimize.
[2024-06-02 21:57:54] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 3 ms to minimize.
[2024-06-02 21:57:54] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 21:57:57] [INFO ] Deduced a trap composed of 88 places in 132 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (OVERLAPS) 309/463 variables, 154/187 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 21:58:05] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 3 ms to minimize.
[2024-06-02 21:58:07] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 2 ms to minimize.
[2024-06-02 21:58:07] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 3 ms to minimize.
[2024-06-02 21:58:07] [INFO ] Deduced a trap composed of 106 places in 144 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 308 unsolved
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 463/463 variables, and 191 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 309/463 variables, 154/191 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 308/499 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 499 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 30/30 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Starting structural reductions in LTL mode, iteration 1 : 154/166 places, 309/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60482 ms. Remains : 154/166 places, 309/331 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-04 finished in 60693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 156 transition count 317
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 156 transition count 317
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 25 place count 156 transition count 312
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 154 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 154 transition count 310
Applied a total of 29 rules in 7 ms. Remains 154 /166 variables (removed 12) and now considering 310/331 (removed 21) transitions.
// Phase 1: matrix 310 rows 154 cols
[2024-06-02 21:58:45] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:58:45] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 21:58:45] [INFO ] Invariant cache hit.
[2024-06-02 21:58:45] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2024-06-02 21:58:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 21:58:49] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 2 ms to minimize.
[2024-06-02 21:58:49] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 2 ms to minimize.
[2024-06-02 21:58:49] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 3 ms to minimize.
[2024-06-02 21:58:50] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-06-02 21:58:50] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 3 ms to minimize.
[2024-06-02 21:58:50] [INFO ] Deduced a trap composed of 87 places in 148 ms of which 2 ms to minimize.
[2024-06-02 21:58:50] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 3 ms to minimize.
[2024-06-02 21:58:50] [INFO ] Deduced a trap composed of 87 places in 145 ms of which 3 ms to minimize.
[2024-06-02 21:58:50] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 3 ms to minimize.
[2024-06-02 21:58:51] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 2 ms to minimize.
[2024-06-02 21:58:51] [INFO ] Deduced a trap composed of 100 places in 136 ms of which 3 ms to minimize.
[2024-06-02 21:58:52] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 2 ms to minimize.
[2024-06-02 21:58:52] [INFO ] Deduced a trap composed of 100 places in 167 ms of which 3 ms to minimize.
[2024-06-02 21:58:52] [INFO ] Deduced a trap composed of 106 places in 162 ms of which 3 ms to minimize.
[2024-06-02 21:58:52] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 3 ms to minimize.
[2024-06-02 21:58:52] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 2 ms to minimize.
[2024-06-02 21:58:53] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 3 ms to minimize.
[2024-06-02 21:58:53] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 2 ms to minimize.
[2024-06-02 21:58:53] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 21:58:55] [INFO ] Deduced a trap composed of 94 places in 158 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 21:58:59] [INFO ] Deduced a trap composed of 107 places in 165 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 21:59:01] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (OVERLAPS) 310/464 variables, 154/183 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/464 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 183 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 310/464 variables, 154/183 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 309/492 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 21:59:25] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 493 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 23/23 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60190ms
Starting structural reductions in LTL mode, iteration 1 : 154/166 places, 310/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60637 ms. Remains : 154/166 places, 310/331 transitions.
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-16-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-06 finished in 60852 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' '!(((p0 U p1)&&F((G(F(p3))||p2))))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Graph (trivial) has 172 edges and 166 vertex of which 13 / 166 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 155 transition count 289
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 124 transition count 287
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 123 transition count 287
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 66 place count 123 transition count 278
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 84 place count 114 transition count 278
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 92 place count 106 transition count 263
Iterating global reduction 3 with 8 rules applied. Total rules applied 100 place count 106 transition count 263
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 106 place count 106 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 107 place count 105 transition count 257
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 107 place count 105 transition count 256
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 109 place count 104 transition count 256
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 111 place count 102 transition count 250
Iterating global reduction 5 with 2 rules applied. Total rules applied 113 place count 102 transition count 250
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 151 place count 83 transition count 231
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 156 place count 83 transition count 226
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 159 place count 80 transition count 219
Iterating global reduction 6 with 3 rules applied. Total rules applied 162 place count 80 transition count 219
Performed 18 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 198 place count 62 transition count 329
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 211 place count 62 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 7 with 28 rules applied. Total rules applied 239 place count 62 transition count 288
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
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 243 place count 60 transition count 314
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 244 place count 59 transition count 313
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 57 edges and 57 vertex of which 19 / 57 are part of one of the 8 SCC in 0 ms
Free SCC test removed 11 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 247 place count 46 transition count 313
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 8 with 43 rules applied. Total rules applied 290 place count 46 transition count 270
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 292 place count 44 transition count 247
Iterating global reduction 9 with 2 rules applied. Total rules applied 294 place count 44 transition count 247
Drop transitions (Redundant composition of simpler transitions.) removed 78 transitions
Redundant transition composition rules discarded 78 transitions
Iterating global reduction 9 with 78 rules applied. Total rules applied 372 place count 44 transition count 169
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 372 place count 44 transition count 168
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 374 place count 43 transition count 168
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 376 place count 41 transition count 160
Iterating global reduction 9 with 2 rules applied. Total rules applied 378 place count 41 transition count 160
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 9 with 4 rules applied. Total rules applied 382 place count 39 transition count 158
Applied a total of 382 rules in 67 ms. Remains 39 /166 variables (removed 127) and now considering 158/331 (removed 173) transitions.
[2024-06-02 21:59:46] [INFO ] Flow matrix only has 146 transitions (discarded 12 similar events)
// Phase 1: matrix 146 rows 39 cols
[2024-06-02 21:59:46] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:59:46] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 21:59:46] [INFO ] Flow matrix only has 146 transitions (discarded 12 similar events)
[2024-06-02 21:59:46] [INFO ] Invariant cache hit.
[2024-06-02 21:59:46] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-02 21:59:46] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-06-02 21:59:46] [INFO ] Redundant transitions in 44 ms returned [114, 115, 157]
Found 3 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
Running 153 sub problems to find dead transitions.
[2024-06-02 21:59:46] [INFO ] Flow matrix only has 143 transitions (discarded 12 similar events)
// Phase 1: matrix 143 rows 39 cols
[2024-06-02 21:59:46] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:59:46] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-02 21:59:47] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 2 ms to minimize.
[2024-06-02 21:59:47] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-06-02 21:59:47] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:59:47] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:59:47] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:59:47] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-06-02 21:59:48] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-02 21:59:48] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 142/181 variables, 39/52 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 30/82 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (OVERLAPS) 0/181 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/182 variables, and 82 constraints, problems are : Problem set: 0 solved, 153 unsolved in 6755 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 142/181 variables, 39/52 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 30/82 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 153/235 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-02 21:59:56] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-02 21:59:58] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-02 21:59:59] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (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 13399 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 11/11 constraints]
After SMT, in 20345ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 20348ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/166 places, 155/331 transitions.
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 2 place count 38 transition count 154
Applied a total of 2 rules in 4 ms. Remains 38 /39 variables (removed 1) and now considering 154/155 (removed 1) transitions.
[2024-06-02 22:00:06] [INFO ] Flow matrix only has 142 transitions (discarded 12 similar events)
// Phase 1: matrix 142 rows 38 cols
[2024-06-02 22:00:06] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:00:06] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 22:00:06] [INFO ] Flow matrix only has 142 transitions (discarded 12 similar events)
[2024-06-02 22:00:06] [INFO ] Invariant cache hit.
[2024-06-02 22:00:06] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-02 22:00:06] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/166 places, 154/331 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20903 ms. Remains : 38/166 places, 154/331 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-07 finished in 21124 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(X(X(p0)))&&((!p1&&F(!p2)) U (G((!p1&&F(!p2)))||(!p1&&G(!p2))))))))'
Support contains 6 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 159 transition count 321
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 159 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 158 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 158 transition count 320
Applied a total of 16 rules in 7 ms. Remains 158 /166 variables (removed 8) and now considering 320/331 (removed 11) transitions.
// Phase 1: matrix 320 rows 158 cols
[2024-06-02 22:00:07] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:00:07] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-02 22:00:07] [INFO ] Invariant cache hit.
[2024-06-02 22:00:07] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Running 319 sub problems to find dead transitions.
[2024-06-02 22:00:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-02 22:00:11] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 3 ms to minimize.
[2024-06-02 22:00:12] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-06-02 22:00:12] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 2 ms to minimize.
[2024-06-02 22:00:12] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 3 ms to minimize.
[2024-06-02 22:00:12] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 3 ms to minimize.
[2024-06-02 22:00:12] [INFO ] Deduced a trap composed of 95 places in 140 ms of which 5 ms to minimize.
[2024-06-02 22:00:12] [INFO ] Deduced a trap composed of 104 places in 139 ms of which 3 ms to minimize.
[2024-06-02 22:00:13] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 3 ms to minimize.
[2024-06-02 22:00:13] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 3 ms to minimize.
[2024-06-02 22:00:13] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 2 ms to minimize.
[2024-06-02 22:00:14] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 3 ms to minimize.
[2024-06-02 22:00:14] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 2 ms to minimize.
[2024-06-02 22:00:14] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 3 ms to minimize.
[2024-06-02 22:00:14] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-06-02 22:00:15] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 2 ms to minimize.
[2024-06-02 22:00:15] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 2 ms to minimize.
[2024-06-02 22:00:15] [INFO ] Deduced a trap composed of 96 places in 150 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-02 22:00:16] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 3 ms to minimize.
[2024-06-02 22:00:17] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 3 ms to minimize.
[2024-06-02 22:00:17] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 3 ms to minimize.
[2024-06-02 22:00:17] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 2 ms to minimize.
[2024-06-02 22:00:18] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 3 ms to minimize.
[2024-06-02 22:00:18] [INFO ] Deduced a trap composed of 118 places in 163 ms of which 3 ms to minimize.
[2024-06-02 22:00:18] [INFO ] Deduced a trap composed of 113 places in 181 ms of which 3 ms to minimize.
[2024-06-02 22:00:18] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 2 ms to minimize.
[2024-06-02 22:00:19] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 3 ms to minimize.
[2024-06-02 22:00:19] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-02 22:00:23] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 3 ms to minimize.
[2024-06-02 22:00:23] [INFO ] Deduced a trap composed of 110 places in 146 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-02 22:00:25] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 3 ms to minimize.
[2024-06-02 22:00:25] [INFO ] Deduced a trap composed of 121 places in 165 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (OVERLAPS) 320/478 variables, 158/196 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-02 22:00:32] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-02 22:00:37] [INFO ] Deduced a trap composed of 110 places in 109 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/478 variables, and 198 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-02 22:00:41] [INFO ] Deduced a trap composed of 104 places in 159 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (OVERLAPS) 320/478 variables, 158/199 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 319/518 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-02 22:00:48] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 2 ms to minimize.
[2024-06-02 22:00:50] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/478 variables, and 520 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 36/36 constraints]
After SMT, in 60182ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 60187ms
Starting structural reductions in LTL mode, iteration 1 : 158/166 places, 320/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60636 ms. Remains : 158/166 places, 320/331 transitions.
Stuttering acceptance computed with spot in 1685 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1 p2), (NOT p0), p2, p2, p1, (NOT p0), (AND (NOT p0) p2), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p0), p2, (NOT p0), (AND (NOT p0) p2), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p0), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND (NOT p0) p2), (NOT p0), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 186 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 0 ms.
FORMULA MedleyA-PT-16-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-12 finished in 62569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Graph (trivial) has 176 edges and 166 vertex of which 13 / 166 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 155 transition count 286
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 38 rules applied. Total rules applied 73 place count 121 transition count 282
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 119 transition count 282
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 75 place count 119 transition count 274
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 91 place count 111 transition count 274
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 100 place count 102 transition count 257
Iterating global reduction 3 with 9 rules applied. Total rules applied 109 place count 102 transition count 257
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 115 place count 102 transition count 251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 116 place count 101 transition count 251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 116 place count 101 transition count 250
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 118 place count 100 transition count 250
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 119 place count 99 transition count 248
Iterating global reduction 5 with 1 rules applied. Total rules applied 120 place count 99 transition count 248
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 160 place count 79 transition count 228
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 166 place count 79 transition count 222
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 169 place count 76 transition count 214
Iterating global reduction 6 with 3 rules applied. Total rules applied 172 place count 76 transition count 214
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -115
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 206 place count 59 transition count 329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 207 place count 59 transition count 328
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 7 with 30 rules applied. Total rules applied 237 place count 59 transition count 298
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 241 place count 57 transition count 324
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 242 place count 56 transition count 323
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 55 edges and 54 vertex of which 19 / 54 are part of one of the 8 SCC in 0 ms
Free SCC test removed 11 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 245 place count 43 transition count 323
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 8 with 43 rules applied. Total rules applied 288 place count 43 transition count 280
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 290 place count 41 transition count 258
Iterating global reduction 9 with 2 rules applied. Total rules applied 292 place count 41 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 9 with 75 rules applied. Total rules applied 367 place count 41 transition count 183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 367 place count 41 transition count 182
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 369 place count 40 transition count 182
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 371 place count 38 transition count 174
Iterating global reduction 9 with 2 rules applied. Total rules applied 373 place count 38 transition count 174
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 9 with 4 rules applied. Total rules applied 377 place count 36 transition count 172
Applied a total of 377 rules in 56 ms. Remains 36 /166 variables (removed 130) and now considering 172/331 (removed 159) transitions.
[2024-06-02 22:01:09] [INFO ] Flow matrix only has 152 transitions (discarded 20 similar events)
// Phase 1: matrix 152 rows 36 cols
[2024-06-02 22:01:09] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 22:01:09] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 22:01:09] [INFO ] Flow matrix only has 152 transitions (discarded 20 similar events)
[2024-06-02 22:01:09] [INFO ] Invariant cache hit.
[2024-06-02 22:01:09] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 22:01:10] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2024-06-02 22:01:10] [INFO ] Redundant transitions in 61 ms returned [129, 171]
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 168 sub problems to find dead transitions.
[2024-06-02 22:01:10] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
// Phase 1: matrix 150 rows 36 cols
[2024-06-02 22:01:10] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 22:01:10] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/36 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-02 22:01:11] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:01:11] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
[2024-06-02 22:01:11] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-06-02 22:01:11] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-06-02 22:01:11] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-06-02 22:01:11] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2024-06-02 22:01:11] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
[2024-06-02 22:01:11] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 149/185 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 56/105 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 0/185 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/186 variables, and 105 constraints, problems are : Problem set: 0 solved, 168 unsolved in 6437 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 1/36 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 149/185 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 56/105 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 168/273 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (OVERLAPS) 0/185 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/186 variables, and 273 constraints, problems are : Problem set: 0 solved, 168 unsolved in 8222 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 8/8 constraints]
After SMT, in 14845ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 14848ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/166 places, 170/331 transitions.
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 2 place count 35 transition count 169
Applied a total of 2 rules in 4 ms. Remains 35 /36 variables (removed 1) and now considering 169/170 (removed 1) transitions.
[2024-06-02 22:01:25] [INFO ] Flow matrix only has 149 transitions (discarded 20 similar events)
// Phase 1: matrix 149 rows 35 cols
[2024-06-02 22:01:25] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:01:25] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-02 22:01:25] [INFO ] Flow matrix only has 149 transitions (discarded 20 similar events)
[2024-06-02 22:01:25] [INFO ] Invariant cache hit.
[2024-06-02 22:01:25] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 22:01:25] [INFO ] Implicit Places using invariants and state equation in 132 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 : 35/166 places, 169/331 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15431 ms. Remains : 35/166 places, 169/331 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-16-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-14 finished in 15515 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&&(p1||X(p2))))))'
Support contains 5 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 158 transition count 320
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 158 transition count 320
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 21 place count 158 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 157 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 157 transition count 314
Applied a total of 23 rules in 12 ms. Remains 157 /166 variables (removed 9) and now considering 314/331 (removed 17) transitions.
// Phase 1: matrix 314 rows 157 cols
[2024-06-02 22:01:25] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:01:25] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-02 22:01:25] [INFO ] Invariant cache hit.
[2024-06-02 22:01:25] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2024-06-02 22:01:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 22:01:29] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 6 ms to minimize.
[2024-06-02 22:01:29] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 3 ms to minimize.
[2024-06-02 22:01:29] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
[2024-06-02 22:01:29] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 2 ms to minimize.
[2024-06-02 22:01:30] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 3 ms to minimize.
[2024-06-02 22:01:30] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 3 ms to minimize.
[2024-06-02 22:01:30] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 2 ms to minimize.
[2024-06-02 22:01:30] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 3 ms to minimize.
[2024-06-02 22:01:30] [INFO ] Deduced a trap composed of 90 places in 148 ms of which 3 ms to minimize.
[2024-06-02 22:01:31] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 2 ms to minimize.
[2024-06-02 22:01:31] [INFO ] Deduced a trap composed of 89 places in 148 ms of which 3 ms to minimize.
[2024-06-02 22:01:31] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 3 ms to minimize.
[2024-06-02 22:01:32] [INFO ] Deduced a trap composed of 103 places in 123 ms of which 2 ms to minimize.
[2024-06-02 22:01:32] [INFO ] Deduced a trap composed of 103 places in 126 ms of which 2 ms to minimize.
[2024-06-02 22:01:32] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 3 ms to minimize.
[2024-06-02 22:01:32] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 2 ms to minimize.
[2024-06-02 22:01:32] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 3 ms to minimize.
[2024-06-02 22:01:33] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 3 ms to minimize.
[2024-06-02 22:01:33] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 3 ms to minimize.
[2024-06-02 22:01:33] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 22:01:34] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 3 ms to minimize.
[2024-06-02 22:01:35] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 3 ms to minimize.
[2024-06-02 22:01:35] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 22:01:38] [INFO ] Deduced a trap composed of 95 places in 169 ms of which 2 ms to minimize.
[2024-06-02 22:01:38] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 3 ms to minimize.
[2024-06-02 22:01:39] [INFO ] Deduced a trap composed of 101 places in 156 ms of which 2 ms to minimize.
[2024-06-02 22:01:39] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 22:01:42] [INFO ] Deduced a trap composed of 109 places in 159 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 314/471 variables, 157/192 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 22:01:49] [INFO ] Deduced a trap composed of 109 places in 156 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 471/471 variables, and 193 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 22:01:59] [INFO ] Deduced a trap composed of 120 places in 151 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/471 variables, 157/194 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 313/507 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 0/471 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Int declared 471/471 variables, and 507 constraints, problems are : Problem set: 0 solved, 313 unsolved in 29562 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 30/30 constraints]
After SMT, in 59673ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 59677ms
Starting structural reductions in LTL mode, iteration 1 : 157/166 places, 314/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60076 ms. Remains : 157/166 places, 314/331 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 166 ms.
Product exploration explored 100000 steps with 0 reset in 378 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0))), (X p0), (X (AND (NOT p1) p0 p2)), (X (NOT p1)), (X (NOT (AND p1 p0 p2))), (X (X p2)), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 158 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (8 resets) in 832 ms. (48 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 221 ms. (180 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 438 ms. (91 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 412 ms. (96 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 261 ms. (152 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 595 ms. (67 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 300 ms. (132 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 269 ms. (148 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 195 ms. (204 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 46982 steps, run visited all 8 properties in 472 ms. (steps per millisecond=99 )
Probabilistic random walk after 46982 steps, saw 9914 distinct states, run finished after 478 ms. (steps per millisecond=98 ) properties seen :8
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0))), (X p0), (X (AND (NOT p1) p0 p2)), (X (NOT p1)), (X (NOT (AND p1 p0 p2))), (X (X p2)), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0 p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND p0 (OR p2 (NOT p1))))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT p2)), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 19 factoid took 710 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 5 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 314/314 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-06-02 22:02:29] [INFO ] Invariant cache hit.
[2024-06-02 22:02:29] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-06-02 22:02:29] [INFO ] Invariant cache hit.
[2024-06-02 22:02:29] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2024-06-02 22:02:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 22:02:33] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 3 ms to minimize.
[2024-06-02 22:02:33] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 3 ms to minimize.
[2024-06-02 22:02:34] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2024-06-02 22:02:34] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 2 ms to minimize.
[2024-06-02 22:02:34] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 3 ms to minimize.
[2024-06-02 22:02:34] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 3 ms to minimize.
[2024-06-02 22:02:34] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 3 ms to minimize.
[2024-06-02 22:02:34] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 3 ms to minimize.
[2024-06-02 22:02:35] [INFO ] Deduced a trap composed of 90 places in 149 ms of which 4 ms to minimize.
[2024-06-02 22:02:35] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 3 ms to minimize.
[2024-06-02 22:02:35] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 3 ms to minimize.
[2024-06-02 22:02:35] [INFO ] Deduced a trap composed of 89 places in 139 ms of which 3 ms to minimize.
[2024-06-02 22:02:36] [INFO ] Deduced a trap composed of 103 places in 143 ms of which 3 ms to minimize.
[2024-06-02 22:02:36] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 3 ms to minimize.
[2024-06-02 22:02:36] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 3 ms to minimize.
[2024-06-02 22:02:37] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 2 ms to minimize.
[2024-06-02 22:02:37] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 3 ms to minimize.
[2024-06-02 22:02:37] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 3 ms to minimize.
[2024-06-02 22:02:37] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 3 ms to minimize.
[2024-06-02 22:02:37] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 22:02:38] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 3 ms to minimize.
[2024-06-02 22:02:39] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 2 ms to minimize.
[2024-06-02 22:02:39] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 22:02:42] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 2 ms to minimize.
[2024-06-02 22:02:42] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-06-02 22:02:42] [INFO ] Deduced a trap composed of 101 places in 94 ms of which 1 ms to minimize.
[2024-06-02 22:02:43] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 22:02:45] [INFO ] Deduced a trap composed of 109 places in 152 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 314/471 variables, 157/192 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 22:02:52] [INFO ] Deduced a trap composed of 109 places in 164 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 471/471 variables, and 193 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 22:03:03] [INFO ] Deduced a trap composed of 120 places in 150 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/471 variables, 157/194 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 313/507 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 0/471 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Int declared 471/471 variables, and 507 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30005 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 30/30 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 60166ms
Finished structural reductions in LTL mode , in 1 iterations and 60721 ms. Remains : 157/157 places, 314/314 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND p0 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 158 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (8 resets) in 295 ms. (135 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 300 ms. (132 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 227 ms. (175 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 293 ms. (136 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 179 ms. (222 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 180 ms. (221 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 425 ms. (93 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 269 ms. (148 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 46982 steps, run visited all 8 properties in 354 ms. (steps per millisecond=132 )
Probabilistic random walk after 46982 steps, saw 9914 distinct states, run finished after 355 ms. (steps per millisecond=132 ) properties seen :8
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND p0 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND p0 (OR p2 (NOT p1))))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT p2)), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 19 factoid took 618 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 0 reset in 319 ms.
Product exploration explored 100000 steps with 0 reset in 351 ms.
Support contains 5 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-06-02 22:03:33] [INFO ] Invariant cache hit.
[2024-06-02 22:03:33] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-02 22:03:33] [INFO ] Invariant cache hit.
[2024-06-02 22:03:34] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2024-06-02 22:03:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 22:03:37] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-06-02 22:03:38] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 2 ms to minimize.
[2024-06-02 22:03:38] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-06-02 22:03:38] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2024-06-02 22:03:38] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-06-02 22:03:38] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-06-02 22:03:38] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 2 ms to minimize.
[2024-06-02 22:03:38] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 5 ms to minimize.
[2024-06-02 22:03:38] [INFO ] Deduced a trap composed of 90 places in 165 ms of which 3 ms to minimize.
[2024-06-02 22:03:39] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 2 ms to minimize.
[2024-06-02 22:03:39] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 3 ms to minimize.
[2024-06-02 22:03:39] [INFO ] Deduced a trap composed of 89 places in 148 ms of which 2 ms to minimize.
[2024-06-02 22:03:40] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 3 ms to minimize.
[2024-06-02 22:03:40] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 3 ms to minimize.
[2024-06-02 22:03:40] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 5 ms to minimize.
[2024-06-02 22:03:40] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 3 ms to minimize.
[2024-06-02 22:03:40] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 2 ms to minimize.
[2024-06-02 22:03:41] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-06-02 22:03:41] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-06-02 22:03:41] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 22:03:42] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 3 ms to minimize.
[2024-06-02 22:03:42] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 2 ms to minimize.
[2024-06-02 22:03:42] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 22:03:44] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 2 ms to minimize.
[2024-06-02 22:03:45] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-06-02 22:03:45] [INFO ] Deduced a trap composed of 101 places in 92 ms of which 1 ms to minimize.
[2024-06-02 22:03:45] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 22:03:47] [INFO ] Deduced a trap composed of 109 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 314/471 variables, 157/192 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 22:03:51] [INFO ] Deduced a trap composed of 109 places in 81 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 10 (OVERLAPS) 0/471 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 193 constraints, problems are : Problem set: 0 solved, 313 unsolved in 26838 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 22:04:04] [INFO ] Deduced a trap composed of 120 places in 144 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/471 variables, 157/194 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 313/507 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 0/471 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Int declared 471/471 variables, and 507 constraints, problems are : Problem set: 0 solved, 313 unsolved in 29965 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 30/30 constraints]
After SMT, in 56927ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 56933ms
Finished structural reductions in LTL mode , in 1 iterations and 57392 ms. Remains : 157/157 places, 314/314 transitions.
Treatment of property MedleyA-PT-16-LTLCardinality-15 finished in 185983 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&&(p1||X(p2))))))'
Found a Lengthening insensitive property : MedleyA-PT-16-LTLCardinality-15
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 5 out of 166 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Graph (trivial) has 167 edges and 166 vertex of which 13 / 166 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 155 transition count 291
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 63 place count 126 transition count 287
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 124 transition count 287
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 65 place count 124 transition count 279
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 81 place count 116 transition count 279
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 88 place count 109 transition count 266
Iterating global reduction 3 with 7 rules applied. Total rules applied 95 place count 109 transition count 266
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 100 place count 109 transition count 261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 100 place count 109 transition count 260
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 102 place count 108 transition count 260
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 148 place count 85 transition count 237
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 153 place count 85 transition count 232
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 157 place count 81 transition count 222
Iterating global reduction 5 with 4 rules applied. Total rules applied 161 place count 81 transition count 222
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 193 place count 65 transition count 317
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 194 place count 64 transition count 316
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 64 edges and 62 vertex of which 18 / 62 are part of one of the 7 SCC in 0 ms
Free SCC test removed 11 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 197 place count 51 transition count 316
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 6 with 41 rules applied. Total rules applied 238 place count 51 transition count 275
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 240 place count 49 transition count 254
Iterating global reduction 7 with 2 rules applied. Total rules applied 242 place count 49 transition count 254
Drop transitions (Redundant composition of simpler transitions.) removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 7 with 44 rules applied. Total rules applied 286 place count 49 transition count 210
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 294 place count 45 transition count 206
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 300 place count 45 transition count 200
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 302 place count 43 transition count 192
Iterating global reduction 8 with 2 rules applied. Total rules applied 304 place count 43 transition count 192
Applied a total of 304 rules in 44 ms. Remains 43 /166 variables (removed 123) and now considering 192/331 (removed 139) transitions.
[2024-06-02 22:04:31] [INFO ] Flow matrix only has 178 transitions (discarded 14 similar events)
// Phase 1: matrix 178 rows 43 cols
[2024-06-02 22:04:31] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:04:31] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 22:04:31] [INFO ] Flow matrix only has 178 transitions (discarded 14 similar events)
[2024-06-02 22:04:31] [INFO ] Invariant cache hit.
[2024-06-02 22:04:31] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-06-02 22:04:31] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-06-02 22:04:31] [INFO ] Flow matrix only has 178 transitions (discarded 14 similar events)
[2024-06-02 22:04:31] [INFO ] Invariant cache hit.
[2024-06-02 22:04:31] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-02 22:04:32] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2024-06-02 22:04:32] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-06-02 22:04:32] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2024-06-02 22:04:32] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:04:32] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-06-02 22:04:33] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 177/220 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 34/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 0/220 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/221 variables, and 88 constraints, problems are : Problem set: 0 solved, 185 unsolved in 7077 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 177/220 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 34/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 185/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/221 variables, and 273 constraints, problems are : Problem set: 0 solved, 185 unsolved in 7615 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 6/6 constraints]
After SMT, in 14852ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 14854ms
Starting structural reductions in LI_LTL mode, iteration 1 : 43/166 places, 192/331 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 15128 ms. Remains : 43/166 places, 192/331 transitions.
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 154 ms.
Product exploration explored 100000 steps with 0 reset in 270 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0))), (X p0), (X (AND (NOT p1) p0 p2)), (X (NOT p1)), (X (NOT (AND p1 p0 p2))), (X (X p2)), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 236 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 2069 steps (324 resets) in 42 ms. (48 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0))), (X p0), (X (AND (NOT p1) p0 p2)), (X (NOT p1)), (X (NOT (AND p1 p0 p2))), (X (X p2)), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0 p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND p0 (OR p2 (NOT p1))))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT p2)), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 19 factoid took 727 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 192/192 transitions.
Applied a total of 0 rules in 0 ms. Remains 43 /43 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-06-02 22:04:48] [INFO ] Flow matrix only has 178 transitions (discarded 14 similar events)
[2024-06-02 22:04:48] [INFO ] Invariant cache hit.
[2024-06-02 22:04:48] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 22:04:48] [INFO ] Flow matrix only has 178 transitions (discarded 14 similar events)
[2024-06-02 22:04:48] [INFO ] Invariant cache hit.
[2024-06-02 22:04:48] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-06-02 22:04:48] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-06-02 22:04:48] [INFO ] Flow matrix only has 178 transitions (discarded 14 similar events)
[2024-06-02 22:04:48] [INFO ] Invariant cache hit.
[2024-06-02 22:04:48] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-02 22:04:49] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:04:49] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-06-02 22:04:49] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-06-02 22:04:49] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 5 ms to minimize.
[2024-06-02 22:04:50] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-06-02 22:04:50] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 177/220 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 34/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 0/220 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/221 variables, and 88 constraints, problems are : Problem set: 0 solved, 185 unsolved in 7256 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 177/220 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 34/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 185/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/221 variables, and 273 constraints, problems are : Problem set: 0 solved, 185 unsolved in 8702 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 6/6 constraints]
After SMT, in 16227ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 16230ms
Finished structural reductions in LTL mode , in 1 iterations and 16503 ms. Remains : 43/43 places, 192/192 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND p0 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 160 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 3836 steps (614 resets) in 45 ms. (83 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND p0 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND p0 (OR p2 (NOT p1))))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT p2)), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 19 factoid took 576 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 0 reset in 197 ms.
Product exploration explored 100000 steps with 0 reset in 214 ms.
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 192/192 transitions.
Applied a total of 0 rules in 0 ms. Remains 43 /43 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-06-02 22:05:06] [INFO ] Flow matrix only has 178 transitions (discarded 14 similar events)
[2024-06-02 22:05:06] [INFO ] Invariant cache hit.
[2024-06-02 22:05:06] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 22:05:06] [INFO ] Flow matrix only has 178 transitions (discarded 14 similar events)
[2024-06-02 22:05:06] [INFO ] Invariant cache hit.
[2024-06-02 22:05:06] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-06-02 22:05:06] [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.
Running 185 sub problems to find dead transitions.
[2024-06-02 22:05:06] [INFO ] Flow matrix only has 178 transitions (discarded 14 similar events)
[2024-06-02 22:05:06] [INFO ] Invariant cache hit.
[2024-06-02 22:05:06] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-02 22:05:07] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:05:07] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:05:07] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:05:07] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:05:08] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:05:08] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 177/220 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 34/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 0/220 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/221 variables, and 88 constraints, problems are : Problem set: 0 solved, 185 unsolved in 6514 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 177/220 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 34/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 185/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/221 variables, and 273 constraints, problems are : Problem set: 0 solved, 185 unsolved in 7822 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 6/6 constraints]
After SMT, in 14601ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 14604ms
Finished structural reductions in LTL mode , in 1 iterations and 14820 ms. Remains : 43/43 places, 192/192 transitions.
Treatment of property MedleyA-PT-16-LTLCardinality-15 finished in 50226 ms.
[2024-06-02 22:05:21] [INFO ] Flatten gal took : 32 ms
[2024-06-02 22:05:21] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-02 22:05:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 166 places, 331 transitions and 1044 arcs took 8 ms.
Total runtime 612095 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-16

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 166
TRANSITIONS: 331
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.006s, Sys 0.006s]


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


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

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

Process ID: 2160
MODEL NAME: /home/mcc/execution/412/model
166 places, 331 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA MedleyA-PT-16-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717365930606

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is MedleyA-PT-16, 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 r575-smll-171734919600123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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