Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K 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 158K 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-18-LTLCardinality-00
FORMULA_NAME MedleyA-PT-18-LTLCardinality-01
FORMULA_NAME MedleyA-PT-18-LTLCardinality-02
FORMULA_NAME MedleyA-PT-18-LTLCardinality-03
FORMULA_NAME MedleyA-PT-18-LTLCardinality-04
FORMULA_NAME MedleyA-PT-18-LTLCardinality-05
FORMULA_NAME MedleyA-PT-18-LTLCardinality-06
FORMULA_NAME MedleyA-PT-18-LTLCardinality-07
FORMULA_NAME MedleyA-PT-18-LTLCardinality-08
FORMULA_NAME MedleyA-PT-18-LTLCardinality-09
FORMULA_NAME MedleyA-PT-18-LTLCardinality-10
FORMULA_NAME MedleyA-PT-18-LTLCardinality-11
FORMULA_NAME MedleyA-PT-18-LTLCardinality-12
FORMULA_NAME MedleyA-PT-18-LTLCardinality-13
FORMULA_NAME MedleyA-PT-18-LTLCardinality-14
FORMULA_NAME MedleyA-PT-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717360524213

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:35:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 20:35:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:35:27] [INFO ] Load time of PNML (sax parser for PT used): 216 ms
[2024-06-02 20:35:27] [INFO ] Transformed 252 places.
[2024-06-02 20:35:27] [INFO ] Transformed 543 transitions.
[2024-06-02 20:35:27] [INFO ] Found NUPN structural information;
[2024-06-02 20:35:27] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 548 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-18-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 541/541 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 212 transition count 477
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 212 transition count 477
Applied a total of 80 rules in 64 ms. Remains 212 /252 variables (removed 40) and now considering 477/541 (removed 64) transitions.
// Phase 1: matrix 477 rows 212 cols
[2024-06-02 20:35:27] [INFO ] Computed 7 invariants in 47 ms
[2024-06-02 20:35:28] [INFO ] Implicit Places using invariants in 690 ms returned []
[2024-06-02 20:35:28] [INFO ] Invariant cache hit.
[2024-06-02 20:35:29] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 1417 ms to find 0 implicit places.
Running 476 sub problems to find dead transitions.
[2024-06-02 20:35:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 476 unsolved
[2024-06-02 20:35:38] [INFO ] Deduced a trap composed of 15 places in 288 ms of which 38 ms to minimize.
[2024-06-02 20:35:38] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 3 ms to minimize.
[2024-06-02 20:35:38] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 2 ms to minimize.
[2024-06-02 20:35:38] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 2 ms to minimize.
[2024-06-02 20:35:38] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 2 ms to minimize.
[2024-06-02 20:35:38] [INFO ] Deduced a trap composed of 36 places in 181 ms of which 2 ms to minimize.
[2024-06-02 20:35:39] [INFO ] Deduced a trap composed of 142 places in 160 ms of which 2 ms to minimize.
[2024-06-02 20:35:39] [INFO ] Deduced a trap composed of 129 places in 166 ms of which 3 ms to minimize.
[2024-06-02 20:35:39] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 2 ms to minimize.
[2024-06-02 20:35:39] [INFO ] Deduced a trap composed of 130 places in 149 ms of which 2 ms to minimize.
[2024-06-02 20:35:39] [INFO ] Deduced a trap composed of 114 places in 122 ms of which 2 ms to minimize.
[2024-06-02 20:35:40] [INFO ] Deduced a trap composed of 137 places in 153 ms of which 2 ms to minimize.
[2024-06-02 20:35:40] [INFO ] Deduced a trap composed of 142 places in 174 ms of which 3 ms to minimize.
[2024-06-02 20:35:41] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 2 ms to minimize.
[2024-06-02 20:35:41] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 2 ms to minimize.
[2024-06-02 20:35:41] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 2 ms to minimize.
[2024-06-02 20:35:41] [INFO ] Deduced a trap composed of 28 places in 193 ms of which 2 ms to minimize.
[2024-06-02 20:35:42] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 2 ms to minimize.
[2024-06-02 20:35:42] [INFO ] Deduced a trap composed of 44 places in 182 ms of which 4 ms to minimize.
[2024-06-02 20:35:42] [INFO ] Deduced a trap composed of 36 places in 253 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 476 unsolved
[2024-06-02 20:35:43] [INFO ] Deduced a trap composed of 34 places in 279 ms of which 4 ms to minimize.
[2024-06-02 20:35:43] [INFO ] Deduced a trap composed of 129 places in 239 ms of which 3 ms to minimize.
[2024-06-02 20:35:43] [INFO ] Deduced a trap composed of 40 places in 220 ms of which 3 ms to minimize.
[2024-06-02 20:35:43] [INFO ] Deduced a trap composed of 37 places in 280 ms of which 3 ms to minimize.
[2024-06-02 20:35:44] [INFO ] Deduced a trap composed of 20 places in 266 ms of which 4 ms to minimize.
[2024-06-02 20:35:44] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 2 ms to minimize.
[2024-06-02 20:35:44] [INFO ] Deduced a trap composed of 45 places in 214 ms of which 3 ms to minimize.
[2024-06-02 20:35:44] [INFO ] Deduced a trap composed of 33 places in 247 ms of which 2 ms to minimize.
[2024-06-02 20:35:45] [INFO ] Deduced a trap composed of 33 places in 261 ms of which 3 ms to minimize.
[2024-06-02 20:35:45] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 3 ms to minimize.
[2024-06-02 20:35:45] [INFO ] Deduced a trap composed of 39 places in 234 ms of which 3 ms to minimize.
[2024-06-02 20:35:46] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 3 ms to minimize.
[2024-06-02 20:35:47] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 2 ms to minimize.
[2024-06-02 20:35:47] [INFO ] Deduced a trap composed of 29 places in 209 ms of which 3 ms to minimize.
[2024-06-02 20:35:47] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 2 ms to minimize.
[2024-06-02 20:35:47] [INFO ] Deduced a trap composed of 148 places in 134 ms of which 3 ms to minimize.
[2024-06-02 20:35:47] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 2 ms to minimize.
[2024-06-02 20:35:48] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 2 ms to minimize.
[2024-06-02 20:35:48] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 2 ms to minimize.
[2024-06-02 20:35:48] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 476 unsolved
[2024-06-02 20:35:53] [INFO ] Deduced a trap composed of 50 places in 305 ms of which 4 ms to minimize.
[2024-06-02 20:35:53] [INFO ] Deduced a trap composed of 31 places in 317 ms of which 3 ms to minimize.
[2024-06-02 20:35:54] [INFO ] Deduced a trap composed of 36 places in 272 ms of which 3 ms to minimize.
[2024-06-02 20:35:54] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 1 ms to minimize.
[2024-06-02 20:35:55] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 3 ms to minimize.
[2024-06-02 20:35:55] [INFO ] Deduced a trap composed of 29 places in 239 ms of which 3 ms to minimize.
[2024-06-02 20:35:56] [INFO ] Deduced a trap composed of 50 places in 253 ms of which 3 ms to minimize.
[2024-06-02 20:35:57] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 4 ms to minimize.
[2024-06-02 20:35:57] [INFO ] Deduced a trap composed of 26 places in 296 ms of which 4 ms to minimize.
[2024-06-02 20:35:58] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 3 ms to minimize.
[2024-06-02 20:35:58] [INFO ] Deduced a trap composed of 33 places in 268 ms of which 5 ms to minimize.
[2024-06-02 20:35:59] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 3 ms to minimize.
[2024-06-02 20:35:59] [INFO ] Deduced a trap composed of 26 places in 235 ms of which 3 ms to minimize.
[2024-06-02 20:35:59] [INFO ] Deduced a trap composed of 25 places in 235 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 212/689 variables, and 61 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/212 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 476 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 54/61 constraints. Problems are: Problem set: 0 solved, 476 unsolved
[2024-06-02 20:36:05] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 3 ms to minimize.
[2024-06-02 20:36:06] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 3 ms to minimize.
[2024-06-02 20:36:06] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 3 ms to minimize.
[2024-06-02 20:36:06] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 4 ms to minimize.
[2024-06-02 20:36:06] [INFO ] Deduced a trap composed of 27 places in 281 ms of which 3 ms to minimize.
[2024-06-02 20:36:07] [INFO ] Deduced a trap composed of 25 places in 281 ms of which 3 ms to minimize.
[2024-06-02 20:36:07] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 3 ms to minimize.
[2024-06-02 20:36:08] [INFO ] Deduced a trap composed of 22 places in 260 ms of which 4 ms to minimize.
[2024-06-02 20:36:08] [INFO ] Deduced a trap composed of 25 places in 317 ms of which 4 ms to minimize.
[2024-06-02 20:36:08] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 4 ms to minimize.
[2024-06-02 20:36:09] [INFO ] Deduced a trap composed of 140 places in 288 ms of which 4 ms to minimize.
[2024-06-02 20:36:09] [INFO ] Deduced a trap composed of 24 places in 296 ms of which 4 ms to minimize.
[2024-06-02 20:36:09] [INFO ] Deduced a trap composed of 27 places in 295 ms of which 3 ms to minimize.
[2024-06-02 20:36:10] [INFO ] Deduced a trap composed of 29 places in 276 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 14/75 constraints. Problems are: Problem set: 0 solved, 476 unsolved
[2024-06-02 20:36:14] [INFO ] Deduced a trap composed of 39 places in 234 ms of which 3 ms to minimize.
[2024-06-02 20:36:14] [INFO ] Deduced a trap composed of 40 places in 248 ms of which 4 ms to minimize.
[2024-06-02 20:36:15] [INFO ] Deduced a trap composed of 45 places in 277 ms of which 5 ms to minimize.
[2024-06-02 20:36:15] [INFO ] Deduced a trap composed of 44 places in 277 ms of which 4 ms to minimize.
[2024-06-02 20:36:15] [INFO ] Deduced a trap composed of 36 places in 275 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
At refinement iteration 6 (OVERLAPS) 477/689 variables, 212/292 constraints. Problems are: Problem set: 50 solved, 426 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/689 variables, 426/718 constraints. Problems are: Problem set: 50 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 689/689 variables, and 718 constraints, problems are : Problem set: 50 solved, 426 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 426/476 constraints, Known Traps: 73/73 constraints]
After SMT, in 61179ms problems are : Problem set: 50 solved, 426 unsolved
Search for dead transitions found 50 dead transitions in 61235ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 212/252 places, 427/541 transitions.
Applied a total of 0 rules in 15 ms. Remains 212 /212 variables (removed 0) and now considering 427/427 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62772 ms. Remains : 212/252 places, 427/541 transitions.
Support contains 27 out of 212 places after structural reductions.
[2024-06-02 20:36:30] [INFO ] Flatten gal took : 152 ms
[2024-06-02 20:36:31] [INFO ] Flatten gal took : 81 ms
[2024-06-02 20:36:31] [INFO ] Input system was already deterministic with 427 transitions.
RANDOM walk for 40000 steps (1530 resets) in 3361 ms. (11 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4002 steps (32 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (32 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (34 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (33 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (33 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (33 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (33 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (34 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (35 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (34 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (33 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (35 resets) in 69 ms. (57 steps per ms) remains 15/15 properties
Finished probabilistic random walk after 319112 steps, run visited all 15 properties in 1311 ms. (steps per millisecond=243 )
Probabilistic random walk after 319112 steps, saw 63688 distinct states, run finished after 1318 ms. (steps per millisecond=242 ) properties seen :15
FORMULA MedleyA-PT-18-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 15 stabilizing places and 15 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 427/427 transitions.
Graph (trivial) has 223 edges and 212 vertex of which 13 / 212 are part of one of the 3 SCC in 5 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 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 201 transition count 372
Reduce places removed 44 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 48 rules applied. Total rules applied 93 place count 157 transition count 368
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 155 transition count 368
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 95 place count 155 transition count 359
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 113 place count 146 transition count 359
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 123 place count 136 transition count 340
Iterating global reduction 3 with 10 rules applied. Total rules applied 133 place count 136 transition count 340
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 133 place count 136 transition count 339
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 135 transition count 339
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 136 place count 134 transition count 331
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 134 transition count 331
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 197 place count 104 transition count 301
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 203 place count 104 transition count 295
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 208 place count 99 transition count 281
Iterating global reduction 4 with 5 rules applied. Total rules applied 213 place count 99 transition count 281
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 217 place count 95 transition count 269
Iterating global reduction 4 with 4 rules applied. Total rules applied 221 place count 95 transition count 269
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -92
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 259 place count 76 transition count 361
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 263 place count 76 transition count 357
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 267 place count 74 transition count 390
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 5 with 31 rules applied. Total rules applied 298 place count 74 transition count 359
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 304 place count 71 transition count 356
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 305 place count 70 transition count 355
Applied a total of 305 rules in 287 ms. Remains 70 /212 variables (removed 142) and now considering 355/427 (removed 72) transitions.
[2024-06-02 20:36:34] [INFO ] Flow matrix only has 327 transitions (discarded 28 similar events)
// Phase 1: matrix 327 rows 70 cols
[2024-06-02 20:36:34] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 20:36:34] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-02 20:36:34] [INFO ] Flow matrix only has 327 transitions (discarded 28 similar events)
[2024-06-02 20:36:34] [INFO ] Invariant cache hit.
[2024-06-02 20:36:34] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 20:36:35] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2024-06-02 20:36:35] [INFO ] Redundant transitions in 34 ms returned []
Running 350 sub problems to find dead transitions.
[2024-06-02 20:36:35] [INFO ] Flow matrix only has 327 transitions (discarded 28 similar events)
[2024-06-02 20:36:35] [INFO ] Invariant cache hit.
[2024-06-02 20:36:35] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 350 unsolved
[2024-06-02 20:36:37] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 2 ms to minimize.
[2024-06-02 20:36:37] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 2 ms to minimize.
[2024-06-02 20:36:37] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 2 ms to minimize.
[2024-06-02 20:36:37] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 2 ms to minimize.
[2024-06-02 20:36:37] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 2 ms to minimize.
[2024-06-02 20:36:38] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 2 ms to minimize.
[2024-06-02 20:36:38] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:36:38] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2024-06-02 20:36:38] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-06-02 20:36:38] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 1 ms to minimize.
[2024-06-02 20:36:38] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 2 ms to minimize.
[2024-06-02 20:36:38] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 20:36:38] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:36:38] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-02 20:36:38] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-06-02 20:36:39] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-06-02 20:36:39] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-06-02 20:36:39] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:36:39] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2024-06-02 20:36:39] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 350 unsolved
[2024-06-02 20:36:40] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-06-02 20:36:40] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2024-06-02 20:36:40] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 4 (OVERLAPS) 326/396 variables, 70/100 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 78/178 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 7 (OVERLAPS) 1/397 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 9 (OVERLAPS) 0/397 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 350 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 179 constraints, problems are : Problem set: 0 solved, 350 unsolved in 26344 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 70/70 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 350/350 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 3 (OVERLAPS) 326/396 variables, 70/100 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 78/178 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 350/528 constraints. Problems are: Problem set: 0 solved, 350 unsolved
[2024-06-02 20:37:26] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/397 variables, and 529 constraints, problems are : Problem set: 0 solved, 350 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 70/70 constraints, ReadFeed: 78/79 constraints, PredecessorRefiner: 350/350 constraints, Known Traps: 24/24 constraints]
After SMT, in 57096ms problems are : Problem set: 0 solved, 350 unsolved
Search for dead transitions found 0 dead transitions in 57107ms
Starting structural reductions in SI_LTL mode, iteration 1 : 70/212 places, 355/427 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57910 ms. Remains : 70/212 places, 355/427 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-18-LTLCardinality-01
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-18-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLCardinality-01 finished in 58397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 427/427 transitions.
Graph (trivial) has 224 edges and 212 vertex of which 13 / 212 are part of one of the 3 SCC in 2 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 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 201 transition count 372
Reduce places removed 44 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 48 rules applied. Total rules applied 93 place count 157 transition count 368
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 155 transition count 368
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 95 place count 155 transition count 359
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 113 place count 146 transition count 359
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 123 place count 136 transition count 340
Iterating global reduction 3 with 10 rules applied. Total rules applied 133 place count 136 transition count 340
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 133 place count 136 transition count 339
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 135 transition count 339
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 136 place count 134 transition count 331
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 134 transition count 331
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 197 place count 104 transition count 301
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 202 place count 104 transition count 296
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 207 place count 99 transition count 282
Iterating global reduction 4 with 5 rules applied. Total rules applied 212 place count 99 transition count 282
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 216 place count 95 transition count 270
Iterating global reduction 4 with 4 rules applied. Total rules applied 220 place count 95 transition count 270
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 260 place count 75 transition count 370
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 268 place count 75 transition count 362
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 270 place count 74 transition count 379
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 5 with 31 rules applied. Total rules applied 301 place count 74 transition count 348
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 307 place count 71 transition count 345
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 309 place count 70 transition count 362
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 310 place count 69 transition count 361
Applied a total of 310 rules in 194 ms. Remains 69 /212 variables (removed 143) and now considering 361/427 (removed 66) transitions.
[2024-06-02 20:37:32] [INFO ] Flow matrix only has 321 transitions (discarded 40 similar events)
// Phase 1: matrix 321 rows 69 cols
[2024-06-02 20:37:32] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 20:37:32] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-02 20:37:32] [INFO ] Flow matrix only has 321 transitions (discarded 40 similar events)
[2024-06-02 20:37:32] [INFO ] Invariant cache hit.
[2024-06-02 20:37:33] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 20:37:33] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2024-06-02 20:37:33] [INFO ] Redundant transitions in 6 ms returned []
Running 356 sub problems to find dead transitions.
[2024-06-02 20:37:33] [INFO ] Flow matrix only has 321 transitions (discarded 40 similar events)
[2024-06-02 20:37:33] [INFO ] Invariant cache hit.
[2024-06-02 20:37:33] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-06-02 20:37:35] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 1 ms to minimize.
[2024-06-02 20:37:35] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 2 ms to minimize.
[2024-06-02 20:37:35] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 2 ms to minimize.
[2024-06-02 20:37:35] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 2 ms to minimize.
[2024-06-02 20:37:35] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 2 ms to minimize.
[2024-06-02 20:37:35] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 2 ms to minimize.
[2024-06-02 20:37:36] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 1 ms to minimize.
[2024-06-02 20:37:36] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 2 ms to minimize.
[2024-06-02 20:37:36] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
[2024-06-02 20:37:36] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2024-06-02 20:37:36] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-06-02 20:37:36] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2024-06-02 20:37:36] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:37:36] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:37:36] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-02 20:37:36] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-06-02 20:37:36] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:37:37] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:37:37] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:37:37] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-06-02 20:37:37] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-06-02 20:37:38] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (OVERLAPS) 320/389 variables, 69/98 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 78/176 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 7 (OVERLAPS) 1/390 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 9 (OVERLAPS) 0/390 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 356 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 177 constraints, problems are : Problem set: 0 solved, 356 unsolved in 27206 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 69/69 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (OVERLAPS) 320/389 variables, 69/98 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 78/176 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 356/532 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-06-02 20:38:24] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/390 variables, and 533 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 69/69 constraints, ReadFeed: 78/79 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 23/23 constraints]
After SMT, in 57686ms problems are : Problem set: 0 solved, 356 unsolved
Search for dead transitions found 0 dead transitions in 57692ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/212 places, 361/427 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58429 ms. Remains : 69/212 places, 361/427 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-18-LTLCardinality-02
Product exploration explored 100000 steps with 16655 reset in 596 ms.
Product exploration explored 100000 steps with 16699 reset in 311 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 40000 steps (6946 resets) in 518 ms. (77 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2020 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3600 steps, run visited all 1 properties in 49 ms. (steps per millisecond=73 )
Probabilistic random walk after 3600 steps, saw 1251 distinct states, run finished after 50 ms. (steps per millisecond=72 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 1 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 361/361 transitions.
Applied a total of 0 rules in 18 ms. Remains 69 /69 variables (removed 0) and now considering 361/361 (removed 0) transitions.
[2024-06-02 20:38:32] [INFO ] Flow matrix only has 321 transitions (discarded 40 similar events)
[2024-06-02 20:38:32] [INFO ] Invariant cache hit.
[2024-06-02 20:38:32] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-02 20:38:32] [INFO ] Flow matrix only has 321 transitions (discarded 40 similar events)
[2024-06-02 20:38:32] [INFO ] Invariant cache hit.
[2024-06-02 20:38:32] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 20:38:33] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2024-06-02 20:38:33] [INFO ] Redundant transitions in 5 ms returned []
Running 356 sub problems to find dead transitions.
[2024-06-02 20:38:33] [INFO ] Flow matrix only has 321 transitions (discarded 40 similar events)
[2024-06-02 20:38:33] [INFO ] Invariant cache hit.
[2024-06-02 20:38:33] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-06-02 20:38:35] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 2 ms to minimize.
[2024-06-02 20:38:35] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 1 ms to minimize.
[2024-06-02 20:38:35] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 2 ms to minimize.
[2024-06-02 20:38:35] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 2 ms to minimize.
[2024-06-02 20:38:35] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 2 ms to minimize.
[2024-06-02 20:38:35] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 1 ms to minimize.
[2024-06-02 20:38:36] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 2 ms to minimize.
[2024-06-02 20:38:36] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 2 ms to minimize.
[2024-06-02 20:38:36] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2024-06-02 20:38:36] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2024-06-02 20:38:36] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-06-02 20:38:36] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 1 ms to minimize.
[2024-06-02 20:38:36] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:38:36] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:38:36] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-06-02 20:38:37] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
[2024-06-02 20:38:37] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2024-06-02 20:38:37] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2024-06-02 20:38:37] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:38:37] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-06-02 20:38:38] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-06-02 20:38:38] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (OVERLAPS) 320/389 variables, 69/98 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 78/176 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 7 (OVERLAPS) 1/390 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 9 (OVERLAPS) 0/390 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 356 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 177 constraints, problems are : Problem set: 0 solved, 356 unsolved in 29648 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 69/69 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (OVERLAPS) 320/389 variables, 69/98 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 78/176 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 356/532 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 356 unsolved
SMT process timed out in 60280ms, After SMT, problems are : Problem set: 0 solved, 356 unsolved
Search for dead transitions found 0 dead transitions in 60287ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60838 ms. Remains : 69/69 places, 361/361 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 40000 steps (6855 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 28487 steps (1438 resets) in 38 ms. (730 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 16769 reset in 227 ms.
Product exploration explored 100000 steps with 16730 reset in 364 ms.
Support contains 1 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 361/361 transitions.
Applied a total of 0 rules in 7 ms. Remains 69 /69 variables (removed 0) and now considering 361/361 (removed 0) transitions.
[2024-06-02 20:39:34] [INFO ] Flow matrix only has 321 transitions (discarded 40 similar events)
[2024-06-02 20:39:34] [INFO ] Invariant cache hit.
[2024-06-02 20:39:34] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-02 20:39:34] [INFO ] Flow matrix only has 321 transitions (discarded 40 similar events)
[2024-06-02 20:39:34] [INFO ] Invariant cache hit.
[2024-06-02 20:39:34] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 20:39:34] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2024-06-02 20:39:34] [INFO ] Redundant transitions in 4 ms returned []
Running 356 sub problems to find dead transitions.
[2024-06-02 20:39:34] [INFO ] Flow matrix only has 321 transitions (discarded 40 similar events)
[2024-06-02 20:39:34] [INFO ] Invariant cache hit.
[2024-06-02 20:39:34] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-06-02 20:39:37] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 2 ms to minimize.
[2024-06-02 20:39:37] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 2 ms to minimize.
[2024-06-02 20:39:37] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 2 ms to minimize.
[2024-06-02 20:39:37] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 2 ms to minimize.
[2024-06-02 20:39:37] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 2 ms to minimize.
[2024-06-02 20:39:37] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 2 ms to minimize.
[2024-06-02 20:39:38] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 2 ms to minimize.
[2024-06-02 20:39:38] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 2 ms to minimize.
[2024-06-02 20:39:38] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 2 ms to minimize.
[2024-06-02 20:39:38] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-06-02 20:39:38] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2024-06-02 20:39:38] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 2 ms to minimize.
[2024-06-02 20:39:38] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:39:38] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:39:38] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-02 20:39:39] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 2 ms to minimize.
[2024-06-02 20:39:39] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2024-06-02 20:39:39] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2024-06-02 20:39:39] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
[2024-06-02 20:39:39] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-06-02 20:39:40] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-06-02 20:39:40] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (OVERLAPS) 320/389 variables, 69/98 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 78/176 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 7 (OVERLAPS) 1/390 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 9 (OVERLAPS) 0/390 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 356 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 177 constraints, problems are : Problem set: 0 solved, 356 unsolved in 28563 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 69/69 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (OVERLAPS) 320/389 variables, 69/98 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 78/176 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 356/532 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-06-02 20:40:27] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/390 variables, and 533 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 69/69 constraints, ReadFeed: 78/79 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 23/23 constraints]
After SMT, in 59186ms problems are : Problem set: 0 solved, 356 unsolved
Search for dead transitions found 0 dead transitions in 59194ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 59623 ms. Remains : 69/69 places, 361/361 transitions.
Treatment of property MedleyA-PT-18-LTLCardinality-02 finished in 181730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 5 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 427/427 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 203 transition count 412
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 203 transition count 412
Applied a total of 18 rules in 13 ms. Remains 203 /212 variables (removed 9) and now considering 412/427 (removed 15) transitions.
// Phase 1: matrix 412 rows 203 cols
[2024-06-02 20:40:34] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 20:40:34] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-06-02 20:40:34] [INFO ] Invariant cache hit.
[2024-06-02 20:40:35] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
Running 411 sub problems to find dead transitions.
[2024-06-02 20:40:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-06-02 20:40:41] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 3 ms to minimize.
[2024-06-02 20:40:41] [INFO ] Deduced a trap composed of 22 places in 201 ms of which 3 ms to minimize.
[2024-06-02 20:40:42] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 3 ms to minimize.
[2024-06-02 20:40:42] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 2 ms to minimize.
[2024-06-02 20:40:42] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 3 ms to minimize.
[2024-06-02 20:40:42] [INFO ] Deduced a trap composed of 33 places in 229 ms of which 3 ms to minimize.
[2024-06-02 20:40:42] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-06-02 20:40:43] [INFO ] Deduced a trap composed of 125 places in 172 ms of which 3 ms to minimize.
[2024-06-02 20:40:43] [INFO ] Deduced a trap composed of 125 places in 234 ms of which 4 ms to minimize.
[2024-06-02 20:40:43] [INFO ] Deduced a trap composed of 126 places in 247 ms of which 4 ms to minimize.
[2024-06-02 20:40:43] [INFO ] Deduced a trap composed of 125 places in 190 ms of which 3 ms to minimize.
[2024-06-02 20:40:44] [INFO ] Deduced a trap composed of 40 places in 242 ms of which 4 ms to minimize.
[2024-06-02 20:40:45] [INFO ] Deduced a trap composed of 26 places in 218 ms of which 4 ms to minimize.
[2024-06-02 20:40:45] [INFO ] Deduced a trap composed of 25 places in 260 ms of which 3 ms to minimize.
[2024-06-02 20:40:45] [INFO ] Deduced a trap composed of 39 places in 254 ms of which 4 ms to minimize.
[2024-06-02 20:40:46] [INFO ] Deduced a trap composed of 30 places in 287 ms of which 4 ms to minimize.
[2024-06-02 20:40:46] [INFO ] Deduced a trap composed of 24 places in 237 ms of which 4 ms to minimize.
[2024-06-02 20:40:46] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 3 ms to minimize.
[2024-06-02 20:40:47] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 4 ms to minimize.
[2024-06-02 20:40:47] [INFO ] Deduced a trap composed of 24 places in 238 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-06-02 20:40:47] [INFO ] Deduced a trap composed of 33 places in 276 ms of which 3 ms to minimize.
[2024-06-02 20:40:48] [INFO ] Deduced a trap composed of 28 places in 246 ms of which 4 ms to minimize.
[2024-06-02 20:40:48] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 2 ms to minimize.
[2024-06-02 20:40:49] [INFO ] Deduced a trap composed of 138 places in 145 ms of which 2 ms to minimize.
[2024-06-02 20:40:49] [INFO ] Deduced a trap composed of 130 places in 250 ms of which 4 ms to minimize.
[2024-06-02 20:40:50] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 2 ms to minimize.
[2024-06-02 20:40:50] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 2 ms to minimize.
[2024-06-02 20:40:50] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 2 ms to minimize.
[2024-06-02 20:40:50] [INFO ] Deduced a trap composed of 25 places in 252 ms of which 3 ms to minimize.
[2024-06-02 20:40:50] [INFO ] Deduced a trap composed of 22 places in 251 ms of which 3 ms to minimize.
[2024-06-02 20:40:51] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 3 ms to minimize.
[2024-06-02 20:40:51] [INFO ] Deduced a trap composed of 25 places in 256 ms of which 4 ms to minimize.
[2024-06-02 20:40:51] [INFO ] Deduced a trap composed of 24 places in 242 ms of which 3 ms to minimize.
[2024-06-02 20:40:52] [INFO ] Deduced a trap composed of 34 places in 237 ms of which 3 ms to minimize.
[2024-06-02 20:40:52] [INFO ] Deduced a trap composed of 33 places in 233 ms of which 3 ms to minimize.
[2024-06-02 20:40:52] [INFO ] Deduced a trap composed of 33 places in 224 ms of which 4 ms to minimize.
[2024-06-02 20:40:52] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 2 ms to minimize.
[2024-06-02 20:40:53] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 3 ms to minimize.
[2024-06-02 20:40:54] [INFO ] Deduced a trap composed of 40 places in 191 ms of which 3 ms to minimize.
[2024-06-02 20:40:54] [INFO ] Deduced a trap composed of 142 places in 223 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-06-02 20:40:57] [INFO ] Deduced a trap composed of 33 places in 220 ms of which 3 ms to minimize.
[2024-06-02 20:40:59] [INFO ] Deduced a trap composed of 34 places in 252 ms of which 4 ms to minimize.
[2024-06-02 20:40:59] [INFO ] Deduced a trap composed of 29 places in 241 ms of which 3 ms to minimize.
[2024-06-02 20:41:00] [INFO ] Deduced a trap composed of 33 places in 283 ms of which 3 ms to minimize.
[2024-06-02 20:41:00] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 3 ms to minimize.
[2024-06-02 20:41:00] [INFO ] Deduced a trap composed of 23 places in 235 ms of which 4 ms to minimize.
[2024-06-02 20:41:00] [INFO ] Deduced a trap composed of 36 places in 235 ms of which 3 ms to minimize.
[2024-06-02 20:41:01] [INFO ] Deduced a trap composed of 25 places in 262 ms of which 3 ms to minimize.
[2024-06-02 20:41:01] [INFO ] Deduced a trap composed of 22 places in 233 ms of which 3 ms to minimize.
[2024-06-02 20:41:01] [INFO ] Deduced a trap composed of 24 places in 251 ms of which 4 ms to minimize.
[2024-06-02 20:41:02] [INFO ] Deduced a trap composed of 34 places in 226 ms of which 3 ms to minimize.
[2024-06-02 20:41:02] [INFO ] Deduced a trap composed of 29 places in 227 ms of which 3 ms to minimize.
[2024-06-02 20:41:02] [INFO ] Deduced a trap composed of 55 places in 230 ms of which 3 ms to minimize.
[2024-06-02 20:41:02] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 3 ms to minimize.
[2024-06-02 20:41:03] [INFO ] Deduced a trap composed of 24 places in 257 ms of which 3 ms to minimize.
[2024-06-02 20:41:03] [INFO ] Deduced a trap composed of 24 places in 242 ms of which 3 ms to minimize.
[2024-06-02 20:41:03] [INFO ] Deduced a trap composed of 22 places in 248 ms of which 3 ms to minimize.
[2024-06-02 20:41:04] [INFO ] Deduced a trap composed of 25 places in 250 ms of which 4 ms to minimize.
[2024-06-02 20:41:05] [INFO ] Deduced a trap composed of 131 places in 230 ms of which 4 ms to minimize.
[2024-06-02 20:41:05] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 203/615 variables, and 67 constraints, problems are : Problem set: 0 solved, 411 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 411 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-06-02 20:41:09] [INFO ] Deduced a trap composed of 112 places in 197 ms of which 3 ms to minimize.
[2024-06-02 20:41:10] [INFO ] Deduced a trap composed of 25 places in 258 ms of which 3 ms to minimize.
[2024-06-02 20:41:11] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 4 ms to minimize.
[2024-06-02 20:41:11] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 2 ms to minimize.
[2024-06-02 20:41:11] [INFO ] Deduced a trap composed of 29 places in 237 ms of which 3 ms to minimize.
[2024-06-02 20:41:12] [INFO ] Deduced a trap composed of 46 places in 225 ms of which 4 ms to minimize.
[2024-06-02 20:41:12] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 3 ms to minimize.
[2024-06-02 20:41:12] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-06-02 20:41:14] [INFO ] Deduced a trap composed of 100 places in 202 ms of which 4 ms to minimize.
[2024-06-02 20:41:15] [INFO ] Deduced a trap composed of 101 places in 256 ms of which 4 ms to minimize.
[2024-06-02 20:41:16] [INFO ] Deduced a trap composed of 28 places in 246 ms of which 4 ms to minimize.
[2024-06-02 20:41:17] [INFO ] Deduced a trap composed of 130 places in 219 ms of which 3 ms to minimize.
[2024-06-02 20:41:17] [INFO ] Deduced a trap composed of 28 places in 251 ms of which 4 ms to minimize.
[2024-06-02 20:41:18] [INFO ] Deduced a trap composed of 96 places in 243 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-06-02 20:41:20] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 3 ms to minimize.
[2024-06-02 20:41:21] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 3 ms to minimize.
[2024-06-02 20:41:22] [INFO ] Deduced a trap composed of 33 places in 225 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-06-02 20:41:26] [INFO ] Deduced a trap composed of 35 places in 212 ms of which 4 ms to minimize.
[2024-06-02 20:41:26] [INFO ] Deduced a trap composed of 36 places in 243 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-06-02 20:41:31] [INFO ] Deduced a trap composed of 86 places in 248 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 203/615 variables, and 87 constraints, problems are : Problem set: 0 solved, 411 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 0/411 constraints, Known Traps: 80/80 constraints]
After SMT, in 60393ms problems are : Problem set: 0 solved, 411 unsolved
Search for dead transitions found 0 dead transitions in 60402ms
Starting structural reductions in LTL mode, iteration 1 : 203/212 places, 412/427 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61131 ms. Remains : 203/212 places, 412/427 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : MedleyA-PT-18-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 443 ms.
Product exploration explored 100000 steps with 50000 reset in 304 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 p1 p0), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 16 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-18-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-18-LTLCardinality-06 finished in 62039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0) U p1))))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 427/427 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 204 transition count 414
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 204 transition count 414
Applied a total of 16 rules in 5 ms. Remains 204 /212 variables (removed 8) and now considering 414/427 (removed 13) transitions.
// Phase 1: matrix 414 rows 204 cols
[2024-06-02 20:41:36] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 20:41:36] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-02 20:41:36] [INFO ] Invariant cache hit.
[2024-06-02 20:41:36] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Running 413 sub problems to find dead transitions.
[2024-06-02 20:41:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 20:41:43] [INFO ] Deduced a trap composed of 15 places in 200 ms of which 3 ms to minimize.
[2024-06-02 20:41:43] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 2 ms to minimize.
[2024-06-02 20:41:43] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 2 ms to minimize.
[2024-06-02 20:41:43] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 4 ms to minimize.
[2024-06-02 20:41:43] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-06-02 20:41:44] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 2 ms to minimize.
[2024-06-02 20:41:44] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 2 ms to minimize.
[2024-06-02 20:41:44] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 2 ms to minimize.
[2024-06-02 20:41:44] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 2 ms to minimize.
[2024-06-02 20:41:44] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 2 ms to minimize.
[2024-06-02 20:41:44] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 4 ms to minimize.
[2024-06-02 20:41:45] [INFO ] Deduced a trap composed of 51 places in 251 ms of which 4 ms to minimize.
[2024-06-02 20:41:45] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 3 ms to minimize.
[2024-06-02 20:41:45] [INFO ] Deduced a trap composed of 46 places in 120 ms of which 2 ms to minimize.
[2024-06-02 20:41:45] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 2 ms to minimize.
[2024-06-02 20:41:46] [INFO ] Deduced a trap composed of 33 places in 268 ms of which 3 ms to minimize.
[2024-06-02 20:41:46] [INFO ] Deduced a trap composed of 35 places in 249 ms of which 3 ms to minimize.
[2024-06-02 20:41:47] [INFO ] Deduced a trap composed of 47 places in 266 ms of which 3 ms to minimize.
[2024-06-02 20:41:47] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 4 ms to minimize.
[2024-06-02 20:41:47] [INFO ] Deduced a trap composed of 39 places in 229 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 20:41:48] [INFO ] Deduced a trap composed of 126 places in 125 ms of which 2 ms to minimize.
[2024-06-02 20:41:48] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 2 ms to minimize.
[2024-06-02 20:41:48] [INFO ] Deduced a trap composed of 126 places in 194 ms of which 3 ms to minimize.
[2024-06-02 20:41:48] [INFO ] Deduced a trap composed of 127 places in 235 ms of which 4 ms to minimize.
[2024-06-02 20:41:48] [INFO ] Deduced a trap composed of 126 places in 206 ms of which 3 ms to minimize.
[2024-06-02 20:41:49] [INFO ] Deduced a trap composed of 27 places in 250 ms of which 3 ms to minimize.
[2024-06-02 20:41:49] [INFO ] Deduced a trap composed of 127 places in 231 ms of which 3 ms to minimize.
[2024-06-02 20:41:49] [INFO ] Deduced a trap composed of 28 places in 250 ms of which 3 ms to minimize.
[2024-06-02 20:41:49] [INFO ] Deduced a trap composed of 127 places in 177 ms of which 2 ms to minimize.
[2024-06-02 20:41:51] [INFO ] Deduced a trap composed of 32 places in 280 ms of which 4 ms to minimize.
[2024-06-02 20:41:51] [INFO ] Deduced a trap composed of 42 places in 257 ms of which 4 ms to minimize.
[2024-06-02 20:41:51] [INFO ] Deduced a trap composed of 22 places in 264 ms of which 4 ms to minimize.
[2024-06-02 20:41:51] [INFO ] Deduced a trap composed of 43 places in 269 ms of which 4 ms to minimize.
[2024-06-02 20:41:52] [INFO ] Deduced a trap composed of 34 places in 263 ms of which 4 ms to minimize.
[2024-06-02 20:41:52] [INFO ] Deduced a trap composed of 28 places in 257 ms of which 4 ms to minimize.
[2024-06-02 20:41:52] [INFO ] Deduced a trap composed of 47 places in 253 ms of which 3 ms to minimize.
[2024-06-02 20:41:53] [INFO ] Deduced a trap composed of 24 places in 189 ms of which 3 ms to minimize.
[2024-06-02 20:41:53] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 3 ms to minimize.
[2024-06-02 20:41:53] [INFO ] Deduced a trap composed of 36 places in 263 ms of which 4 ms to minimize.
[2024-06-02 20:41:53] [INFO ] Deduced a trap composed of 55 places in 248 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 20:41:58] [INFO ] Deduced a trap composed of 35 places in 265 ms of which 4 ms to minimize.
[2024-06-02 20:41:58] [INFO ] Deduced a trap composed of 30 places in 171 ms of which 3 ms to minimize.
[2024-06-02 20:41:58] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 2 ms to minimize.
[2024-06-02 20:41:58] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 2 ms to minimize.
[2024-06-02 20:41:58] [INFO ] Deduced a trap composed of 26 places in 249 ms of which 3 ms to minimize.
[2024-06-02 20:41:59] [INFO ] Deduced a trap composed of 29 places in 237 ms of which 4 ms to minimize.
[2024-06-02 20:41:59] [INFO ] Deduced a trap composed of 43 places in 202 ms of which 3 ms to minimize.
[2024-06-02 20:41:59] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 2 ms to minimize.
[2024-06-02 20:41:59] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 2 ms to minimize.
[2024-06-02 20:42:00] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 3 ms to minimize.
[2024-06-02 20:42:00] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 2 ms to minimize.
[2024-06-02 20:42:00] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 4 ms to minimize.
[2024-06-02 20:42:00] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 2 ms to minimize.
[2024-06-02 20:42:00] [INFO ] Deduced a trap composed of 139 places in 211 ms of which 4 ms to minimize.
[2024-06-02 20:42:01] [INFO ] Deduced a trap composed of 143 places in 216 ms of which 4 ms to minimize.
[2024-06-02 20:42:01] [INFO ] Deduced a trap composed of 45 places in 205 ms of which 3 ms to minimize.
[2024-06-02 20:42:01] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 3 ms to minimize.
[2024-06-02 20:42:01] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 4 ms to minimize.
[2024-06-02 20:42:02] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 3 ms to minimize.
[2024-06-02 20:42:02] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 20:42:03] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 3 ms to minimize.
[2024-06-02 20:42:04] [INFO ] Deduced a trap composed of 36 places in 196 ms of which 3 ms to minimize.
[2024-06-02 20:42:04] [INFO ] Deduced a trap composed of 29 places in 244 ms of which 3 ms to minimize.
[2024-06-02 20:42:04] [INFO ] Deduced a trap composed of 28 places in 236 ms of which 3 ms to minimize.
[2024-06-02 20:42:05] [INFO ] Deduced a trap composed of 48 places in 199 ms of which 3 ms to minimize.
[2024-06-02 20:42:05] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 3 ms to minimize.
[2024-06-02 20:42:05] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 2 ms to minimize.
[2024-06-02 20:42:05] [INFO ] Deduced a trap composed of 22 places in 233 ms of which 3 ms to minimize.
[2024-06-02 20:42:05] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 2 ms to minimize.
[2024-06-02 20:42:06] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 2 ms to minimize.
[2024-06-02 20:42:06] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 3 ms to minimize.
[2024-06-02 20:42:06] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 204/618 variables, and 79 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/204 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 72/72 constraints]
Escalating to Integer solving :Problem set: 0 solved, 413 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 72/79 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 20:42:11] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 3 ms to minimize.
[2024-06-02 20:42:12] [INFO ] Deduced a trap composed of 139 places in 201 ms of which 2 ms to minimize.
[2024-06-02 20:42:12] [INFO ] Deduced a trap composed of 47 places in 237 ms of which 3 ms to minimize.
[2024-06-02 20:42:13] [INFO ] Deduced a trap composed of 38 places in 199 ms of which 3 ms to minimize.
[2024-06-02 20:42:13] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 4 ms to minimize.
[2024-06-02 20:42:13] [INFO ] Deduced a trap composed of 38 places in 269 ms of which 3 ms to minimize.
[2024-06-02 20:42:13] [INFO ] Deduced a trap composed of 37 places in 248 ms of which 4 ms to minimize.
[2024-06-02 20:42:14] [INFO ] Deduced a trap composed of 44 places in 251 ms of which 4 ms to minimize.
[2024-06-02 20:42:14] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 3 ms to minimize.
[2024-06-02 20:42:14] [INFO ] Deduced a trap composed of 47 places in 258 ms of which 4 ms to minimize.
[2024-06-02 20:42:15] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 3 ms to minimize.
[2024-06-02 20:42:15] [INFO ] Deduced a trap composed of 37 places in 254 ms of which 3 ms to minimize.
[2024-06-02 20:42:15] [INFO ] Deduced a trap composed of 107 places in 247 ms of which 4 ms to minimize.
[2024-06-02 20:42:15] [INFO ] Deduced a trap composed of 34 places in 231 ms of which 4 ms to minimize.
[2024-06-02 20:42:16] [INFO ] Deduced a trap composed of 46 places in 229 ms of which 3 ms to minimize.
[2024-06-02 20:42:17] [INFO ] Deduced a trap composed of 41 places in 218 ms of which 3 ms to minimize.
[2024-06-02 20:42:17] [INFO ] Deduced a trap composed of 48 places in 238 ms of which 3 ms to minimize.
[2024-06-02 20:42:17] [INFO ] Deduced a trap composed of 143 places in 240 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 20:42:20] [INFO ] Deduced a trap composed of 46 places in 206 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 20:42:23] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 2 ms to minimize.
[2024-06-02 20:42:23] [INFO ] Deduced a trap composed of 111 places in 140 ms of which 2 ms to minimize.
[2024-06-02 20:42:24] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 3 ms to minimize.
[2024-06-02 20:42:24] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 2 ms to minimize.
[2024-06-02 20:42:24] [INFO ] Deduced a trap composed of 35 places in 267 ms of which 3 ms to minimize.
[2024-06-02 20:42:25] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 2 ms to minimize.
[2024-06-02 20:42:25] [INFO ] Deduced a trap composed of 36 places in 213 ms of which 3 ms to minimize.
[2024-06-02 20:42:26] [INFO ] Deduced a trap composed of 52 places in 264 ms of which 3 ms to minimize.
[2024-06-02 20:42:26] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 3 ms to minimize.
[2024-06-02 20:42:27] [INFO ] Deduced a trap composed of 24 places in 248 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 10/108 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 20:42:30] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 3 ms to minimize.
[2024-06-02 20:42:31] [INFO ] Deduced a trap composed of 139 places in 150 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 20:42:34] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 20:42:36] [INFO ] Deduced a trap composed of 142 places in 163 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 204/618 variables, and 112 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/204 constraints, PredecessorRefiner: 0/413 constraints, Known Traps: 105/105 constraints]
After SMT, in 60375ms problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 60385ms
Starting structural reductions in LTL mode, iteration 1 : 204/212 places, 414/427 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60860 ms. Remains : 204/212 places, 414/427 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : MedleyA-PT-18-LTLCardinality-07
Product exploration explored 100000 steps with 33333 reset in 93 ms.
Product exploration explored 100000 steps with 33333 reset in 96 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 p1 p0), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-18-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-18-LTLCardinality-07 finished in 61250 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(p0)||G(p1))))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 427/427 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 202 transition count 409
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 202 transition count 409
Applied a total of 20 rules in 7 ms. Remains 202 /212 variables (removed 10) and now considering 409/427 (removed 18) transitions.
// Phase 1: matrix 409 rows 202 cols
[2024-06-02 20:42:37] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:42:37] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-02 20:42:37] [INFO ] Invariant cache hit.
[2024-06-02 20:42:38] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
Running 408 sub problems to find dead transitions.
[2024-06-02 20:42:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 20:42:42] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 2 ms to minimize.
[2024-06-02 20:42:42] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-06-02 20:42:42] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 2 ms to minimize.
[2024-06-02 20:42:42] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-06-02 20:42:42] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 2 ms to minimize.
[2024-06-02 20:42:42] [INFO ] Deduced a trap composed of 47 places in 132 ms of which 2 ms to minimize.
[2024-06-02 20:42:43] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 2 ms to minimize.
[2024-06-02 20:42:43] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 1 ms to minimize.
[2024-06-02 20:42:43] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 2 ms to minimize.
[2024-06-02 20:42:43] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 2 ms to minimize.
[2024-06-02 20:42:43] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 2 ms to minimize.
[2024-06-02 20:42:43] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 2 ms to minimize.
[2024-06-02 20:42:43] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 2 ms to minimize.
[2024-06-02 20:42:44] [INFO ] Deduced a trap composed of 125 places in 131 ms of which 2 ms to minimize.
[2024-06-02 20:42:44] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 2 ms to minimize.
[2024-06-02 20:42:44] [INFO ] Deduced a trap composed of 126 places in 148 ms of which 2 ms to minimize.
[2024-06-02 20:42:44] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 2 ms to minimize.
[2024-06-02 20:42:44] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 3 ms to minimize.
[2024-06-02 20:42:44] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 2 ms to minimize.
[2024-06-02 20:42:45] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 20:42:45] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
[2024-06-02 20:42:45] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-06-02 20:42:45] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 2 ms to minimize.
[2024-06-02 20:42:46] [INFO ] Deduced a trap composed of 111 places in 147 ms of which 3 ms to minimize.
[2024-06-02 20:42:46] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-06-02 20:42:46] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 3 ms to minimize.
[2024-06-02 20:42:46] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 2 ms to minimize.
[2024-06-02 20:42:47] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 2 ms to minimize.
[2024-06-02 20:42:47] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 3 ms to minimize.
[2024-06-02 20:42:47] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 3 ms to minimize.
[2024-06-02 20:42:47] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 2 ms to minimize.
[2024-06-02 20:42:48] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 2 ms to minimize.
[2024-06-02 20:42:48] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 2 ms to minimize.
[2024-06-02 20:42:48] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 2 ms to minimize.
[2024-06-02 20:42:48] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 2 ms to minimize.
[2024-06-02 20:42:48] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 2 ms to minimize.
[2024-06-02 20:42:48] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 2 ms to minimize.
[2024-06-02 20:42:49] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-06-02 20:42:49] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 2 ms to minimize.
[2024-06-02 20:42:49] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 20:42:51] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 2 ms to minimize.
[2024-06-02 20:42:51] [INFO ] Deduced a trap composed of 139 places in 141 ms of which 2 ms to minimize.
[2024-06-02 20:42:51] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 2 ms to minimize.
[2024-06-02 20:42:52] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 2 ms to minimize.
[2024-06-02 20:42:52] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-06-02 20:42:52] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-06-02 20:42:53] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
[2024-06-02 20:42:53] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 2 ms to minimize.
[2024-06-02 20:42:53] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 2 ms to minimize.
[2024-06-02 20:42:53] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 2 ms to minimize.
[2024-06-02 20:42:53] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 2 ms to minimize.
[2024-06-02 20:42:53] [INFO ] Deduced a trap composed of 137 places in 133 ms of which 3 ms to minimize.
[2024-06-02 20:42:54] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 2 ms to minimize.
[2024-06-02 20:42:54] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 3 ms to minimize.
[2024-06-02 20:42:54] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 2 ms to minimize.
[2024-06-02 20:42:54] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-06-02 20:42:54] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 3 ms to minimize.
[2024-06-02 20:42:54] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 3 ms to minimize.
[2024-06-02 20:42:55] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 2 ms to minimize.
[2024-06-02 20:42:55] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 20:42:55] [INFO ] Deduced a trap composed of 125 places in 148 ms of which 2 ms to minimize.
[2024-06-02 20:42:55] [INFO ] Deduced a trap composed of 126 places in 150 ms of which 2 ms to minimize.
[2024-06-02 20:42:56] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 2 ms to minimize.
[2024-06-02 20:42:56] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 3 ms to minimize.
[2024-06-02 20:42:57] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 2 ms to minimize.
[2024-06-02 20:42:57] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 2 ms to minimize.
[2024-06-02 20:42:57] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 2 ms to minimize.
[2024-06-02 20:42:57] [INFO ] Deduced a trap composed of 142 places in 144 ms of which 3 ms to minimize.
[2024-06-02 20:42:57] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 3 ms to minimize.
[2024-06-02 20:42:58] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 2 ms to minimize.
[2024-06-02 20:42:58] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 2 ms to minimize.
[2024-06-02 20:42:58] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-06-02 20:42:59] [INFO ] Deduced a trap composed of 130 places in 126 ms of which 2 ms to minimize.
[2024-06-02 20:42:59] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 14/81 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 20:43:01] [INFO ] Deduced a trap composed of 137 places in 151 ms of which 2 ms to minimize.
[2024-06-02 20:43:01] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 3 ms to minimize.
[2024-06-02 20:43:02] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 2 ms to minimize.
[2024-06-02 20:43:02] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 3 ms to minimize.
[2024-06-02 20:43:02] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 2 ms to minimize.
[2024-06-02 20:43:02] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 20:43:06] [INFO ] Deduced a trap composed of 33 places in 246 ms of which 3 ms to minimize.
[2024-06-02 20:43:08] [INFO ] Deduced a trap composed of 34 places in 264 ms of which 3 ms to minimize.
SMT process timed out in 30219ms, After SMT, problems are : Problem set: 0 solved, 408 unsolved
Search for dead transitions found 0 dead transitions in 30225ms
Starting structural reductions in LTL mode, iteration 1 : 202/212 places, 409/427 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30720 ms. Remains : 202/212 places, 409/427 transitions.
Stuttering acceptance computed with spot in 286 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-18-LTLCardinality-10
Product exploration explored 100000 steps with 33333 reset in 150 ms.
Product exploration explored 100000 steps with 33333 reset in 160 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 20 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-18-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-18-LTLCardinality-10 finished in 31367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 427/427 transitions.
Graph (trivial) has 223 edges and 212 vertex of which 13 / 212 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 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 201 transition count 371
Reduce places removed 45 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 49 rules applied. Total rules applied 95 place count 156 transition count 367
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 154 transition count 367
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 97 place count 154 transition count 358
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 115 place count 145 transition count 358
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 125 place count 135 transition count 339
Iterating global reduction 3 with 10 rules applied. Total rules applied 135 place count 135 transition count 339
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 135 place count 135 transition count 338
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 134 transition count 338
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 138 place count 133 transition count 330
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 133 transition count 330
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 201 place count 102 transition count 299
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 207 place count 102 transition count 293
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 212 place count 97 transition count 279
Iterating global reduction 4 with 5 rules applied. Total rules applied 217 place count 97 transition count 279
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 221 place count 93 transition count 267
Iterating global reduction 4 with 4 rules applied. Total rules applied 225 place count 93 transition count 267
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 261 place count 75 transition count 363
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 265 place count 75 transition count 359
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 269 place count 73 transition count 397
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 5 with 41 rules applied. Total rules applied 310 place count 73 transition count 356
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 316 place count 70 transition count 353
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 317 place count 69 transition count 352
Applied a total of 317 rules in 108 ms. Remains 69 /212 variables (removed 143) and now considering 352/427 (removed 75) transitions.
[2024-06-02 20:43:09] [INFO ] Flow matrix only has 320 transitions (discarded 32 similar events)
// Phase 1: matrix 320 rows 69 cols
[2024-06-02 20:43:09] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:43:09] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-02 20:43:09] [INFO ] Flow matrix only has 320 transitions (discarded 32 similar events)
[2024-06-02 20:43:09] [INFO ] Invariant cache hit.
[2024-06-02 20:43:09] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 20:43:09] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2024-06-02 20:43:09] [INFO ] Redundant transitions in 4 ms returned []
Running 347 sub problems to find dead transitions.
[2024-06-02 20:43:09] [INFO ] Flow matrix only has 320 transitions (discarded 32 similar events)
[2024-06-02 20:43:09] [INFO ] Invariant cache hit.
[2024-06-02 20:43:09] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-02 20:43:11] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 1 ms to minimize.
[2024-06-02 20:43:11] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 2 ms to minimize.
[2024-06-02 20:43:12] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 2 ms to minimize.
[2024-06-02 20:43:12] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:43:12] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 1 ms to minimize.
[2024-06-02 20:43:12] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 1 ms to minimize.
[2024-06-02 20:43:12] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 2 ms to minimize.
[2024-06-02 20:43:12] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
[2024-06-02 20:43:12] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2024-06-02 20:43:13] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 2 ms to minimize.
[2024-06-02 20:43:13] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 2 ms to minimize.
[2024-06-02 20:43:13] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 2 ms to minimize.
[2024-06-02 20:43:13] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 1 ms to minimize.
[2024-06-02 20:43:13] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 2 ms to minimize.
[2024-06-02 20:43:13] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:43:13] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-06-02 20:43:13] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-06-02 20:43:14] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2024-06-02 20:43:14] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 2 ms to minimize.
[2024-06-02 20:43:14] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-02 20:43:15] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 4 (OVERLAPS) 319/388 variables, 69/97 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 78/175 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 9 (OVERLAPS) 0/389 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 347 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 176 constraints, problems are : Problem set: 0 solved, 347 unsolved in 27688 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 69/69 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 347/347 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 347 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-02 20:43:39] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 4 (OVERLAPS) 319/388 variables, 69/98 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 78/176 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 347/523 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 8 (OVERLAPS) 1/389 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 347 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/389 variables, and 524 constraints, problems are : Problem set: 0 solved, 347 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 69/69 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 347/347 constraints, Known Traps: 22/22 constraints]
After SMT, in 58283ms problems are : Problem set: 0 solved, 347 unsolved
Search for dead transitions found 0 dead transitions in 58290ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/212 places, 352/427 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58942 ms. Remains : 69/212 places, 352/427 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-18-LTLCardinality-11
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-18-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLCardinality-11 finished in 59000 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 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 427/427 transitions.
Graph (trivial) has 222 edges and 212 vertex of which 13 / 212 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 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 201 transition count 374
Reduce places removed 42 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 46 rules applied. Total rules applied 89 place count 159 transition count 370
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 92 place count 157 transition count 369
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 93 place count 156 transition count 369
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 93 place count 156 transition count 360
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 111 place count 147 transition count 360
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 122 place count 136 transition count 339
Iterating global reduction 4 with 11 rules applied. Total rules applied 133 place count 136 transition count 339
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 133 place count 136 transition count 338
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 135 place count 135 transition count 338
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 134 transition count 330
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 134 transition count 330
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 199 place count 103 transition count 299
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 205 place count 103 transition count 293
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 210 place count 98 transition count 279
Iterating global reduction 5 with 5 rules applied. Total rules applied 215 place count 98 transition count 279
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 219 place count 94 transition count 267
Iterating global reduction 5 with 4 rules applied. Total rules applied 223 place count 94 transition count 267
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -98
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 261 place count 75 transition count 365
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 265 place count 75 transition count 361
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 6 with 31 rules applied. Total rules applied 296 place count 75 transition count 330
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 302 place count 72 transition count 327
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 304 place count 71 transition count 339
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 305 place count 70 transition count 338
Applied a total of 305 rules in 58 ms. Remains 70 /212 variables (removed 142) and now considering 338/427 (removed 89) transitions.
[2024-06-02 20:44:08] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
// Phase 1: matrix 312 rows 70 cols
[2024-06-02 20:44:08] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:44:08] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 20:44:08] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
[2024-06-02 20:44:08] [INFO ] Invariant cache hit.
[2024-06-02 20:44:08] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-02 20:44:08] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
[2024-06-02 20:44:08] [INFO ] Redundant transitions in 4 ms returned []
Running 333 sub problems to find dead transitions.
[2024-06-02 20:44:08] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
[2024-06-02 20:44:08] [INFO ] Invariant cache hit.
[2024-06-02 20:44:08] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-02 20:44:10] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 1 ms to minimize.
[2024-06-02 20:44:10] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 2 ms to minimize.
[2024-06-02 20:44:10] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 1 ms to minimize.
[2024-06-02 20:44:11] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 2 ms to minimize.
[2024-06-02 20:44:11] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 2 ms to minimize.
[2024-06-02 20:44:11] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
[2024-06-02 20:44:11] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2024-06-02 20:44:11] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 2 ms to minimize.
[2024-06-02 20:44:11] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-06-02 20:44:11] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:44:11] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 2 ms to minimize.
[2024-06-02 20:44:12] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 1 ms to minimize.
[2024-06-02 20:44:12] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 2 ms to minimize.
[2024-06-02 20:44:12] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2024-06-02 20:44:12] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2024-06-02 20:44:13] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 1 ms to minimize.
[2024-06-02 20:44:13] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 2 ms to minimize.
[2024-06-02 20:44:14] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-02 20:44:15] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 311/381 variables, 70/96 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 72/168 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 7 (OVERLAPS) 1/382 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 9 (OVERLAPS) 0/382 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 333 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 169 constraints, problems are : Problem set: 0 solved, 333 unsolved in 29096 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 70/70 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-02 20:44:40] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 311/381 variables, 70/97 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 72/169 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 333/502 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-02 20:44:49] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/382 variables, and 503 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 70/70 constraints, ReadFeed: 72/73 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 21/21 constraints]
After SMT, in 59767ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 59775ms
Starting structural reductions in SI_LTL mode, iteration 1 : 70/212 places, 338/427 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60342 ms. Remains : 70/212 places, 338/427 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-18-LTLCardinality-12
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-18-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLCardinality-12 finished in 60413 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((X((p1||G(F(p2))))||p0))))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 427/427 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 204 transition count 413
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 204 transition count 413
Applied a total of 16 rules in 6 ms. Remains 204 /212 variables (removed 8) and now considering 413/427 (removed 14) transitions.
// Phase 1: matrix 413 rows 204 cols
[2024-06-02 20:45:08] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 20:45:08] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-06-02 20:45:08] [INFO ] Invariant cache hit.
[2024-06-02 20:45:09] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-06-02 20:45:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 20:45:15] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 2 ms to minimize.
[2024-06-02 20:45:15] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 2 ms to minimize.
[2024-06-02 20:45:16] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 3 ms to minimize.
[2024-06-02 20:45:16] [INFO ] Deduced a trap composed of 12 places in 224 ms of which 3 ms to minimize.
[2024-06-02 20:45:16] [INFO ] Deduced a trap composed of 39 places in 220 ms of which 3 ms to minimize.
[2024-06-02 20:45:16] [INFO ] Deduced a trap composed of 42 places in 235 ms of which 4 ms to minimize.
[2024-06-02 20:45:16] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 2 ms to minimize.
[2024-06-02 20:45:17] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 2 ms to minimize.
[2024-06-02 20:45:17] [INFO ] Deduced a trap composed of 47 places in 127 ms of which 2 ms to minimize.
[2024-06-02 20:45:17] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 3 ms to minimize.
[2024-06-02 20:45:17] [INFO ] Deduced a trap composed of 40 places in 230 ms of which 3 ms to minimize.
[2024-06-02 20:45:17] [INFO ] Deduced a trap composed of 127 places in 158 ms of which 3 ms to minimize.
[2024-06-02 20:45:17] [INFO ] Deduced a trap composed of 127 places in 186 ms of which 3 ms to minimize.
[2024-06-02 20:45:18] [INFO ] Deduced a trap composed of 33 places in 238 ms of which 3 ms to minimize.
[2024-06-02 20:45:18] [INFO ] Deduced a trap composed of 127 places in 207 ms of which 3 ms to minimize.
[2024-06-02 20:45:18] [INFO ] Deduced a trap composed of 40 places in 239 ms of which 3 ms to minimize.
[2024-06-02 20:45:18] [INFO ] Deduced a trap composed of 135 places in 251 ms of which 4 ms to minimize.
[2024-06-02 20:45:19] [INFO ] Deduced a trap composed of 127 places in 230 ms of which 3 ms to minimize.
[2024-06-02 20:45:19] [INFO ] Deduced a trap composed of 44 places in 241 ms of which 3 ms to minimize.
[2024-06-02 20:45:19] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 20:45:20] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-06-02 20:45:20] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2024-06-02 20:45:20] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
[2024-06-02 20:45:21] [INFO ] Deduced a trap composed of 40 places in 216 ms of which 3 ms to minimize.
[2024-06-02 20:45:22] [INFO ] Deduced a trap composed of 28 places in 271 ms of which 4 ms to minimize.
[2024-06-02 20:45:22] [INFO ] Deduced a trap composed of 26 places in 268 ms of which 3 ms to minimize.
[2024-06-02 20:45:22] [INFO ] Deduced a trap composed of 24 places in 254 ms of which 4 ms to minimize.
[2024-06-02 20:45:22] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 3 ms to minimize.
[2024-06-02 20:45:23] [INFO ] Deduced a trap composed of 22 places in 258 ms of which 3 ms to minimize.
[2024-06-02 20:45:23] [INFO ] Deduced a trap composed of 22 places in 236 ms of which 4 ms to minimize.
[2024-06-02 20:45:23] [INFO ] Deduced a trap composed of 41 places in 268 ms of which 3 ms to minimize.
[2024-06-02 20:45:24] [INFO ] Deduced a trap composed of 25 places in 250 ms of which 3 ms to minimize.
[2024-06-02 20:45:24] [INFO ] Deduced a trap composed of 36 places in 247 ms of which 3 ms to minimize.
[2024-06-02 20:45:24] [INFO ] Deduced a trap composed of 28 places in 251 ms of which 3 ms to minimize.
[2024-06-02 20:45:24] [INFO ] Deduced a trap composed of 29 places in 265 ms of which 4 ms to minimize.
[2024-06-02 20:45:25] [INFO ] Deduced a trap composed of 25 places in 256 ms of which 4 ms to minimize.
[2024-06-02 20:45:25] [INFO ] Deduced a trap composed of 35 places in 225 ms of which 5 ms to minimize.
[2024-06-02 20:45:25] [INFO ] Deduced a trap composed of 35 places in 240 ms of which 3 ms to minimize.
[2024-06-02 20:45:26] [INFO ] Deduced a trap composed of 28 places in 217 ms of which 3 ms to minimize.
[2024-06-02 20:45:26] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 20:45:30] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 3 ms to minimize.
[2024-06-02 20:45:31] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 3 ms to minimize.
[2024-06-02 20:45:31] [INFO ] Deduced a trap composed of 24 places in 209 ms of which 3 ms to minimize.
[2024-06-02 20:45:31] [INFO ] Deduced a trap composed of 24 places in 248 ms of which 3 ms to minimize.
[2024-06-02 20:45:31] [INFO ] Deduced a trap composed of 28 places in 231 ms of which 3 ms to minimize.
[2024-06-02 20:45:32] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 3 ms to minimize.
[2024-06-02 20:45:32] [INFO ] Deduced a trap composed of 48 places in 255 ms of which 4 ms to minimize.
[2024-06-02 20:45:32] [INFO ] Deduced a trap composed of 24 places in 270 ms of which 4 ms to minimize.
[2024-06-02 20:45:33] [INFO ] Deduced a trap composed of 24 places in 256 ms of which 4 ms to minimize.
[2024-06-02 20:45:33] [INFO ] Deduced a trap composed of 26 places in 206 ms of which 3 ms to minimize.
[2024-06-02 20:45:33] [INFO ] Deduced a trap composed of 23 places in 250 ms of which 3 ms to minimize.
[2024-06-02 20:45:33] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 3 ms to minimize.
[2024-06-02 20:45:34] [INFO ] Deduced a trap composed of 22 places in 228 ms of which 3 ms to minimize.
[2024-06-02 20:45:34] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 2 ms to minimize.
[2024-06-02 20:45:34] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-06-02 20:45:34] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-06-02 20:45:34] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 2 ms to minimize.
[2024-06-02 20:45:35] [INFO ] Deduced a trap composed of 46 places in 226 ms of which 3 ms to minimize.
[2024-06-02 20:45:35] [INFO ] Deduced a trap composed of 144 places in 232 ms of which 3 ms to minimize.
[2024-06-02 20:45:36] [INFO ] Deduced a trap composed of 40 places in 229 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 20:45:38] [INFO ] Deduced a trap composed of 35 places in 268 ms of which 3 ms to minimize.
[2024-06-02 20:45:38] [INFO ] Deduced a trap composed of 25 places in 262 ms of which 4 ms to minimize.
[2024-06-02 20:45:39] [INFO ] Deduced a trap composed of 47 places in 238 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 204/617 variables, and 70 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/204 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 63/70 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 20:45:43] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 2 ms to minimize.
[2024-06-02 20:45:44] [INFO ] Deduced a trap composed of 28 places in 253 ms of which 4 ms to minimize.
[2024-06-02 20:45:45] [INFO ] Deduced a trap composed of 37 places in 238 ms of which 4 ms to minimize.
[2024-06-02 20:45:45] [INFO ] Deduced a trap composed of 112 places in 195 ms of which 3 ms to minimize.
[2024-06-02 20:45:46] [INFO ] Deduced a trap composed of 30 places in 250 ms of which 4 ms to minimize.
[2024-06-02 20:45:46] [INFO ] Deduced a trap composed of 29 places in 261 ms of which 3 ms to minimize.
[2024-06-02 20:45:46] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 3 ms to minimize.
[2024-06-02 20:45:47] [INFO ] Deduced a trap composed of 38 places in 211 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 20:45:50] [INFO ] Deduced a trap composed of 93 places in 232 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 20:45:53] [INFO ] Deduced a trap composed of 24 places in 249 ms of which 3 ms to minimize.
[2024-06-02 20:45:55] [INFO ] Deduced a trap composed of 40 places in 251 ms of which 3 ms to minimize.
[2024-06-02 20:45:55] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 20:45:59] [INFO ] Deduced a trap composed of 36 places in 220 ms of which 3 ms to minimize.
[2024-06-02 20:45:59] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 3 ms to minimize.
[2024-06-02 20:46:00] [INFO ] Deduced a trap composed of 56 places in 233 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 20:46:03] [INFO ] Deduced a trap composed of 145 places in 233 ms of which 4 ms to minimize.
[2024-06-02 20:46:03] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 2 ms to minimize.
[2024-06-02 20:46:04] [INFO ] Deduced a trap composed of 145 places in 230 ms of which 3 ms to minimize.
[2024-06-02 20:46:05] [INFO ] Deduced a trap composed of 37 places in 222 ms of which 4 ms to minimize.
[2024-06-02 20:46:05] [INFO ] Deduced a trap composed of 54 places in 238 ms of which 4 ms to minimize.
[2024-06-02 20:46:05] [INFO ] Deduced a trap composed of 35 places in 206 ms of which 3 ms to minimize.
[2024-06-02 20:46:05] [INFO ] Deduced a trap composed of 46 places in 229 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 7/92 constraints. Problems are: Problem set: 0 solved, 412 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 Int declared 204/617 variables, and 92 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/204 constraints, PredecessorRefiner: 0/412 constraints, Known Traps: 85/85 constraints]
After SMT, in 60379ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60387ms
Starting structural reductions in LTL mode, iteration 1 : 204/212 places, 413/427 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61039 ms. Remains : 204/212 places, 413/427 transitions.
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-18-LTLCardinality-15
Product exploration explored 100000 steps with 3837 reset in 310 ms.
Product exploration explored 100000 steps with 3838 reset in 331 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 p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 214 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (1536 resets) in 593 ms. (67 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (350 resets) in 428 ms. (93 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (355 resets) in 384 ms. (103 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (354 resets) in 534 ms. (74 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (357 resets) in 394 ms. (101 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (348 resets) in 398 ms. (100 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (353 resets) in 298 ms. (133 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 67660 steps, run visited all 6 properties in 682 ms. (steps per millisecond=99 )
Probabilistic random walk after 67660 steps, saw 15808 distinct states, run finished after 683 ms. (steps per millisecond=99 ) properties seen :6
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR p2 p0))), (F p1), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 11 factoid took 557 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 413/413 transitions.
Applied a total of 0 rules in 2 ms. Remains 204 /204 variables (removed 0) and now considering 413/413 (removed 0) transitions.
[2024-06-02 20:46:13] [INFO ] Invariant cache hit.
[2024-06-02 20:46:13] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-06-02 20:46:13] [INFO ] Invariant cache hit.
[2024-06-02 20:46:14] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-06-02 20:46:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 20:46:20] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 3 ms to minimize.
[2024-06-02 20:46:20] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 2 ms to minimize.
[2024-06-02 20:46:21] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 2 ms to minimize.
[2024-06-02 20:46:21] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 3 ms to minimize.
[2024-06-02 20:46:21] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 2 ms to minimize.
[2024-06-02 20:46:21] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 3 ms to minimize.
[2024-06-02 20:46:21] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 3 ms to minimize.
[2024-06-02 20:46:22] [INFO ] Deduced a trap composed of 28 places in 217 ms of which 3 ms to minimize.
[2024-06-02 20:46:22] [INFO ] Deduced a trap composed of 47 places in 223 ms of which 3 ms to minimize.
[2024-06-02 20:46:22] [INFO ] Deduced a trap composed of 33 places in 210 ms of which 3 ms to minimize.
[2024-06-02 20:46:22] [INFO ] Deduced a trap composed of 40 places in 248 ms of which 4 ms to minimize.
[2024-06-02 20:46:23] [INFO ] Deduced a trap composed of 127 places in 167 ms of which 3 ms to minimize.
[2024-06-02 20:46:23] [INFO ] Deduced a trap composed of 127 places in 184 ms of which 3 ms to minimize.
[2024-06-02 20:46:23] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 3 ms to minimize.
[2024-06-02 20:46:23] [INFO ] Deduced a trap composed of 127 places in 194 ms of which 3 ms to minimize.
[2024-06-02 20:46:23] [INFO ] Deduced a trap composed of 40 places in 253 ms of which 4 ms to minimize.
[2024-06-02 20:46:24] [INFO ] Deduced a trap composed of 135 places in 256 ms of which 3 ms to minimize.
[2024-06-02 20:46:24] [INFO ] Deduced a trap composed of 127 places in 252 ms of which 3 ms to minimize.
[2024-06-02 20:46:24] [INFO ] Deduced a trap composed of 44 places in 244 ms of which 3 ms to minimize.
[2024-06-02 20:46:24] [INFO ] Deduced a trap composed of 34 places in 235 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 20:46:25] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 1 ms to minimize.
[2024-06-02 20:46:25] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 1 ms to minimize.
[2024-06-02 20:46:25] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 1 ms to minimize.
[2024-06-02 20:46:26] [INFO ] Deduced a trap composed of 40 places in 291 ms of which 4 ms to minimize.
[2024-06-02 20:46:27] [INFO ] Deduced a trap composed of 28 places in 269 ms of which 4 ms to minimize.
[2024-06-02 20:46:27] [INFO ] Deduced a trap composed of 26 places in 312 ms of which 4 ms to minimize.
[2024-06-02 20:46:28] [INFO ] Deduced a trap composed of 24 places in 286 ms of which 4 ms to minimize.
[2024-06-02 20:46:28] [INFO ] Deduced a trap composed of 24 places in 303 ms of which 4 ms to minimize.
[2024-06-02 20:46:28] [INFO ] Deduced a trap composed of 22 places in 271 ms of which 3 ms to minimize.
[2024-06-02 20:46:28] [INFO ] Deduced a trap composed of 22 places in 272 ms of which 3 ms to minimize.
[2024-06-02 20:46:29] [INFO ] Deduced a trap composed of 41 places in 291 ms of which 4 ms to minimize.
[2024-06-02 20:46:29] [INFO ] Deduced a trap composed of 25 places in 268 ms of which 4 ms to minimize.
[2024-06-02 20:46:29] [INFO ] Deduced a trap composed of 36 places in 279 ms of which 3 ms to minimize.
[2024-06-02 20:46:30] [INFO ] Deduced a trap composed of 28 places in 264 ms of which 4 ms to minimize.
[2024-06-02 20:46:30] [INFO ] Deduced a trap composed of 29 places in 276 ms of which 3 ms to minimize.
[2024-06-02 20:46:30] [INFO ] Deduced a trap composed of 25 places in 263 ms of which 3 ms to minimize.
[2024-06-02 20:46:31] [INFO ] Deduced a trap composed of 35 places in 232 ms of which 3 ms to minimize.
[2024-06-02 20:46:31] [INFO ] Deduced a trap composed of 35 places in 232 ms of which 4 ms to minimize.
[2024-06-02 20:46:31] [INFO ] Deduced a trap composed of 28 places in 267 ms of which 4 ms to minimize.
[2024-06-02 20:46:31] [INFO ] Deduced a trap composed of 32 places in 268 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 20:46:36] [INFO ] Deduced a trap composed of 34 places in 219 ms of which 3 ms to minimize.
[2024-06-02 20:46:36] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 3 ms to minimize.
[2024-06-02 20:46:37] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 3 ms to minimize.
[2024-06-02 20:46:37] [INFO ] Deduced a trap composed of 24 places in 210 ms of which 3 ms to minimize.
[2024-06-02 20:46:37] [INFO ] Deduced a trap composed of 28 places in 209 ms of which 3 ms to minimize.
[2024-06-02 20:46:37] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 3 ms to minimize.
[2024-06-02 20:46:38] [INFO ] Deduced a trap composed of 48 places in 263 ms of which 4 ms to minimize.
[2024-06-02 20:46:38] [INFO ] Deduced a trap composed of 24 places in 258 ms of which 4 ms to minimize.
[2024-06-02 20:46:38] [INFO ] Deduced a trap composed of 24 places in 244 ms of which 3 ms to minimize.
[2024-06-02 20:46:39] [INFO ] Deduced a trap composed of 26 places in 256 ms of which 4 ms to minimize.
[2024-06-02 20:46:39] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 3 ms to minimize.
[2024-06-02 20:46:39] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 4 ms to minimize.
[2024-06-02 20:46:39] [INFO ] Deduced a trap composed of 22 places in 226 ms of which 3 ms to minimize.
[2024-06-02 20:46:39] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 2 ms to minimize.
[2024-06-02 20:46:40] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2024-06-02 20:46:40] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-06-02 20:46:40] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 2 ms to minimize.
[2024-06-02 20:46:41] [INFO ] Deduced a trap composed of 46 places in 228 ms of which 3 ms to minimize.
[2024-06-02 20:46:41] [INFO ] Deduced a trap composed of 144 places in 245 ms of which 4 ms to minimize.
[2024-06-02 20:46:41] [INFO ] Deduced a trap composed of 40 places in 236 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 20:46:44] [INFO ] Deduced a trap composed of 35 places in 240 ms of which 4 ms to minimize.
[2024-06-02 20:46:44] [INFO ] Deduced a trap composed of 25 places in 254 ms of which 4 ms to minimize.
[2024-06-02 20:46:44] [INFO ] Deduced a trap composed of 47 places in 212 ms of which 3 ms to minimize.
SMT process timed out in 30423ms, After SMT, problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 30431ms
Finished structural reductions in LTL mode , in 1 iterations and 31091 ms. Remains : 204/204 places, 413/413 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 p2) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p2)), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 214 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (1529 resets) in 1156 ms. (34 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (353 resets) in 289 ms. (137 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (353 resets) in 299 ms. (133 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (356 resets) in 224 ms. (177 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (360 resets) in 148 ms. (268 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (354 resets) in 281 ms. (141 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (351 resets) in 159 ms. (250 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 67660 steps, run visited all 6 properties in 1061 ms. (steps per millisecond=63 )
Probabilistic random walk after 67660 steps, saw 15808 distinct states, run finished after 1061 ms. (steps per millisecond=63 ) properties seen :6
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p2)), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR p2 p0))), (F p1), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 11 factoid took 548 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 3829 reset in 206 ms.
Product exploration explored 100000 steps with 3837 reset in 355 ms.
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 413/413 transitions.
Applied a total of 0 rules in 2 ms. Remains 204 /204 variables (removed 0) and now considering 413/413 (removed 0) transitions.
[2024-06-02 20:46:49] [INFO ] Invariant cache hit.
[2024-06-02 20:46:49] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-06-02 20:46:49] [INFO ] Invariant cache hit.
[2024-06-02 20:46:50] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-06-02 20:46:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 20:46:56] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 3 ms to minimize.
[2024-06-02 20:46:56] [INFO ] Deduced a trap composed of 12 places in 205 ms of which 3 ms to minimize.
[2024-06-02 20:46:57] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 3 ms to minimize.
[2024-06-02 20:46:57] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 3 ms to minimize.
[2024-06-02 20:46:57] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 3 ms to minimize.
[2024-06-02 20:46:57] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 3 ms to minimize.
[2024-06-02 20:46:58] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 3 ms to minimize.
[2024-06-02 20:46:58] [INFO ] Deduced a trap composed of 28 places in 215 ms of which 3 ms to minimize.
[2024-06-02 20:46:58] [INFO ] Deduced a trap composed of 47 places in 238 ms of which 3 ms to minimize.
[2024-06-02 20:46:58] [INFO ] Deduced a trap composed of 33 places in 265 ms of which 3 ms to minimize.
[2024-06-02 20:46:59] [INFO ] Deduced a trap composed of 40 places in 268 ms of which 4 ms to minimize.
[2024-06-02 20:46:59] [INFO ] Deduced a trap composed of 127 places in 168 ms of which 4 ms to minimize.
[2024-06-02 20:46:59] [INFO ] Deduced a trap composed of 127 places in 189 ms of which 3 ms to minimize.
[2024-06-02 20:46:59] [INFO ] Deduced a trap composed of 33 places in 250 ms of which 3 ms to minimize.
[2024-06-02 20:47:00] [INFO ] Deduced a trap composed of 127 places in 209 ms of which 3 ms to minimize.
[2024-06-02 20:47:00] [INFO ] Deduced a trap composed of 40 places in 237 ms of which 3 ms to minimize.
[2024-06-02 20:47:00] [INFO ] Deduced a trap composed of 135 places in 264 ms of which 3 ms to minimize.
[2024-06-02 20:47:00] [INFO ] Deduced a trap composed of 127 places in 250 ms of which 4 ms to minimize.
[2024-06-02 20:47:01] [INFO ] Deduced a trap composed of 44 places in 249 ms of which 3 ms to minimize.
[2024-06-02 20:47:01] [INFO ] Deduced a trap composed of 34 places in 234 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 20:47:01] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 1 ms to minimize.
[2024-06-02 20:47:01] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 1 ms to minimize.
[2024-06-02 20:47:01] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
[2024-06-02 20:47:02] [INFO ] Deduced a trap composed of 40 places in 259 ms of which 3 ms to minimize.
[2024-06-02 20:47:03] [INFO ] Deduced a trap composed of 28 places in 275 ms of which 4 ms to minimize.
[2024-06-02 20:47:04] [INFO ] Deduced a trap composed of 26 places in 255 ms of which 4 ms to minimize.
[2024-06-02 20:47:04] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 4 ms to minimize.
[2024-06-02 20:47:04] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 4 ms to minimize.
[2024-06-02 20:47:04] [INFO ] Deduced a trap composed of 22 places in 271 ms of which 3 ms to minimize.
[2024-06-02 20:47:05] [INFO ] Deduced a trap composed of 22 places in 277 ms of which 4 ms to minimize.
[2024-06-02 20:47:05] [INFO ] Deduced a trap composed of 41 places in 267 ms of which 4 ms to minimize.
[2024-06-02 20:47:05] [INFO ] Deduced a trap composed of 25 places in 262 ms of which 3 ms to minimize.
[2024-06-02 20:47:06] [INFO ] Deduced a trap composed of 36 places in 269 ms of which 3 ms to minimize.
[2024-06-02 20:47:06] [INFO ] Deduced a trap composed of 28 places in 269 ms of which 4 ms to minimize.
[2024-06-02 20:47:06] [INFO ] Deduced a trap composed of 29 places in 267 ms of which 4 ms to minimize.
[2024-06-02 20:47:06] [INFO ] Deduced a trap composed of 25 places in 255 ms of which 4 ms to minimize.
[2024-06-02 20:47:07] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 3 ms to minimize.
[2024-06-02 20:47:07] [INFO ] Deduced a trap composed of 35 places in 232 ms of which 4 ms to minimize.
[2024-06-02 20:47:07] [INFO ] Deduced a trap composed of 28 places in 284 ms of which 4 ms to minimize.
[2024-06-02 20:47:08] [INFO ] Deduced a trap composed of 32 places in 299 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 20:47:12] [INFO ] Deduced a trap composed of 34 places in 223 ms of which 3 ms to minimize.
[2024-06-02 20:47:13] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 3 ms to minimize.
[2024-06-02 20:47:13] [INFO ] Deduced a trap composed of 24 places in 223 ms of which 4 ms to minimize.
[2024-06-02 20:47:13] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 3 ms to minimize.
[2024-06-02 20:47:13] [INFO ] Deduced a trap composed of 28 places in 236 ms of which 4 ms to minimize.
[2024-06-02 20:47:14] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 3 ms to minimize.
[2024-06-02 20:47:14] [INFO ] Deduced a trap composed of 48 places in 214 ms of which 3 ms to minimize.
[2024-06-02 20:47:14] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 4 ms to minimize.
[2024-06-02 20:47:15] [INFO ] Deduced a trap composed of 24 places in 260 ms of which 4 ms to minimize.
[2024-06-02 20:47:15] [INFO ] Deduced a trap composed of 26 places in 242 ms of which 3 ms to minimize.
[2024-06-02 20:47:15] [INFO ] Deduced a trap composed of 23 places in 245 ms of which 3 ms to minimize.
[2024-06-02 20:47:15] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 3 ms to minimize.
[2024-06-02 20:47:16] [INFO ] Deduced a trap composed of 22 places in 231 ms of which 3 ms to minimize.
[2024-06-02 20:47:16] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 2 ms to minimize.
[2024-06-02 20:47:16] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-06-02 20:47:16] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 1 ms to minimize.
[2024-06-02 20:47:16] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 2 ms to minimize.
[2024-06-02 20:47:17] [INFO ] Deduced a trap composed of 46 places in 242 ms of which 3 ms to minimize.
[2024-06-02 20:47:17] [INFO ] Deduced a trap composed of 144 places in 231 ms of which 3 ms to minimize.
[2024-06-02 20:47:18] [INFO ] Deduced a trap composed of 40 places in 226 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 20:47:20] [INFO ] Deduced a trap composed of 35 places in 258 ms of which 3 ms to minimize.
[2024-06-02 20:47:20] [INFO ] Deduced a trap composed of 25 places in 265 ms of which 3 ms to minimize.
SMT process timed out in 30502ms, After SMT, problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 30510ms
Finished structural reductions in LTL mode , in 1 iterations and 31019 ms. Remains : 204/204 places, 413/413 transitions.
Treatment of property MedleyA-PT-18-LTLCardinality-15 finished in 132220 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)))'
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((X((p1||G(F(p2))))||p0))))'
Found a Lengthening insensitive property : MedleyA-PT-18-LTLCardinality-15
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 212/212 places, 427/427 transitions.
Graph (trivial) has 219 edges and 212 vertex of which 9 / 212 are part of one of the 2 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 204 transition count 375
Reduce places removed 44 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 48 rules applied. Total rules applied 93 place count 160 transition count 371
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 158 transition count 371
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 95 place count 158 transition count 362
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 113 place count 149 transition count 362
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 122 place count 140 transition count 345
Iterating global reduction 3 with 9 rules applied. Total rules applied 131 place count 140 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 131 place count 140 transition count 344
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 139 transition count 344
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 193 place count 109 transition count 314
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 199 place count 109 transition count 308
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 204 place count 104 transition count 292
Iterating global reduction 4 with 5 rules applied. Total rules applied 209 place count 104 transition count 292
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 213 place count 100 transition count 280
Iterating global reduction 4 with 4 rules applied. Total rules applied 217 place count 100 transition count 280
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 218 place count 99 transition count 278
Iterating global reduction 4 with 1 rules applied. Total rules applied 219 place count 99 transition count 278
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 257 place count 80 transition count 378
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 268 place count 80 transition count 367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
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 270 place count 79 transition count 386
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 271 place count 78 transition count 385
Applied a total of 271 rules in 66 ms. Remains 78 /212 variables (removed 134) and now considering 385/427 (removed 42) transitions.
[2024-06-02 20:47:21] [INFO ] Flow matrix only has 360 transitions (discarded 25 similar events)
// Phase 1: matrix 360 rows 78 cols
[2024-06-02 20:47:21] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:47:21] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-02 20:47:21] [INFO ] Flow matrix only has 360 transitions (discarded 25 similar events)
[2024-06-02 20:47:21] [INFO ] Invariant cache hit.
[2024-06-02 20:47:21] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-06-02 20:47:21] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
Running 379 sub problems to find dead transitions.
[2024-06-02 20:47:21] [INFO ] Flow matrix only has 360 transitions (discarded 25 similar events)
[2024-06-02 20:47:21] [INFO ] Invariant cache hit.
[2024-06-02 20:47:21] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-06-02 20:47:24] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 2 ms to minimize.
[2024-06-02 20:47:24] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 2 ms to minimize.
[2024-06-02 20:47:24] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-06-02 20:47:24] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-06-02 20:47:24] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 2 ms to minimize.
[2024-06-02 20:47:25] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 2 ms to minimize.
[2024-06-02 20:47:25] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 2 ms to minimize.
[2024-06-02 20:47:25] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 2 ms to minimize.
[2024-06-02 20:47:25] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 1 ms to minimize.
[2024-06-02 20:47:25] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 2 ms to minimize.
[2024-06-02 20:47:25] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 1 ms to minimize.
[2024-06-02 20:47:26] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2024-06-02 20:47:26] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 1 ms to minimize.
[2024-06-02 20:47:26] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 2 ms to minimize.
[2024-06-02 20:47:26] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2024-06-02 20:47:26] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 2 ms to minimize.
[2024-06-02 20:47:26] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 2 ms to minimize.
[2024-06-02 20:47:27] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 1 ms to minimize.
[2024-06-02 20:47:27] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2024-06-02 20:47:27] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-06-02 20:47:27] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 2 ms to minimize.
[2024-06-02 20:47:28] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 2 ms to minimize.
[2024-06-02 20:47:28] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 1 ms to minimize.
[2024-06-02 20:47:28] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 2 ms to minimize.
[2024-06-02 20:47:29] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 2 ms to minimize.
[2024-06-02 20:47:29] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 1 ms to minimize.
[2024-06-02 20:47:29] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (OVERLAPS) 359/437 variables, 78/112 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 76/188 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 7 (OVERLAPS) 1/438 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 379 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 438/438 variables, and 189 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-06-02 20:47:53] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 1 ms to minimize.
[2024-06-02 20:47:54] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (OVERLAPS) 359/437 variables, 78/114 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 76/190 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 379/569 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/438 variables, and 569 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 76/77 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 29/29 constraints]
After SMT, in 60647ms problems are : Problem set: 0 solved, 379 unsolved
Search for dead transitions found 0 dead transitions in 60654ms
Starting structural reductions in LI_LTL mode, iteration 1 : 78/212 places, 385/427 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61314 ms. Remains : 78/212 places, 385/427 transitions.
Running random walk in product with property : MedleyA-PT-18-LTLCardinality-15
Stuttering criterion allowed to conclude after 49339 steps with 7007 reset in 86 ms.
Treatment of property MedleyA-PT-18-LTLCardinality-15 finished in 61888 ms.
FORMULA MedleyA-PT-18-LTLCardinality-15 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-02 20:48:22] [INFO ] Flatten gal took : 41 ms
[2024-06-02 20:48:22] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-02 20:48:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 212 places, 427 transitions and 1804 arcs took 10 ms.
Total runtime 775996 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA MedleyA-PT-18-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-18-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717361303688

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name MedleyA-PT-18-LTLCardinality-02
ltl formula formula --ltl=/tmp/3331/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 212 places, 427 transitions and 1804 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.020 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3331/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3331/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3331/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3331/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 213 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 213, there are 433 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~122 levels ~10000 states ~31008 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~83!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 10366
pnml2lts-mc( 0/ 4): unique states count: 19073
pnml2lts-mc( 0/ 4): unique transitions count: 67995
pnml2lts-mc( 0/ 4): - self-loop count: 240
pnml2lts-mc( 0/ 4): - claim dead count: 42204
pnml2lts-mc( 0/ 4): - claim found count: 5371
pnml2lts-mc( 0/ 4): - claim success count: 19107
pnml2lts-mc( 0/ 4): - cum. max stack depth: 730
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 19107 states 68108 transitions, fanout: 3.565
pnml2lts-mc( 0/ 4): Total exploration time 0.280 sec (0.280 sec minimum, 0.280 sec on average)
pnml2lts-mc( 0/ 4): States per second: 68239, Transitions per second: 243243
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 9.8 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 430 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name MedleyA-PT-18-LTLCardinality-15
ltl formula formula --ltl=/tmp/3331/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 212 places, 427 transitions and 1804 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3331/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3331/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3331/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3331/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 213 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 213, there are 489 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~89!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2406
pnml2lts-mc( 0/ 4): unique states count: 3548
pnml2lts-mc( 0/ 4): unique transitions count: 11917
pnml2lts-mc( 0/ 4): - self-loop count: 55
pnml2lts-mc( 0/ 4): - claim dead count: 7426
pnml2lts-mc( 0/ 4): - claim found count: 259
pnml2lts-mc( 0/ 4): - claim success count: 3562
pnml2lts-mc( 0/ 4): - cum. max stack depth: 285
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3562 states 11955 transitions, fanout: 3.356
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 59367, Transitions per second: 199250
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 11.0 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 430 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is MedleyA-PT-18, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r579-smll-171734921300139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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