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.r468-smll-171620167500323.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 AutonomousCar-PT-07b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167500323
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 17:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 17:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 334K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717215512213

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-07b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:18:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 04:18:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:18:35] [INFO ] Load time of PNML (sax parser for PT used): 388 ms
[2024-06-01 04:18:35] [INFO ] Transformed 323 places.
[2024-06-01 04:18:35] [INFO ] Transformed 846 transitions.
[2024-06-01 04:18:35] [INFO ] Found NUPN structural information;
[2024-06-01 04:18:35] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 648 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-07b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 846/846 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 290 transition count 813
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 290 transition count 813
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 285 transition count 808
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 285 transition count 808
Applied a total of 76 rules in 200 ms. Remains 285 /323 variables (removed 38) and now considering 808/846 (removed 38) transitions.
// Phase 1: matrix 808 rows 285 cols
[2024-06-01 04:18:36] [INFO ] Computed 12 invariants in 50 ms
[2024-06-01 04:18:37] [INFO ] Implicit Places using invariants in 743 ms returned []
[2024-06-01 04:18:37] [INFO ] Invariant cache hit.
[2024-06-01 04:18:37] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1701 ms to find 0 implicit places.
Running 807 sub problems to find dead transitions.
[2024-06-01 04:18:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 1 (OVERLAPS) 1/285 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 807 unsolved
[2024-06-01 04:19:01] [INFO ] Deduced a trap composed of 19 places in 706 ms of which 67 ms to minimize.
[2024-06-01 04:19:01] [INFO ] Deduced a trap composed of 21 places in 749 ms of which 5 ms to minimize.
[2024-06-01 04:19:02] [INFO ] Deduced a trap composed of 62 places in 416 ms of which 5 ms to minimize.
[2024-06-01 04:19:03] [INFO ] Deduced a trap composed of 20 places in 539 ms of which 5 ms to minimize.
[2024-06-01 04:19:03] [INFO ] Deduced a trap composed of 26 places in 462 ms of which 4 ms to minimize.
[2024-06-01 04:19:04] [INFO ] Deduced a trap composed of 54 places in 440 ms of which 6 ms to minimize.
[2024-06-01 04:19:04] [INFO ] Deduced a trap composed of 15 places in 568 ms of which 4 ms to minimize.
[2024-06-01 04:19:05] [INFO ] Deduced a trap composed of 37 places in 558 ms of which 4 ms to minimize.
[2024-06-01 04:19:06] [INFO ] Deduced a trap composed of 25 places in 527 ms of which 4 ms to minimize.
[2024-06-01 04:19:06] [INFO ] Deduced a trap composed of 36 places in 555 ms of which 5 ms to minimize.
[2024-06-01 04:19:07] [INFO ] Deduced a trap composed of 37 places in 498 ms of which 5 ms to minimize.
[2024-06-01 04:19:07] [INFO ] Deduced a trap composed of 44 places in 557 ms of which 5 ms to minimize.
[2024-06-01 04:19:08] [INFO ] Deduced a trap composed of 36 places in 537 ms of which 4 ms to minimize.
[2024-06-01 04:19:08] [INFO ] Deduced a trap composed of 40 places in 565 ms of which 5 ms to minimize.
[2024-06-01 04:19:09] [INFO ] Deduced a trap composed of 52 places in 572 ms of which 4 ms to minimize.
[2024-06-01 04:19:10] [INFO ] Deduced a trap composed of 42 places in 550 ms of which 4 ms to minimize.
[2024-06-01 04:19:11] [INFO ] Deduced a trap composed of 30 places in 538 ms of which 5 ms to minimize.
[2024-06-01 04:19:11] [INFO ] Deduced a trap composed of 33 places in 512 ms of which 4 ms to minimize.
[2024-06-01 04:19:12] [INFO ] Deduced a trap composed of 41 places in 588 ms of which 5 ms to minimize.
[2024-06-01 04:19:13] [INFO ] Deduced a trap composed of 43 places in 347 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 807 unsolved
[2024-06-01 04:19:14] [INFO ] Deduced a trap composed of 21 places in 577 ms of which 4 ms to minimize.
[2024-06-01 04:19:15] [INFO ] Deduced a trap composed of 32 places in 537 ms of which 5 ms to minimize.
SMT process timed out in 37026ms, After SMT, problems are : Problem set: 0 solved, 807 unsolved
Search for dead transitions found 0 dead transitions in 37102ms
Starting structural reductions in LTL mode, iteration 1 : 285/323 places, 808/846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39081 ms. Remains : 285/323 places, 808/846 transitions.
Support contains 47 out of 285 places after structural reductions.
[2024-06-01 04:19:15] [INFO ] Flatten gal took : 259 ms
[2024-06-01 04:19:15] [INFO ] Flatten gal took : 158 ms
[2024-06-01 04:19:16] [INFO ] Input system was already deterministic with 808 transitions.
RANDOM walk for 36692 steps (224 resets) in 2273 ms. (16 steps per ms) remains 0/29 properties
Computed a total of 50 stabilizing places and 51 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' '!(X(G(p0)))'
Support contains 1 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 270 transition count 793
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 270 transition count 793
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 265 transition count 788
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 265 transition count 788
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 264 transition count 787
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 264 transition count 787
Applied a total of 42 rules in 59 ms. Remains 264 /285 variables (removed 21) and now considering 787/808 (removed 21) transitions.
// Phase 1: matrix 787 rows 264 cols
[2024-06-01 04:19:17] [INFO ] Computed 12 invariants in 7 ms
[2024-06-01 04:19:17] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-06-01 04:19:17] [INFO ] Invariant cache hit.
[2024-06-01 04:19:18] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 893 ms to find 0 implicit places.
Running 786 sub problems to find dead transitions.
[2024-06-01 04:19:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 786 unsolved
[2024-06-01 04:19:37] [INFO ] Deduced a trap composed of 17 places in 612 ms of which 6 ms to minimize.
[2024-06-01 04:19:37] [INFO ] Deduced a trap composed of 18 places in 541 ms of which 4 ms to minimize.
[2024-06-01 04:19:38] [INFO ] Deduced a trap composed of 35 places in 350 ms of which 3 ms to minimize.
[2024-06-01 04:19:38] [INFO ] Deduced a trap composed of 36 places in 331 ms of which 3 ms to minimize.
[2024-06-01 04:19:38] [INFO ] Deduced a trap composed of 33 places in 324 ms of which 3 ms to minimize.
[2024-06-01 04:19:39] [INFO ] Deduced a trap composed of 44 places in 335 ms of which 2 ms to minimize.
[2024-06-01 04:19:39] [INFO ] Deduced a trap composed of 36 places in 321 ms of which 2 ms to minimize.
[2024-06-01 04:19:39] [INFO ] Deduced a trap composed of 38 places in 310 ms of which 3 ms to minimize.
[2024-06-01 04:19:40] [INFO ] Deduced a trap composed of 45 places in 318 ms of which 3 ms to minimize.
[2024-06-01 04:19:40] [INFO ] Deduced a trap composed of 46 places in 327 ms of which 2 ms to minimize.
[2024-06-01 04:19:40] [INFO ] Deduced a trap composed of 38 places in 387 ms of which 3 ms to minimize.
[2024-06-01 04:19:41] [INFO ] Deduced a trap composed of 32 places in 327 ms of which 3 ms to minimize.
[2024-06-01 04:19:41] [INFO ] Deduced a trap composed of 24 places in 308 ms of which 2 ms to minimize.
[2024-06-01 04:19:41] [INFO ] Deduced a trap composed of 37 places in 308 ms of which 2 ms to minimize.
[2024-06-01 04:19:42] [INFO ] Deduced a trap composed of 43 places in 324 ms of which 2 ms to minimize.
[2024-06-01 04:19:42] [INFO ] Deduced a trap composed of 44 places in 304 ms of which 3 ms to minimize.
[2024-06-01 04:19:42] [INFO ] Deduced a trap composed of 46 places in 327 ms of which 3 ms to minimize.
[2024-06-01 04:19:43] [INFO ] Deduced a trap composed of 39 places in 322 ms of which 3 ms to minimize.
[2024-06-01 04:19:43] [INFO ] Deduced a trap composed of 42 places in 307 ms of which 3 ms to minimize.
[2024-06-01 04:19:44] [INFO ] Deduced a trap composed of 38 places in 317 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 786 unsolved
[2024-06-01 04:19:44] [INFO ] Deduced a trap composed of 25 places in 307 ms of which 2 ms to minimize.
[2024-06-01 04:19:45] [INFO ] Deduced a trap composed of 21 places in 293 ms of which 2 ms to minimize.
[2024-06-01 04:19:45] [INFO ] Deduced a trap composed of 43 places in 301 ms of which 2 ms to minimize.
[2024-06-01 04:19:46] [INFO ] Deduced a trap composed of 49 places in 314 ms of which 3 ms to minimize.
[2024-06-01 04:19:46] [INFO ] Deduced a trap composed of 31 places in 270 ms of which 3 ms to minimize.
[2024-06-01 04:19:46] [INFO ] Deduced a trap composed of 31 places in 257 ms of which 3 ms to minimize.
[2024-06-01 04:19:47] [INFO ] Deduced a trap composed of 22 places in 312 ms of which 3 ms to minimize.
[2024-06-01 04:19:47] [INFO ] Deduced a trap composed of 38 places in 304 ms of which 2 ms to minimize.
[2024-06-01 04:19:47] [INFO ] Deduced a trap composed of 40 places in 299 ms of which 4 ms to minimize.
[2024-06-01 04:19:48] [INFO ] Deduced a trap composed of 42 places in 296 ms of which 2 ms to minimize.
[2024-06-01 04:19:48] [INFO ] Deduced a trap composed of 42 places in 264 ms of which 2 ms to minimize.
[2024-06-01 04:19:48] [INFO ] Deduced a trap composed of 39 places in 289 ms of which 3 ms to minimize.
[2024-06-01 04:19:48] [INFO ] Deduced a trap composed of 66 places in 282 ms of which 2 ms to minimize.
[2024-06-01 04:19:49] [INFO ] Deduced a trap composed of 45 places in 220 ms of which 2 ms to minimize.
[2024-06-01 04:19:49] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 2 ms to minimize.
[2024-06-01 04:19:49] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 2 ms to minimize.
[2024-06-01 04:19:49] [INFO ] Deduced a trap composed of 43 places in 188 ms of which 2 ms to minimize.
[2024-06-01 04:19:50] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 2 ms to minimize.
[2024-06-01 04:19:50] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 4 ms to minimize.
[2024-06-01 04:19:50] [INFO ] Deduced a trap composed of 39 places in 278 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 264/1051 variables, and 52 constraints, problems are : Problem set: 0 solved, 786 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 786/786 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 786 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 786 unsolved
[2024-06-01 04:19:59] [INFO ] Deduced a trap composed of 42 places in 250 ms of which 4 ms to minimize.
[2024-06-01 04:20:00] [INFO ] Deduced a trap composed of 31 places in 376 ms of which 3 ms to minimize.
[2024-06-01 04:20:00] [INFO ] Deduced a trap composed of 41 places in 412 ms of which 3 ms to minimize.
[2024-06-01 04:20:01] [INFO ] Deduced a trap composed of 41 places in 360 ms of which 3 ms to minimize.
[2024-06-01 04:20:01] [INFO ] Deduced a trap composed of 41 places in 363 ms of which 3 ms to minimize.
[2024-06-01 04:20:02] [INFO ] Deduced a trap composed of 45 places in 400 ms of which 4 ms to minimize.
[2024-06-01 04:20:02] [INFO ] Deduced a trap composed of 40 places in 383 ms of which 4 ms to minimize.
[2024-06-01 04:20:02] [INFO ] Deduced a trap composed of 36 places in 418 ms of which 3 ms to minimize.
[2024-06-01 04:20:03] [INFO ] Deduced a trap composed of 28 places in 309 ms of which 2 ms to minimize.
[2024-06-01 04:20:03] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 1 ms to minimize.
[2024-06-01 04:20:03] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 2 ms to minimize.
[2024-06-01 04:20:04] [INFO ] Deduced a trap composed of 40 places in 253 ms of which 3 ms to minimize.
[2024-06-01 04:20:04] [INFO ] Deduced a trap composed of 32 places in 374 ms of which 4 ms to minimize.
[2024-06-01 04:20:05] [INFO ] Deduced a trap composed of 32 places in 392 ms of which 4 ms to minimize.
[2024-06-01 04:20:06] [INFO ] Deduced a trap composed of 45 places in 324 ms of which 3 ms to minimize.
[2024-06-01 04:20:06] [INFO ] Deduced a trap composed of 46 places in 304 ms of which 3 ms to minimize.
[2024-06-01 04:20:06] [INFO ] Deduced a trap composed of 46 places in 257 ms of which 4 ms to minimize.
[2024-06-01 04:20:07] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 2 ms to minimize.
[2024-06-01 04:20:07] [INFO ] Deduced a trap composed of 46 places in 424 ms of which 4 ms to minimize.
[2024-06-01 04:20:08] [INFO ] Deduced a trap composed of 31 places in 398 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 786 unsolved
[2024-06-01 04:20:09] [INFO ] Deduced a trap composed of 14 places in 404 ms of which 4 ms to minimize.
[2024-06-01 04:20:10] [INFO ] Deduced a trap composed of 46 places in 290 ms of which 3 ms to minimize.
[2024-06-01 04:20:11] [INFO ] Deduced a trap composed of 45 places in 278 ms of which 3 ms to minimize.
[2024-06-01 04:20:11] [INFO ] Deduced a trap composed of 46 places in 262 ms of which 3 ms to minimize.
[2024-06-01 04:20:11] [INFO ] Deduced a trap composed of 44 places in 234 ms of which 3 ms to minimize.
[2024-06-01 04:20:12] [INFO ] Deduced a trap composed of 43 places in 192 ms of which 2 ms to minimize.
[2024-06-01 04:20:13] [INFO ] Deduced a trap composed of 45 places in 238 ms of which 2 ms to minimize.
[2024-06-01 04:20:13] [INFO ] Deduced a trap composed of 43 places in 229 ms of which 3 ms to minimize.
[2024-06-01 04:20:13] [INFO ] Deduced a trap composed of 31 places in 445 ms of which 4 ms to minimize.
[2024-06-01 04:20:14] [INFO ] Deduced a trap composed of 43 places in 288 ms of which 3 ms to minimize.
[2024-06-01 04:20:14] [INFO ] Deduced a trap composed of 46 places in 254 ms of which 3 ms to minimize.
[2024-06-01 04:20:14] [INFO ] Deduced a trap composed of 46 places in 215 ms of which 3 ms to minimize.
[2024-06-01 04:20:15] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 2 ms to minimize.
[2024-06-01 04:20:15] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 2 ms to minimize.
[2024-06-01 04:20:16] [INFO ] Deduced a trap composed of 46 places in 198 ms of which 2 ms to minimize.
[2024-06-01 04:20:16] [INFO ] Deduced a trap composed of 45 places in 309 ms of which 3 ms to minimize.
[2024-06-01 04:20:17] [INFO ] Deduced a trap composed of 43 places in 265 ms of which 3 ms to minimize.
[2024-06-01 04:20:17] [INFO ] Deduced a trap composed of 46 places in 207 ms of which 3 ms to minimize.
[2024-06-01 04:20:17] [INFO ] Deduced a trap composed of 44 places in 207 ms of which 2 ms to minimize.
[2024-06-01 04:20:18] [INFO ] Deduced a trap composed of 32 places in 470 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 786 unsolved
[2024-06-01 04:20:20] [INFO ] Deduced a trap composed of 42 places in 192 ms of which 2 ms to minimize.
[2024-06-01 04:20:20] [INFO ] Deduced a trap composed of 42 places in 215 ms of which 2 ms to minimize.
[2024-06-01 04:20:21] [INFO ] Deduced a trap composed of 42 places in 191 ms of which 2 ms to minimize.
[2024-06-01 04:20:23] [INFO ] Deduced a trap composed of 22 places in 567 ms of which 4 ms to minimize.
SMT process timed out in 65603ms, After SMT, problems are : Problem set: 0 solved, 786 unsolved
Search for dead transitions found 0 dead transitions in 65616ms
Starting structural reductions in LTL mode, iteration 1 : 264/285 places, 787/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66572 ms. Remains : 264/285 places, 787/808 transitions.
Stuttering acceptance computed with spot in 391 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 90 steps with 0 reset in 7 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-00 finished in 67061 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&X(F(p2))&&p0)))'
Support contains 7 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 272 transition count 795
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 272 transition count 795
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 222 place count 272 transition count 599
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 227 place count 267 transition count 594
Iterating global reduction 1 with 5 rules applied. Total rules applied 232 place count 267 transition count 594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 233 place count 266 transition count 593
Iterating global reduction 1 with 1 rules applied. Total rules applied 234 place count 266 transition count 593
Applied a total of 234 rules in 63 ms. Remains 266 /285 variables (removed 19) and now considering 593/808 (removed 215) transitions.
// Phase 1: matrix 593 rows 266 cols
[2024-06-01 04:20:24] [INFO ] Computed 12 invariants in 8 ms
[2024-06-01 04:20:24] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-06-01 04:20:24] [INFO ] Invariant cache hit.
[2024-06-01 04:20:25] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
Running 592 sub problems to find dead transitions.
[2024-06-01 04:20:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-06-01 04:20:38] [INFO ] Deduced a trap composed of 17 places in 503 ms of which 5 ms to minimize.
[2024-06-01 04:20:39] [INFO ] Deduced a trap composed of 22 places in 464 ms of which 4 ms to minimize.
[2024-06-01 04:20:39] [INFO ] Deduced a trap composed of 51 places in 430 ms of which 4 ms to minimize.
[2024-06-01 04:20:40] [INFO ] Deduced a trap composed of 26 places in 489 ms of which 4 ms to minimize.
[2024-06-01 04:20:40] [INFO ] Deduced a trap composed of 76 places in 440 ms of which 3 ms to minimize.
[2024-06-01 04:20:41] [INFO ] Deduced a trap composed of 25 places in 496 ms of which 5 ms to minimize.
[2024-06-01 04:20:42] [INFO ] Deduced a trap composed of 34 places in 491 ms of which 4 ms to minimize.
[2024-06-01 04:20:42] [INFO ] Deduced a trap composed of 31 places in 488 ms of which 5 ms to minimize.
[2024-06-01 04:20:43] [INFO ] Deduced a trap composed of 36 places in 469 ms of which 4 ms to minimize.
[2024-06-01 04:20:43] [INFO ] Deduced a trap composed of 54 places in 351 ms of which 4 ms to minimize.
[2024-06-01 04:20:43] [INFO ] Deduced a trap composed of 41 places in 333 ms of which 4 ms to minimize.
[2024-06-01 04:20:44] [INFO ] Deduced a trap composed of 45 places in 342 ms of which 3 ms to minimize.
[2024-06-01 04:20:44] [INFO ] Deduced a trap composed of 44 places in 361 ms of which 4 ms to minimize.
[2024-06-01 04:20:44] [INFO ] Deduced a trap composed of 46 places in 354 ms of which 3 ms to minimize.
[2024-06-01 04:20:45] [INFO ] Deduced a trap composed of 52 places in 364 ms of which 4 ms to minimize.
[2024-06-01 04:20:45] [INFO ] Deduced a trap composed of 52 places in 353 ms of which 4 ms to minimize.
[2024-06-01 04:20:45] [INFO ] Deduced a trap composed of 43 places in 337 ms of which 4 ms to minimize.
[2024-06-01 04:20:46] [INFO ] Deduced a trap composed of 52 places in 337 ms of which 3 ms to minimize.
[2024-06-01 04:20:46] [INFO ] Deduced a trap composed of 46 places in 320 ms of which 3 ms to minimize.
[2024-06-01 04:20:46] [INFO ] Deduced a trap composed of 52 places in 308 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-06-01 04:20:47] [INFO ] Deduced a trap composed of 23 places in 376 ms of which 4 ms to minimize.
[2024-06-01 04:20:48] [INFO ] Deduced a trap composed of 14 places in 377 ms of which 4 ms to minimize.
[2024-06-01 04:20:48] [INFO ] Deduced a trap composed of 35 places in 374 ms of which 4 ms to minimize.
[2024-06-01 04:20:49] [INFO ] Deduced a trap composed of 41 places in 371 ms of which 3 ms to minimize.
[2024-06-01 04:20:49] [INFO ] Deduced a trap composed of 35 places in 378 ms of which 4 ms to minimize.
[2024-06-01 04:20:50] [INFO ] Deduced a trap composed of 38 places in 384 ms of which 4 ms to minimize.
[2024-06-01 04:20:50] [INFO ] Deduced a trap composed of 36 places in 437 ms of which 4 ms to minimize.
[2024-06-01 04:20:50] [INFO ] Deduced a trap composed of 34 places in 418 ms of which 4 ms to minimize.
[2024-06-01 04:20:51] [INFO ] Deduced a trap composed of 36 places in 427 ms of which 5 ms to minimize.
[2024-06-01 04:20:51] [INFO ] Deduced a trap composed of 35 places in 420 ms of which 4 ms to minimize.
[2024-06-01 04:20:52] [INFO ] Deduced a trap composed of 28 places in 372 ms of which 4 ms to minimize.
[2024-06-01 04:20:52] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2024-06-01 04:20:52] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 3 ms to minimize.
[2024-06-01 04:20:52] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 3 ms to minimize.
[2024-06-01 04:20:53] [INFO ] Deduced a trap composed of 45 places in 242 ms of which 3 ms to minimize.
[2024-06-01 04:20:53] [INFO ] Deduced a trap composed of 42 places in 261 ms of which 2 ms to minimize.
[2024-06-01 04:20:53] [INFO ] Deduced a trap composed of 46 places in 403 ms of which 7 ms to minimize.
[2024-06-01 04:20:54] [INFO ] Deduced a trap composed of 44 places in 397 ms of which 4 ms to minimize.
[2024-06-01 04:20:54] [INFO ] Deduced a trap composed of 41 places in 368 ms of which 5 ms to minimize.
[2024-06-01 04:20:55] [INFO ] Deduced a trap composed of 45 places in 428 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 266/859 variables, and 52 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/266 constraints, PredecessorRefiner: 592/592 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 592 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-06-01 04:21:03] [INFO ] Deduced a trap composed of 24 places in 326 ms of which 3 ms to minimize.
[2024-06-01 04:21:03] [INFO ] Deduced a trap composed of 49 places in 239 ms of which 2 ms to minimize.
[2024-06-01 04:21:03] [INFO ] Deduced a trap composed of 41 places in 283 ms of which 3 ms to minimize.
[2024-06-01 04:21:04] [INFO ] Deduced a trap composed of 39 places in 288 ms of which 3 ms to minimize.
[2024-06-01 04:21:04] [INFO ] Deduced a trap composed of 40 places in 269 ms of which 3 ms to minimize.
[2024-06-01 04:21:05] [INFO ] Deduced a trap composed of 48 places in 333 ms of which 4 ms to minimize.
[2024-06-01 04:21:05] [INFO ] Deduced a trap composed of 46 places in 381 ms of which 4 ms to minimize.
[2024-06-01 04:21:05] [INFO ] Deduced a trap composed of 62 places in 383 ms of which 3 ms to minimize.
[2024-06-01 04:21:06] [INFO ] Deduced a trap composed of 42 places in 344 ms of which 4 ms to minimize.
[2024-06-01 04:21:06] [INFO ] Deduced a trap composed of 50 places in 432 ms of which 4 ms to minimize.
[2024-06-01 04:21:07] [INFO ] Deduced a trap composed of 32 places in 392 ms of which 4 ms to minimize.
[2024-06-01 04:21:08] [INFO ] Deduced a trap composed of 43 places in 278 ms of which 3 ms to minimize.
[2024-06-01 04:21:08] [INFO ] Deduced a trap composed of 46 places in 233 ms of which 3 ms to minimize.
[2024-06-01 04:21:08] [INFO ] Deduced a trap composed of 45 places in 224 ms of which 2 ms to minimize.
[2024-06-01 04:21:09] [INFO ] Deduced a trap composed of 32 places in 425 ms of which 5 ms to minimize.
[2024-06-01 04:21:10] [INFO ] Deduced a trap composed of 32 places in 460 ms of which 4 ms to minimize.
[2024-06-01 04:21:10] [INFO ] Deduced a trap composed of 41 places in 388 ms of which 4 ms to minimize.
[2024-06-01 04:21:10] [INFO ] Deduced a trap composed of 42 places in 322 ms of which 4 ms to minimize.
[2024-06-01 04:21:11] [INFO ] Deduced a trap composed of 33 places in 429 ms of which 5 ms to minimize.
[2024-06-01 04:21:11] [INFO ] Deduced a trap composed of 44 places in 306 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-06-01 04:21:14] [INFO ] Deduced a trap composed of 31 places in 415 ms of which 4 ms to minimize.
[2024-06-01 04:21:14] [INFO ] Deduced a trap composed of 48 places in 397 ms of which 5 ms to minimize.
[2024-06-01 04:21:15] [INFO ] Deduced a trap composed of 31 places in 390 ms of which 4 ms to minimize.
[2024-06-01 04:21:15] [INFO ] Deduced a trap composed of 57 places in 394 ms of which 4 ms to minimize.
[2024-06-01 04:21:16] [INFO ] Deduced a trap composed of 41 places in 389 ms of which 5 ms to minimize.
[2024-06-01 04:21:16] [INFO ] Deduced a trap composed of 47 places in 391 ms of which 4 ms to minimize.
[2024-06-01 04:21:17] [INFO ] Deduced a trap composed of 31 places in 400 ms of which 4 ms to minimize.
[2024-06-01 04:21:17] [INFO ] Deduced a trap composed of 41 places in 402 ms of which 5 ms to minimize.
[2024-06-01 04:21:18] [INFO ] Deduced a trap composed of 47 places in 399 ms of which 4 ms to minimize.
[2024-06-01 04:21:18] [INFO ] Deduced a trap composed of 43 places in 323 ms of which 3 ms to minimize.
[2024-06-01 04:21:19] [INFO ] Deduced a trap composed of 47 places in 282 ms of which 3 ms to minimize.
[2024-06-01 04:21:20] [INFO ] Deduced a trap composed of 15 places in 444 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 12/84 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 266/859 variables, and 84 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/266 constraints, PredecessorRefiner: 0/592 constraints, Known Traps: 72/72 constraints]
After SMT, in 62349ms problems are : Problem set: 0 solved, 592 unsolved
Search for dead transitions found 0 dead transitions in 62373ms
Starting structural reductions in LTL mode, iteration 1 : 266/285 places, 593/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63294 ms. Remains : 266/285 places, 593/808 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-01 finished in 63630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||((p1&&G(!p2)) U X(p1)))))'
Support contains 4 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 269 transition count 792
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 269 transition count 792
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 228 place count 269 transition count 596
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 233 place count 264 transition count 591
Iterating global reduction 1 with 5 rules applied. Total rules applied 238 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 239 place count 263 transition count 590
Iterating global reduction 1 with 1 rules applied. Total rules applied 240 place count 263 transition count 590
Applied a total of 240 rules in 44 ms. Remains 263 /285 variables (removed 22) and now considering 590/808 (removed 218) transitions.
// Phase 1: matrix 590 rows 263 cols
[2024-06-01 04:21:27] [INFO ] Computed 12 invariants in 7 ms
[2024-06-01 04:21:28] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-06-01 04:21:28] [INFO ] Invariant cache hit.
[2024-06-01 04:21:28] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 937 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2024-06-01 04:21:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 04:21:41] [INFO ] Deduced a trap composed of 17 places in 492 ms of which 5 ms to minimize.
[2024-06-01 04:21:42] [INFO ] Deduced a trap composed of 35 places in 443 ms of which 5 ms to minimize.
[2024-06-01 04:21:42] [INFO ] Deduced a trap composed of 37 places in 434 ms of which 4 ms to minimize.
[2024-06-01 04:21:43] [INFO ] Deduced a trap composed of 34 places in 442 ms of which 4 ms to minimize.
[2024-06-01 04:21:44] [INFO ] Deduced a trap composed of 25 places in 470 ms of which 4 ms to minimize.
[2024-06-01 04:21:44] [INFO ] Deduced a trap composed of 14 places in 436 ms of which 4 ms to minimize.
[2024-06-01 04:21:45] [INFO ] Deduced a trap composed of 36 places in 457 ms of which 4 ms to minimize.
[2024-06-01 04:21:45] [INFO ] Deduced a trap composed of 35 places in 456 ms of which 4 ms to minimize.
[2024-06-01 04:21:45] [INFO ] Deduced a trap composed of 36 places in 429 ms of which 4 ms to minimize.
[2024-06-01 04:21:46] [INFO ] Deduced a trap composed of 42 places in 440 ms of which 4 ms to minimize.
[2024-06-01 04:21:46] [INFO ] Deduced a trap composed of 36 places in 428 ms of which 4 ms to minimize.
[2024-06-01 04:21:47] [INFO ] Deduced a trap composed of 36 places in 425 ms of which 4 ms to minimize.
[2024-06-01 04:21:47] [INFO ] Deduced a trap composed of 49 places in 452 ms of which 4 ms to minimize.
[2024-06-01 04:21:48] [INFO ] Deduced a trap composed of 18 places in 424 ms of which 4 ms to minimize.
[2024-06-01 04:21:48] [INFO ] Deduced a trap composed of 24 places in 460 ms of which 4 ms to minimize.
[2024-06-01 04:21:49] [INFO ] Deduced a trap composed of 31 places in 386 ms of which 4 ms to minimize.
[2024-06-01 04:21:49] [INFO ] Deduced a trap composed of 41 places in 404 ms of which 4 ms to minimize.
[2024-06-01 04:21:50] [INFO ] Deduced a trap composed of 42 places in 321 ms of which 4 ms to minimize.
[2024-06-01 04:21:50] [INFO ] Deduced a trap composed of 43 places in 301 ms of which 3 ms to minimize.
[2024-06-01 04:21:50] [INFO ] Deduced a trap composed of 41 places in 298 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 04:21:51] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 2 ms to minimize.
[2024-06-01 04:21:53] [INFO ] Deduced a trap composed of 24 places in 434 ms of which 5 ms to minimize.
[2024-06-01 04:21:53] [INFO ] Deduced a trap composed of 75 places in 485 ms of which 5 ms to minimize.
[2024-06-01 04:21:54] [INFO ] Deduced a trap composed of 43 places in 382 ms of which 4 ms to minimize.
[2024-06-01 04:21:54] [INFO ] Deduced a trap composed of 59 places in 450 ms of which 4 ms to minimize.
[2024-06-01 04:21:55] [INFO ] Deduced a trap composed of 39 places in 459 ms of which 4 ms to minimize.
[2024-06-01 04:21:55] [INFO ] Deduced a trap composed of 31 places in 449 ms of which 4 ms to minimize.
[2024-06-01 04:21:56] [INFO ] Deduced a trap composed of 22 places in 478 ms of which 4 ms to minimize.
[2024-06-01 04:21:56] [INFO ] Deduced a trap composed of 42 places in 439 ms of which 4 ms to minimize.
[2024-06-01 04:21:57] [INFO ] Deduced a trap composed of 27 places in 422 ms of which 4 ms to minimize.
[2024-06-01 04:21:57] [INFO ] Deduced a trap composed of 38 places in 439 ms of which 4 ms to minimize.
[2024-06-01 04:21:58] [INFO ] Deduced a trap composed of 31 places in 349 ms of which 4 ms to minimize.
[2024-06-01 04:21:58] [INFO ] Deduced a trap composed of 31 places in 349 ms of which 4 ms to minimize.
[2024-06-01 04:21:59] [INFO ] Deduced a trap composed of 44 places in 451 ms of which 4 ms to minimize.
[2024-06-01 04:21:59] [INFO ] Deduced a trap composed of 40 places in 472 ms of which 4 ms to minimize.
[2024-06-01 04:22:00] [INFO ] Deduced a trap composed of 45 places in 726 ms of which 4 ms to minimize.
[2024-06-01 04:22:00] [INFO ] Deduced a trap composed of 46 places in 362 ms of which 4 ms to minimize.
[2024-06-01 04:22:01] [INFO ] Deduced a trap composed of 47 places in 419 ms of which 4 ms to minimize.
SMT process timed out in 32152ms, After SMT, problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 32163ms
Starting structural reductions in LTL mode, iteration 1 : 263/285 places, 590/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33147 ms. Remains : 263/285 places, 590/808 transitions.
Stuttering acceptance computed with spot in 345 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) p2)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-02
Product exploration explored 100000 steps with 33333 reset in 550 ms.
Product exploration explored 100000 steps with 33333 reset in 411 ms.
Computed a total of 42 stabilizing places and 43 stable transitions
Computed a total of 42 stabilizing places and 43 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 21 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-07b-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07b-LTLCardinality-02 finished in 34543 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((F(G(p1)) U p2))||p0))))'
Support contains 6 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Graph (trivial) has 262 edges and 285 vertex of which 4 / 285 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 106 place count 283 transition count 701
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 141 rules applied. Total rules applied 247 place count 178 transition count 665
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 22 rules applied. Total rules applied 269 place count 157 transition count 664
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 270 place count 156 transition count 664
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 270 place count 156 transition count 655
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 288 place count 147 transition count 655
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 297 place count 138 transition count 646
Iterating global reduction 4 with 9 rules applied. Total rules applied 306 place count 138 transition count 646
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 4 with 196 rules applied. Total rules applied 502 place count 138 transition count 450
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 502 place count 138 transition count 449
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 504 place count 137 transition count 449
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 506 place count 135 transition count 441
Iterating global reduction 5 with 2 rules applied. Total rules applied 508 place count 135 transition count 441
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 510 place count 135 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 511 place count 134 transition count 439
Performed 56 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 7 with 112 rules applied. Total rules applied 623 place count 78 transition count 382
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 624 place count 78 transition count 381
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 636 place count 66 transition count 291
Iterating global reduction 8 with 12 rules applied. Total rules applied 648 place count 66 transition count 291
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 654 place count 66 transition count 285
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 656 place count 65 transition count 284
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 657 place count 65 transition count 284
Applied a total of 657 rules in 190 ms. Remains 65 /285 variables (removed 220) and now considering 284/808 (removed 524) transitions.
// Phase 1: matrix 284 rows 65 cols
[2024-06-01 04:22:02] [INFO ] Computed 11 invariants in 2 ms
[2024-06-01 04:22:02] [INFO ] Implicit Places using invariants in 177 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 180 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/285 places, 284/808 transitions.
Applied a total of 0 rules in 15 ms. Remains 64 /64 variables (removed 0) and now considering 284/284 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 387 ms. Remains : 64/285 places, 284/808 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-03
Product exploration explored 100000 steps with 233 reset in 244 ms.
Product exploration explored 100000 steps with 87 reset in 244 ms.
Computed a total of 7 stabilizing places and 8 stable transitions
Computed a total of 7 stabilizing places and 8 stable transitions
Detected a total of 7/64 stabilizing places and 8/284 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2 p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 17 factoid took 439 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (1839 resets) in 825 ms. (48 steps per ms) remains 1/8 properties
BEST_FIRST walk for 21937 steps (125 resets) in 114 ms. (190 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2 p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT (OR p2 p0))), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 1074 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 284/284 transitions.
Applied a total of 0 rules in 19 ms. Remains 64 /64 variables (removed 0) and now considering 284/284 (removed 0) transitions.
// Phase 1: matrix 284 rows 64 cols
[2024-06-01 04:22:05] [INFO ] Computed 10 invariants in 6 ms
[2024-06-01 04:22:06] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-06-01 04:22:06] [INFO ] Invariant cache hit.
[2024-06-01 04:22:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 04:22:06] [INFO ] Implicit Places using invariants and state equation in 355 ms returned [59, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 529 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/64 places, 284/284 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 61 transition count 283
Applied a total of 2 rules in 23 ms. Remains 61 /62 variables (removed 1) and now considering 283/284 (removed 1) transitions.
// Phase 1: matrix 283 rows 61 cols
[2024-06-01 04:22:06] [INFO ] Computed 8 invariants in 4 ms
[2024-06-01 04:22:06] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-06-01 04:22:06] [INFO ] Invariant cache hit.
[2024-06-01 04:22:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:22:07] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/64 places, 283/284 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1085 ms. Remains : 61/64 places, 283/284 transitions.
Computed a total of 7 stabilizing places and 8 stable transitions
Computed a total of 7 stabilizing places and 8 stable transitions
Detected a total of 7/61 stabilizing places and 8/283 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 17 factoid took 449 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (1858 resets) in 331 ms. (120 steps per ms) remains 1/8 properties
BEST_FIRST walk for 26255 steps (147 resets) in 58 ms. (445 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT (OR p2 p0))), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 1038 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 153 reset in 125 ms.
Product exploration explored 100000 steps with 12 reset in 484 ms.
Support contains 6 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 283/283 transitions.
Applied a total of 0 rules in 16 ms. Remains 61 /61 variables (removed 0) and now considering 283/283 (removed 0) transitions.
[2024-06-01 04:22:10] [INFO ] Invariant cache hit.
[2024-06-01 04:22:10] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-06-01 04:22:10] [INFO ] Invariant cache hit.
[2024-06-01 04:22:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:22:10] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2024-06-01 04:22:10] [INFO ] Redundant transitions in 31 ms returned [175]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 281 sub problems to find dead transitions.
// Phase 1: matrix 282 rows 61 cols
[2024-06-01 04:22:10] [INFO ] Computed 8 invariants in 10 ms
[2024-06-01 04:22:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 04:22:14] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 2 ms to minimize.
[2024-06-01 04:22:14] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 2 ms to minimize.
[2024-06-01 04:22:14] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 1 ms to minimize.
[2024-06-01 04:22:14] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 1 ms to minimize.
[2024-06-01 04:22:14] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 1 ms to minimize.
[2024-06-01 04:22:14] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 2 ms to minimize.
[2024-06-01 04:22:14] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 1 ms to minimize.
[2024-06-01 04:22:15] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 1 ms to minimize.
[2024-06-01 04:22:15] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 1 ms to minimize.
[2024-06-01 04:22:15] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 2 ms to minimize.
[2024-06-01 04:22:15] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 04:22:16] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 281/342 variables, 61/81 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 04:22:21] [INFO ] Deduced a trap composed of 7 places in 375 ms of which 2 ms to minimize.
[2024-06-01 04:22:21] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 84 constraints, problems are : Problem set: 0 solved, 281 unsolved in 22691 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 281/342 variables, 61/83 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 281/364 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 04:22:45] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 2 ms to minimize.
[2024-06-01 04:22:46] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 281 unsolved
SMT process timed out in 54017ms, After SMT, problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 54020ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/61 places, 282/283 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 59 transition count 280
Applied a total of 4 rules in 14 ms. Remains 59 /61 variables (removed 2) and now considering 280/282 (removed 2) transitions.
// Phase 1: matrix 280 rows 59 cols
[2024-06-01 04:23:04] [INFO ] Computed 8 invariants in 3 ms
[2024-06-01 04:23:04] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 04:23:04] [INFO ] Invariant cache hit.
[2024-06-01 04:23:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 04:23:04] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/61 places, 280/283 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 54995 ms. Remains : 59/61 places, 280/283 transitions.
Treatment of property AutonomousCar-PT-07b-LTLCardinality-03 finished in 62881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(G(p1))))))'
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 269 transition count 792
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 269 transition count 792
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 228 place count 269 transition count 596
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 233 place count 264 transition count 591
Iterating global reduction 1 with 5 rules applied. Total rules applied 238 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 239 place count 263 transition count 590
Iterating global reduction 1 with 1 rules applied. Total rules applied 240 place count 263 transition count 590
Applied a total of 240 rules in 38 ms. Remains 263 /285 variables (removed 22) and now considering 590/808 (removed 218) transitions.
// Phase 1: matrix 590 rows 263 cols
[2024-06-01 04:23:05] [INFO ] Computed 12 invariants in 5 ms
[2024-06-01 04:23:05] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-06-01 04:23:05] [INFO ] Invariant cache hit.
[2024-06-01 04:23:06] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2024-06-01 04:23:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 04:23:18] [INFO ] Deduced a trap composed of 17 places in 365 ms of which 5 ms to minimize.
[2024-06-01 04:23:18] [INFO ] Deduced a trap composed of 35 places in 381 ms of which 4 ms to minimize.
[2024-06-01 04:23:19] [INFO ] Deduced a trap composed of 37 places in 430 ms of which 4 ms to minimize.
[2024-06-01 04:23:19] [INFO ] Deduced a trap composed of 34 places in 428 ms of which 4 ms to minimize.
[2024-06-01 04:23:20] [INFO ] Deduced a trap composed of 25 places in 476 ms of which 4 ms to minimize.
[2024-06-01 04:23:21] [INFO ] Deduced a trap composed of 14 places in 445 ms of which 5 ms to minimize.
[2024-06-01 04:23:21] [INFO ] Deduced a trap composed of 36 places in 453 ms of which 4 ms to minimize.
[2024-06-01 04:23:22] [INFO ] Deduced a trap composed of 35 places in 453 ms of which 4 ms to minimize.
[2024-06-01 04:23:22] [INFO ] Deduced a trap composed of 36 places in 410 ms of which 4 ms to minimize.
[2024-06-01 04:23:22] [INFO ] Deduced a trap composed of 42 places in 426 ms of which 4 ms to minimize.
[2024-06-01 04:23:23] [INFO ] Deduced a trap composed of 36 places in 418 ms of which 4 ms to minimize.
[2024-06-01 04:23:23] [INFO ] Deduced a trap composed of 36 places in 407 ms of which 4 ms to minimize.
[2024-06-01 04:23:24] [INFO ] Deduced a trap composed of 49 places in 438 ms of which 5 ms to minimize.
[2024-06-01 04:23:25] [INFO ] Deduced a trap composed of 18 places in 770 ms of which 4 ms to minimize.
[2024-06-01 04:23:25] [INFO ] Deduced a trap composed of 24 places in 426 ms of which 4 ms to minimize.
[2024-06-01 04:23:26] [INFO ] Deduced a trap composed of 31 places in 404 ms of which 4 ms to minimize.
[2024-06-01 04:23:26] [INFO ] Deduced a trap composed of 41 places in 322 ms of which 3 ms to minimize.
[2024-06-01 04:23:26] [INFO ] Deduced a trap composed of 42 places in 266 ms of which 3 ms to minimize.
[2024-06-01 04:23:27] [INFO ] Deduced a trap composed of 43 places in 252 ms of which 3 ms to minimize.
[2024-06-01 04:23:27] [INFO ] Deduced a trap composed of 41 places in 251 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 04:23:28] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-06-01 04:23:29] [INFO ] Deduced a trap composed of 24 places in 366 ms of which 3 ms to minimize.
[2024-06-01 04:23:29] [INFO ] Deduced a trap composed of 75 places in 449 ms of which 5 ms to minimize.
[2024-06-01 04:23:30] [INFO ] Deduced a trap composed of 43 places in 353 ms of which 4 ms to minimize.
[2024-06-01 04:23:30] [INFO ] Deduced a trap composed of 59 places in 341 ms of which 4 ms to minimize.
[2024-06-01 04:23:30] [INFO ] Deduced a trap composed of 39 places in 372 ms of which 4 ms to minimize.
[2024-06-01 04:23:31] [INFO ] Deduced a trap composed of 31 places in 458 ms of which 5 ms to minimize.
[2024-06-01 04:23:31] [INFO ] Deduced a trap composed of 22 places in 464 ms of which 4 ms to minimize.
[2024-06-01 04:23:32] [INFO ] Deduced a trap composed of 42 places in 342 ms of which 3 ms to minimize.
[2024-06-01 04:23:32] [INFO ] Deduced a trap composed of 27 places in 382 ms of which 4 ms to minimize.
[2024-06-01 04:23:33] [INFO ] Deduced a trap composed of 38 places in 407 ms of which 4 ms to minimize.
[2024-06-01 04:23:33] [INFO ] Deduced a trap composed of 31 places in 316 ms of which 3 ms to minimize.
[2024-06-01 04:23:33] [INFO ] Deduced a trap composed of 31 places in 350 ms of which 3 ms to minimize.
[2024-06-01 04:23:34] [INFO ] Deduced a trap composed of 44 places in 382 ms of which 3 ms to minimize.
[2024-06-01 04:23:34] [INFO ] Deduced a trap composed of 40 places in 348 ms of which 4 ms to minimize.
[2024-06-01 04:23:35] [INFO ] Deduced a trap composed of 45 places in 339 ms of which 2 ms to minimize.
[2024-06-01 04:23:35] [INFO ] Deduced a trap composed of 46 places in 375 ms of which 4 ms to minimize.
[2024-06-01 04:23:35] [INFO ] Deduced a trap composed of 47 places in 424 ms of which 4 ms to minimize.
[2024-06-01 04:23:36] [INFO ] Deduced a trap composed of 44 places in 420 ms of which 4 ms to minimize.
[2024-06-01 04:23:36] [INFO ] Deduced a trap composed of 40 places in 410 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 263/853 variables, and 52 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 589 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 04:23:45] [INFO ] Deduced a trap composed of 31 places in 425 ms of which 4 ms to minimize.
[2024-06-01 04:23:46] [INFO ] Deduced a trap composed of 31 places in 393 ms of which 4 ms to minimize.
[2024-06-01 04:23:46] [INFO ] Deduced a trap composed of 31 places in 381 ms of which 5 ms to minimize.
[2024-06-01 04:23:46] [INFO ] Deduced a trap composed of 32 places in 369 ms of which 4 ms to minimize.
[2024-06-01 04:23:47] [INFO ] Deduced a trap composed of 38 places in 362 ms of which 4 ms to minimize.
[2024-06-01 04:23:48] [INFO ] Deduced a trap composed of 52 places in 452 ms of which 4 ms to minimize.
[2024-06-01 04:23:48] [INFO ] Deduced a trap composed of 43 places in 274 ms of which 3 ms to minimize.
[2024-06-01 04:23:48] [INFO ] Deduced a trap composed of 41 places in 301 ms of which 4 ms to minimize.
[2024-06-01 04:23:48] [INFO ] Deduced a trap composed of 45 places in 272 ms of which 3 ms to minimize.
[2024-06-01 04:23:49] [INFO ] Deduced a trap composed of 46 places in 256 ms of which 3 ms to minimize.
[2024-06-01 04:23:49] [INFO ] Deduced a trap composed of 38 places in 258 ms of which 2 ms to minimize.
[2024-06-01 04:23:49] [INFO ] Deduced a trap composed of 46 places in 262 ms of which 3 ms to minimize.
[2024-06-01 04:23:50] [INFO ] Deduced a trap composed of 44 places in 238 ms of which 3 ms to minimize.
[2024-06-01 04:23:50] [INFO ] Deduced a trap composed of 42 places in 243 ms of which 3 ms to minimize.
[2024-06-01 04:23:50] [INFO ] Deduced a trap composed of 46 places in 218 ms of which 3 ms to minimize.
[2024-06-01 04:23:51] [INFO ] Deduced a trap composed of 46 places in 217 ms of which 3 ms to minimize.
[2024-06-01 04:23:51] [INFO ] Deduced a trap composed of 45 places in 202 ms of which 2 ms to minimize.
[2024-06-01 04:23:51] [INFO ] Deduced a trap composed of 52 places in 300 ms of which 3 ms to minimize.
[2024-06-01 04:23:52] [INFO ] Deduced a trap composed of 43 places in 304 ms of which 4 ms to minimize.
[2024-06-01 04:23:52] [INFO ] Deduced a trap composed of 38 places in 307 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 04:23:53] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 2 ms to minimize.
[2024-06-01 04:23:54] [INFO ] Deduced a trap composed of 41 places in 400 ms of which 4 ms to minimize.
[2024-06-01 04:23:55] [INFO ] Deduced a trap composed of 40 places in 407 ms of which 4 ms to minimize.
[2024-06-01 04:23:56] [INFO ] Deduced a trap composed of 41 places in 401 ms of which 4 ms to minimize.
[2024-06-01 04:23:56] [INFO ] Deduced a trap composed of 42 places in 321 ms of which 4 ms to minimize.
[2024-06-01 04:23:57] [INFO ] Deduced a trap composed of 52 places in 393 ms of which 7 ms to minimize.
[2024-06-01 04:23:57] [INFO ] Deduced a trap composed of 31 places in 347 ms of which 4 ms to minimize.
[2024-06-01 04:23:58] [INFO ] Deduced a trap composed of 42 places in 348 ms of which 4 ms to minimize.
[2024-06-01 04:23:58] [INFO ] Deduced a trap composed of 46 places in 310 ms of which 4 ms to minimize.
[2024-06-01 04:23:59] [INFO ] Deduced a trap composed of 42 places in 275 ms of which 3 ms to minimize.
[2024-06-01 04:23:59] [INFO ] Deduced a trap composed of 58 places in 389 ms of which 4 ms to minimize.
[2024-06-01 04:24:00] [INFO ] Deduced a trap composed of 56 places in 392 ms of which 4 ms to minimize.
[2024-06-01 04:24:01] [INFO ] Deduced a trap composed of 26 places in 403 ms of which 4 ms to minimize.
[2024-06-01 04:24:01] [INFO ] Deduced a trap composed of 5 places in 299 ms of which 3 ms to minimize.
[2024-06-01 04:24:01] [INFO ] Deduced a trap composed of 10 places in 437 ms of which 4 ms to minimize.
[2024-06-01 04:24:02] [INFO ] Deduced a trap composed of 15 places in 292 ms of which 4 ms to minimize.
[2024-06-01 04:24:02] [INFO ] Deduced a trap composed of 28 places in 401 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 17/89 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/853 variables, and 89 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 0/589 constraints, Known Traps: 77/77 constraints]
After SMT, in 61880ms problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 61887ms
Starting structural reductions in LTL mode, iteration 1 : 263/285 places, 590/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62789 ms. Remains : 263/285 places, 590/808 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-04 finished in 62999 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||(p0 U X(G(p1))))) U p2))'
Support contains 4 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Graph (trivial) has 265 edges and 285 vertex of which 4 / 285 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 109 place count 282 transition count 697
Reduce places removed 108 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 146 rules applied. Total rules applied 255 place count 174 transition count 659
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 24 rules applied. Total rules applied 279 place count 152 transition count 657
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 281 place count 150 transition count 657
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 281 place count 150 transition count 650
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 295 place count 143 transition count 650
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 305 place count 133 transition count 640
Iterating global reduction 4 with 10 rules applied. Total rules applied 315 place count 133 transition count 640
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 4 with 196 rules applied. Total rules applied 511 place count 133 transition count 444
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 511 place count 133 transition count 443
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 513 place count 132 transition count 443
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 514 place count 131 transition count 442
Iterating global reduction 5 with 1 rules applied. Total rules applied 515 place count 131 transition count 442
Performed 55 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 5 with 110 rules applied. Total rules applied 625 place count 76 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 626 place count 76 transition count 385
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 639 place count 63 transition count 287
Iterating global reduction 6 with 13 rules applied. Total rules applied 652 place count 63 transition count 287
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 657 place count 63 transition count 282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 659 place count 62 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 660 place count 62 transition count 280
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 661 place count 62 transition count 280
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 663 place count 60 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 664 place count 59 transition count 278
Applied a total of 664 rules in 170 ms. Remains 59 /285 variables (removed 226) and now considering 278/808 (removed 530) transitions.
// Phase 1: matrix 278 rows 59 cols
[2024-06-01 04:24:08] [INFO ] Computed 10 invariants in 3 ms
[2024-06-01 04:24:08] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-06-01 04:24:08] [INFO ] Invariant cache hit.
[2024-06-01 04:24:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 04:24:09] [INFO ] Implicit Places using invariants and state equation in 323 ms returned [54, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 506 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/285 places, 278/808 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 56 transition count 277
Applied a total of 2 rules in 20 ms. Remains 56 /57 variables (removed 1) and now considering 277/278 (removed 1) transitions.
// Phase 1: matrix 277 rows 56 cols
[2024-06-01 04:24:09] [INFO ] Computed 8 invariants in 4 ms
[2024-06-01 04:24:09] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-06-01 04:24:09] [INFO ] Invariant cache hit.
[2024-06-01 04:24:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:24:09] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/285 places, 277/808 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1100 ms. Remains : 56/285 places, 277/808 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-06
Stuttering criterion allowed to conclude after 23 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-06 finished in 1225 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 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Graph (trivial) has 270 edges and 285 vertex of which 4 / 285 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 282 transition count 694
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 152 rules applied. Total rules applied 264 place count 171 transition count 653
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 288 place count 147 transition count 653
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 288 place count 147 transition count 646
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 302 place count 140 transition count 646
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 312 place count 130 transition count 636
Iterating global reduction 3 with 10 rules applied. Total rules applied 322 place count 130 transition count 636
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 3 with 196 rules applied. Total rules applied 518 place count 130 transition count 440
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 518 place count 130 transition count 439
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 520 place count 129 transition count 439
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 521 place count 128 transition count 432
Iterating global reduction 4 with 1 rules applied. Total rules applied 522 place count 128 transition count 432
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 524 place count 128 transition count 430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 525 place count 127 transition count 430
Performed 53 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 6 with 106 rules applied. Total rules applied 631 place count 74 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 632 place count 74 transition count 375
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 645 place count 61 transition count 277
Iterating global reduction 7 with 13 rules applied. Total rules applied 658 place count 61 transition count 277
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 664 place count 61 transition count 271
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 666 place count 60 transition count 270
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 668 place count 59 transition count 270
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 670 place count 57 transition count 268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 671 place count 56 transition count 268
Applied a total of 671 rules in 77 ms. Remains 56 /285 variables (removed 229) and now considering 268/808 (removed 540) transitions.
// Phase 1: matrix 268 rows 56 cols
[2024-06-01 04:24:09] [INFO ] Computed 10 invariants in 3 ms
[2024-06-01 04:24:09] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-01 04:24:09] [INFO ] Invariant cache hit.
[2024-06-01 04:24:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 04:24:10] [INFO ] Implicit Places using invariants and state equation in 190 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 353 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/285 places, 268/808 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 267
Applied a total of 2 rules in 11 ms. Remains 54 /55 variables (removed 1) and now considering 267/268 (removed 1) transitions.
// Phase 1: matrix 267 rows 54 cols
[2024-06-01 04:24:10] [INFO ] Computed 9 invariants in 3 ms
[2024-06-01 04:24:10] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-06-01 04:24:10] [INFO ] Invariant cache hit.
[2024-06-01 04:24:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 04:24:10] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/285 places, 267/808 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 812 ms. Remains : 54/285 places, 267/808 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-07
Product exploration explored 100000 steps with 94 reset in 136 ms.
Product exploration explored 100000 steps with 109 reset in 129 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Detected a total of 5/54 stabilizing places and 7/267 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 248 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 51 ms :[(NOT p0)]
RANDOM walk for 6 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 289 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 55 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 267/267 transitions.
Applied a total of 0 rules in 8 ms. Remains 54 /54 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-06-01 04:24:11] [INFO ] Invariant cache hit.
[2024-06-01 04:24:11] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-01 04:24:11] [INFO ] Invariant cache hit.
[2024-06-01 04:24:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 04:24:11] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2024-06-01 04:24:11] [INFO ] Redundant transitions in 4 ms returned []
Running 265 sub problems to find dead transitions.
[2024-06-01 04:24:11] [INFO ] Invariant cache hit.
[2024-06-01 04:24:11] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-01 04:24:14] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-06-01 04:24:14] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 1/54 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-01 04:24:17] [INFO ] Deduced a trap composed of 16 places in 243 ms of which 2 ms to minimize.
[2024-06-01 04:24:17] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Problem TDEAD164 is UNSAT
At refinement iteration 6 (OVERLAPS) 266/320 variables, 54/67 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 1/68 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 9 (OVERLAPS) 1/321 variables, 1/69 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 11 (OVERLAPS) 0/321 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 69 constraints, problems are : Problem set: 1 solved, 264 unsolved in 16303 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 1 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 266/320 variables, 54/67 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 1/68 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 264/332 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/332 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 10 (OVERLAPS) 1/321 variables, 1/333 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/321 variables, 0/333 constraints. Problems are: Problem set: 1 solved, 264 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 321/321 variables, and 333 constraints, problems are : Problem set: 1 solved, 264 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 264/265 constraints, Known Traps: 4/4 constraints]
After SMT, in 47657ms problems are : Problem set: 1 solved, 264 unsolved
Search for dead transitions found 1 dead transitions in 47660ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 54/54 places, 266/267 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 9 ms. Remains 53 /54 variables (removed 1) and now considering 265/266 (removed 1) transitions.
[2024-06-01 04:24:59] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 48030 ms. Remains : 53/54 places, 265/267 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Detected a total of 4/53 stabilizing places and 5/265 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 107 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)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 134 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 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 72 reset in 72 ms.
Product exploration explored 100000 steps with 289 reset in 90 ms.
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 265/265 transitions.
Applied a total of 0 rules in 7 ms. Remains 53 /53 variables (removed 0) and now considering 265/265 (removed 0) transitions.
// Phase 1: matrix 265 rows 53 cols
[2024-06-01 04:25:00] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 04:25:00] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-01 04:25:00] [INFO ] Invariant cache hit.
[2024-06-01 04:25:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 04:25:00] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-06-01 04:25:00] [INFO ] Redundant transitions in 2 ms returned []
Running 264 sub problems to find dead transitions.
[2024-06-01 04:25:00] [INFO ] Invariant cache hit.
[2024-06-01 04:25:00] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-01 04:25:02] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-01 04:25:02] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (OVERLAPS) 1/53 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-01 04:25:05] [INFO ] Deduced a trap composed of 16 places in 244 ms of which 2 ms to minimize.
[2024-06-01 04:25:06] [INFO ] Deduced a trap composed of 6 places in 243 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 264/317 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (OVERLAPS) 1/318 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 12 (OVERLAPS) 0/318 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 68 constraints, problems are : Problem set: 0 solved, 264 unsolved in 15877 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 1/53 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (OVERLAPS) 264/317 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 264/331 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (OVERLAPS) 1/318 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-01 04:25:45] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 318/318 variables, and 333 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 5/5 constraints]
After SMT, in 46891ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 46895ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 47228 ms. Remains : 53/53 places, 265/265 transitions.
Treatment of property AutonomousCar-PT-07b-LTLCardinality-07 finished in 97851 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||X(G(p0)))))'
Support contains 1 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 269 transition count 792
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 269 transition count 792
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 228 place count 269 transition count 596
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 233 place count 264 transition count 591
Iterating global reduction 1 with 5 rules applied. Total rules applied 238 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 239 place count 263 transition count 590
Iterating global reduction 1 with 1 rules applied. Total rules applied 240 place count 263 transition count 590
Applied a total of 240 rules in 32 ms. Remains 263 /285 variables (removed 22) and now considering 590/808 (removed 218) transitions.
// Phase 1: matrix 590 rows 263 cols
[2024-06-01 04:25:47] [INFO ] Computed 12 invariants in 16 ms
[2024-06-01 04:25:47] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-06-01 04:25:47] [INFO ] Invariant cache hit.
[2024-06-01 04:25:48] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2024-06-01 04:25:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 04:26:00] [INFO ] Deduced a trap composed of 17 places in 446 ms of which 5 ms to minimize.
[2024-06-01 04:26:00] [INFO ] Deduced a trap composed of 35 places in 438 ms of which 4 ms to minimize.
[2024-06-01 04:26:01] [INFO ] Deduced a trap composed of 37 places in 448 ms of which 4 ms to minimize.
[2024-06-01 04:26:01] [INFO ] Deduced a trap composed of 34 places in 450 ms of which 4 ms to minimize.
[2024-06-01 04:26:02] [INFO ] Deduced a trap composed of 25 places in 471 ms of which 4 ms to minimize.
[2024-06-01 04:26:03] [INFO ] Deduced a trap composed of 14 places in 446 ms of which 4 ms to minimize.
[2024-06-01 04:26:03] [INFO ] Deduced a trap composed of 36 places in 424 ms of which 4 ms to minimize.
[2024-06-01 04:26:04] [INFO ] Deduced a trap composed of 35 places in 442 ms of which 4 ms to minimize.
[2024-06-01 04:26:04] [INFO ] Deduced a trap composed of 36 places in 457 ms of which 4 ms to minimize.
[2024-06-01 04:26:05] [INFO ] Deduced a trap composed of 42 places in 447 ms of which 4 ms to minimize.
[2024-06-01 04:26:05] [INFO ] Deduced a trap composed of 36 places in 446 ms of which 4 ms to minimize.
[2024-06-01 04:26:05] [INFO ] Deduced a trap composed of 36 places in 412 ms of which 4 ms to minimize.
[2024-06-01 04:26:06] [INFO ] Deduced a trap composed of 49 places in 416 ms of which 4 ms to minimize.
[2024-06-01 04:26:06] [INFO ] Deduced a trap composed of 18 places in 422 ms of which 4 ms to minimize.
[2024-06-01 04:26:07] [INFO ] Deduced a trap composed of 24 places in 450 ms of which 5 ms to minimize.
[2024-06-01 04:26:07] [INFO ] Deduced a trap composed of 31 places in 431 ms of which 4 ms to minimize.
[2024-06-01 04:26:08] [INFO ] Deduced a trap composed of 41 places in 403 ms of which 4 ms to minimize.
[2024-06-01 04:26:08] [INFO ] Deduced a trap composed of 42 places in 343 ms of which 3 ms to minimize.
[2024-06-01 04:26:09] [INFO ] Deduced a trap composed of 43 places in 329 ms of which 4 ms to minimize.
[2024-06-01 04:26:09] [INFO ] Deduced a trap composed of 41 places in 306 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 04:26:10] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 2 ms to minimize.
[2024-06-01 04:26:11] [INFO ] Deduced a trap composed of 24 places in 491 ms of which 4 ms to minimize.
[2024-06-01 04:26:12] [INFO ] Deduced a trap composed of 75 places in 470 ms of which 4 ms to minimize.
[2024-06-01 04:26:12] [INFO ] Deduced a trap composed of 43 places in 465 ms of which 4 ms to minimize.
[2024-06-01 04:26:13] [INFO ] Deduced a trap composed of 59 places in 453 ms of which 4 ms to minimize.
[2024-06-01 04:26:13] [INFO ] Deduced a trap composed of 39 places in 438 ms of which 4 ms to minimize.
[2024-06-01 04:26:14] [INFO ] Deduced a trap composed of 31 places in 440 ms of which 5 ms to minimize.
[2024-06-01 04:26:14] [INFO ] Deduced a trap composed of 22 places in 477 ms of which 5 ms to minimize.
[2024-06-01 04:26:15] [INFO ] Deduced a trap composed of 42 places in 426 ms of which 4 ms to minimize.
[2024-06-01 04:26:15] [INFO ] Deduced a trap composed of 27 places in 367 ms of which 4 ms to minimize.
[2024-06-01 04:26:15] [INFO ] Deduced a trap composed of 38 places in 412 ms of which 4 ms to minimize.
[2024-06-01 04:26:16] [INFO ] Deduced a trap composed of 31 places in 375 ms of which 4 ms to minimize.
[2024-06-01 04:26:16] [INFO ] Deduced a trap composed of 31 places in 348 ms of which 3 ms to minimize.
[2024-06-01 04:26:17] [INFO ] Deduced a trap composed of 44 places in 452 ms of which 5 ms to minimize.
[2024-06-01 04:26:17] [INFO ] Deduced a trap composed of 40 places in 452 ms of which 4 ms to minimize.
[2024-06-01 04:26:18] [INFO ] Deduced a trap composed of 45 places in 441 ms of which 4 ms to minimize.
[2024-06-01 04:26:18] [INFO ] Deduced a trap composed of 46 places in 416 ms of which 4 ms to minimize.
[2024-06-01 04:26:19] [INFO ] Deduced a trap composed of 47 places in 413 ms of which 3 ms to minimize.
[2024-06-01 04:26:19] [INFO ] Deduced a trap composed of 44 places in 395 ms of which 4 ms to minimize.
[2024-06-01 04:26:20] [INFO ] Deduced a trap composed of 40 places in 402 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 263/853 variables, and 52 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 589 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 04:26:28] [INFO ] Deduced a trap composed of 31 places in 438 ms of which 4 ms to minimize.
[2024-06-01 04:26:28] [INFO ] Deduced a trap composed of 31 places in 401 ms of which 5 ms to minimize.
[2024-06-01 04:26:29] [INFO ] Deduced a trap composed of 31 places in 369 ms of which 4 ms to minimize.
[2024-06-01 04:26:29] [INFO ] Deduced a trap composed of 32 places in 346 ms of which 4 ms to minimize.
[2024-06-01 04:26:30] [INFO ] Deduced a trap composed of 38 places in 282 ms of which 2 ms to minimize.
[2024-06-01 04:26:30] [INFO ] Deduced a trap composed of 52 places in 322 ms of which 2 ms to minimize.
[2024-06-01 04:26:30] [INFO ] Deduced a trap composed of 43 places in 297 ms of which 3 ms to minimize.
[2024-06-01 04:26:30] [INFO ] Deduced a trap composed of 41 places in 319 ms of which 3 ms to minimize.
[2024-06-01 04:26:31] [INFO ] Deduced a trap composed of 45 places in 259 ms of which 3 ms to minimize.
[2024-06-01 04:26:31] [INFO ] Deduced a trap composed of 46 places in 262 ms of which 4 ms to minimize.
[2024-06-01 04:26:31] [INFO ] Deduced a trap composed of 38 places in 274 ms of which 3 ms to minimize.
[2024-06-01 04:26:32] [INFO ] Deduced a trap composed of 46 places in 221 ms of which 2 ms to minimize.
[2024-06-01 04:26:32] [INFO ] Deduced a trap composed of 44 places in 206 ms of which 2 ms to minimize.
[2024-06-01 04:26:32] [INFO ] Deduced a trap composed of 42 places in 219 ms of which 3 ms to minimize.
[2024-06-01 04:26:33] [INFO ] Deduced a trap composed of 46 places in 151 ms of which 2 ms to minimize.
[2024-06-01 04:26:33] [INFO ] Deduced a trap composed of 46 places in 188 ms of which 2 ms to minimize.
[2024-06-01 04:26:33] [INFO ] Deduced a trap composed of 45 places in 176 ms of which 2 ms to minimize.
[2024-06-01 04:26:34] [INFO ] Deduced a trap composed of 52 places in 273 ms of which 6 ms to minimize.
[2024-06-01 04:26:34] [INFO ] Deduced a trap composed of 43 places in 288 ms of which 3 ms to minimize.
[2024-06-01 04:26:34] [INFO ] Deduced a trap composed of 38 places in 311 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 04:26:35] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 2 ms to minimize.
[2024-06-01 04:26:37] [INFO ] Deduced a trap composed of 41 places in 370 ms of which 3 ms to minimize.
[2024-06-01 04:26:37] [INFO ] Deduced a trap composed of 40 places in 415 ms of which 4 ms to minimize.
[2024-06-01 04:26:38] [INFO ] Deduced a trap composed of 41 places in 362 ms of which 4 ms to minimize.
[2024-06-01 04:26:38] [INFO ] Deduced a trap composed of 42 places in 325 ms of which 3 ms to minimize.
[2024-06-01 04:26:39] [INFO ] Deduced a trap composed of 52 places in 401 ms of which 4 ms to minimize.
[2024-06-01 04:26:40] [INFO ] Deduced a trap composed of 31 places in 364 ms of which 4 ms to minimize.
[2024-06-01 04:26:40] [INFO ] Deduced a trap composed of 42 places in 285 ms of which 3 ms to minimize.
[2024-06-01 04:26:41] [INFO ] Deduced a trap composed of 46 places in 279 ms of which 3 ms to minimize.
[2024-06-01 04:26:41] [INFO ] Deduced a trap composed of 42 places in 250 ms of which 3 ms to minimize.
[2024-06-01 04:26:41] [INFO ] Deduced a trap composed of 58 places in 399 ms of which 4 ms to minimize.
[2024-06-01 04:26:42] [INFO ] Deduced a trap composed of 56 places in 405 ms of which 4 ms to minimize.
[2024-06-01 04:26:43] [INFO ] Deduced a trap composed of 26 places in 421 ms of which 4 ms to minimize.
[2024-06-01 04:26:43] [INFO ] Deduced a trap composed of 5 places in 310 ms of which 3 ms to minimize.
[2024-06-01 04:26:44] [INFO ] Deduced a trap composed of 10 places in 435 ms of which 4 ms to minimize.
[2024-06-01 04:26:44] [INFO ] Deduced a trap composed of 15 places in 304 ms of which 3 ms to minimize.
[2024-06-01 04:26:44] [INFO ] Deduced a trap composed of 28 places in 413 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 17/89 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/853 variables, and 89 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 0/589 constraints, Known Traps: 77/77 constraints]
After SMT, in 61975ms problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 61988ms
Starting structural reductions in LTL mode, iteration 1 : 263/285 places, 590/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62969 ms. Remains : 263/285 places, 590/808 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-08 finished in 63193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 269 transition count 792
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 269 transition count 792
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 228 place count 269 transition count 596
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 233 place count 264 transition count 591
Iterating global reduction 1 with 5 rules applied. Total rules applied 238 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 239 place count 263 transition count 590
Iterating global reduction 1 with 1 rules applied. Total rules applied 240 place count 263 transition count 590
Applied a total of 240 rules in 29 ms. Remains 263 /285 variables (removed 22) and now considering 590/808 (removed 218) transitions.
[2024-06-01 04:26:50] [INFO ] Invariant cache hit.
[2024-06-01 04:26:50] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-06-01 04:26:50] [INFO ] Invariant cache hit.
[2024-06-01 04:26:51] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 923 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2024-06-01 04:26:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 04:27:03] [INFO ] Deduced a trap composed of 17 places in 510 ms of which 4 ms to minimize.
[2024-06-01 04:27:04] [INFO ] Deduced a trap composed of 35 places in 356 ms of which 3 ms to minimize.
[2024-06-01 04:27:04] [INFO ] Deduced a trap composed of 37 places in 263 ms of which 3 ms to minimize.
[2024-06-01 04:27:04] [INFO ] Deduced a trap composed of 34 places in 248 ms of which 3 ms to minimize.
[2024-06-01 04:27:05] [INFO ] Deduced a trap composed of 25 places in 393 ms of which 4 ms to minimize.
[2024-06-01 04:27:05] [INFO ] Deduced a trap composed of 14 places in 416 ms of which 4 ms to minimize.
[2024-06-01 04:27:06] [INFO ] Deduced a trap composed of 36 places in 384 ms of which 4 ms to minimize.
[2024-06-01 04:27:06] [INFO ] Deduced a trap composed of 35 places in 434 ms of which 4 ms to minimize.
[2024-06-01 04:27:07] [INFO ] Deduced a trap composed of 36 places in 413 ms of which 4 ms to minimize.
[2024-06-01 04:27:07] [INFO ] Deduced a trap composed of 42 places in 415 ms of which 4 ms to minimize.
[2024-06-01 04:27:07] [INFO ] Deduced a trap composed of 36 places in 437 ms of which 4 ms to minimize.
[2024-06-01 04:27:08] [INFO ] Deduced a trap composed of 36 places in 428 ms of which 4 ms to minimize.
[2024-06-01 04:27:08] [INFO ] Deduced a trap composed of 49 places in 359 ms of which 4 ms to minimize.
[2024-06-01 04:27:09] [INFO ] Deduced a trap composed of 18 places in 317 ms of which 2 ms to minimize.
[2024-06-01 04:27:09] [INFO ] Deduced a trap composed of 24 places in 340 ms of which 4 ms to minimize.
[2024-06-01 04:27:10] [INFO ] Deduced a trap composed of 31 places in 427 ms of which 4 ms to minimize.
[2024-06-01 04:27:10] [INFO ] Deduced a trap composed of 41 places in 386 ms of which 4 ms to minimize.
[2024-06-01 04:27:11] [INFO ] Deduced a trap composed of 42 places in 323 ms of which 3 ms to minimize.
[2024-06-01 04:27:11] [INFO ] Deduced a trap composed of 43 places in 331 ms of which 3 ms to minimize.
[2024-06-01 04:27:11] [INFO ] Deduced a trap composed of 41 places in 293 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 04:27:12] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 2 ms to minimize.
[2024-06-01 04:27:13] [INFO ] Deduced a trap composed of 24 places in 482 ms of which 4 ms to minimize.
[2024-06-01 04:27:14] [INFO ] Deduced a trap composed of 75 places in 451 ms of which 4 ms to minimize.
[2024-06-01 04:27:14] [INFO ] Deduced a trap composed of 43 places in 436 ms of which 4 ms to minimize.
[2024-06-01 04:27:15] [INFO ] Deduced a trap composed of 59 places in 262 ms of which 2 ms to minimize.
[2024-06-01 04:27:15] [INFO ] Deduced a trap composed of 39 places in 383 ms of which 4 ms to minimize.
[2024-06-01 04:27:15] [INFO ] Deduced a trap composed of 31 places in 404 ms of which 4 ms to minimize.
[2024-06-01 04:27:16] [INFO ] Deduced a trap composed of 22 places in 308 ms of which 3 ms to minimize.
[2024-06-01 04:27:16] [INFO ] Deduced a trap composed of 42 places in 309 ms of which 2 ms to minimize.
[2024-06-01 04:27:16] [INFO ] Deduced a trap composed of 27 places in 326 ms of which 3 ms to minimize.
[2024-06-01 04:27:17] [INFO ] Deduced a trap composed of 38 places in 300 ms of which 2 ms to minimize.
[2024-06-01 04:27:17] [INFO ] Deduced a trap composed of 31 places in 252 ms of which 2 ms to minimize.
[2024-06-01 04:27:17] [INFO ] Deduced a trap composed of 31 places in 255 ms of which 2 ms to minimize.
[2024-06-01 04:27:18] [INFO ] Deduced a trap composed of 44 places in 349 ms of which 3 ms to minimize.
[2024-06-01 04:27:18] [INFO ] Deduced a trap composed of 40 places in 327 ms of which 2 ms to minimize.
[2024-06-01 04:27:19] [INFO ] Deduced a trap composed of 45 places in 356 ms of which 3 ms to minimize.
[2024-06-01 04:27:19] [INFO ] Deduced a trap composed of 46 places in 350 ms of which 4 ms to minimize.
[2024-06-01 04:27:19] [INFO ] Deduced a trap composed of 47 places in 316 ms of which 3 ms to minimize.
[2024-06-01 04:27:20] [INFO ] Deduced a trap composed of 44 places in 323 ms of which 3 ms to minimize.
[2024-06-01 04:27:20] [INFO ] Deduced a trap composed of 40 places in 332 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 263/853 variables, and 52 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 589 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 04:27:28] [INFO ] Deduced a trap composed of 31 places in 241 ms of which 2 ms to minimize.
[2024-06-01 04:27:28] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 3 ms to minimize.
[2024-06-01 04:27:28] [INFO ] Deduced a trap composed of 31 places in 431 ms of which 3 ms to minimize.
[2024-06-01 04:27:29] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 3 ms to minimize.
[2024-06-01 04:27:29] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 2 ms to minimize.
[2024-06-01 04:27:29] [INFO ] Deduced a trap composed of 52 places in 292 ms of which 4 ms to minimize.
[2024-06-01 04:27:30] [INFO ] Deduced a trap composed of 43 places in 267 ms of which 2 ms to minimize.
[2024-06-01 04:27:30] [INFO ] Deduced a trap composed of 41 places in 235 ms of which 2 ms to minimize.
[2024-06-01 04:27:30] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 2 ms to minimize.
[2024-06-01 04:27:30] [INFO ] Deduced a trap composed of 46 places in 164 ms of which 2 ms to minimize.
[2024-06-01 04:27:30] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 1 ms to minimize.
[2024-06-01 04:27:31] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 2 ms to minimize.
[2024-06-01 04:27:31] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 1 ms to minimize.
[2024-06-01 04:27:31] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 1 ms to minimize.
[2024-06-01 04:27:31] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 2 ms to minimize.
[2024-06-01 04:27:31] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 1 ms to minimize.
[2024-06-01 04:27:32] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 2 ms to minimize.
[2024-06-01 04:27:32] [INFO ] Deduced a trap composed of 52 places in 188 ms of which 2 ms to minimize.
[2024-06-01 04:27:32] [INFO ] Deduced a trap composed of 43 places in 190 ms of which 2 ms to minimize.
[2024-06-01 04:27:32] [INFO ] Deduced a trap composed of 38 places in 188 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 04:27:33] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
[2024-06-01 04:27:34] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 2 ms to minimize.
[2024-06-01 04:27:34] [INFO ] Deduced a trap composed of 40 places in 244 ms of which 3 ms to minimize.
[2024-06-01 04:27:35] [INFO ] Deduced a trap composed of 41 places in 246 ms of which 3 ms to minimize.
[2024-06-01 04:27:35] [INFO ] Deduced a trap composed of 42 places in 191 ms of which 2 ms to minimize.
[2024-06-01 04:27:35] [INFO ] Deduced a trap composed of 52 places in 227 ms of which 2 ms to minimize.
[2024-06-01 04:27:36] [INFO ] Deduced a trap composed of 31 places in 231 ms of which 2 ms to minimize.
[2024-06-01 04:27:36] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 3 ms to minimize.
[2024-06-01 04:27:36] [INFO ] Deduced a trap composed of 46 places in 183 ms of which 2 ms to minimize.
[2024-06-01 04:27:37] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 2 ms to minimize.
[2024-06-01 04:27:37] [INFO ] Deduced a trap composed of 58 places in 234 ms of which 3 ms to minimize.
[2024-06-01 04:27:37] [INFO ] Deduced a trap composed of 56 places in 229 ms of which 3 ms to minimize.
[2024-06-01 04:27:38] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 2 ms to minimize.
[2024-06-01 04:27:38] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 2 ms to minimize.
[2024-06-01 04:27:38] [INFO ] Deduced a trap composed of 10 places in 257 ms of which 2 ms to minimize.
[2024-06-01 04:27:38] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 2 ms to minimize.
[2024-06-01 04:27:39] [INFO ] Deduced a trap composed of 28 places in 247 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 17/89 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 04:27:43] [INFO ] Deduced a trap composed of 31 places in 208 ms of which 2 ms to minimize.
[2024-06-01 04:27:43] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 3 ms to minimize.
[2024-06-01 04:27:44] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 2 ms to minimize.
[2024-06-01 04:27:44] [INFO ] Deduced a trap composed of 46 places in 140 ms of which 2 ms to minimize.
[2024-06-01 04:27:44] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 2 ms to minimize.
[2024-06-01 04:27:44] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 2 ms to minimize.
[2024-06-01 04:27:44] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 2 ms to minimize.
[2024-06-01 04:27:45] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 2 ms to minimize.
[2024-06-01 04:27:45] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 2 ms to minimize.
[2024-06-01 04:27:45] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 1 ms to minimize.
[2024-06-01 04:27:45] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 3 ms to minimize.
[2024-06-01 04:27:46] [INFO ] Deduced a trap composed of 31 places in 301 ms of which 2 ms to minimize.
[2024-06-01 04:27:46] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 2 ms to minimize.
[2024-06-01 04:27:46] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 1 ms to minimize.
[2024-06-01 04:27:46] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 15/104 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 04:27:52] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 2 ms to minimize.
[2024-06-01 04:27:52] [INFO ] Deduced a trap composed of 24 places in 253 ms of which 3 ms to minimize.
[2024-06-01 04:27:52] [INFO ] Deduced a trap composed of 25 places in 226 ms of which 2 ms to minimize.
[2024-06-01 04:27:53] [INFO ] Deduced a trap composed of 45 places in 217 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/853 variables, and 108 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 0/589 constraints, Known Traps: 96/96 constraints]
After SMT, in 61931ms problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 61943ms
Starting structural reductions in LTL mode, iteration 1 : 263/285 places, 590/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62899 ms. Remains : 263/285 places, 590/808 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-09 finished in 63007 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((F(p0)&&X(p1))))'
Support contains 4 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 270 transition count 793
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 270 transition count 793
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 226 place count 270 transition count 597
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 231 place count 265 transition count 592
Iterating global reduction 1 with 5 rules applied. Total rules applied 236 place count 265 transition count 592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 237 place count 264 transition count 591
Iterating global reduction 1 with 1 rules applied. Total rules applied 238 place count 264 transition count 591
Applied a total of 238 rules in 19 ms. Remains 264 /285 variables (removed 21) and now considering 591/808 (removed 217) transitions.
// Phase 1: matrix 591 rows 264 cols
[2024-06-01 04:27:53] [INFO ] Computed 12 invariants in 4 ms
[2024-06-01 04:27:53] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-06-01 04:27:53] [INFO ] Invariant cache hit.
[2024-06-01 04:27:54] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
Running 590 sub problems to find dead transitions.
[2024-06-01 04:27:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 04:28:03] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 3 ms to minimize.
[2024-06-01 04:28:03] [INFO ] Deduced a trap composed of 20 places in 274 ms of which 2 ms to minimize.
[2024-06-01 04:28:03] [INFO ] Deduced a trap composed of 14 places in 274 ms of which 3 ms to minimize.
[2024-06-01 04:28:04] [INFO ] Deduced a trap composed of 51 places in 267 ms of which 2 ms to minimize.
[2024-06-01 04:28:04] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2024-06-01 04:28:04] [INFO ] Deduced a trap composed of 19 places in 285 ms of which 4 ms to minimize.
[2024-06-01 04:28:04] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 2 ms to minimize.
[2024-06-01 04:28:05] [INFO ] Deduced a trap composed of 63 places in 269 ms of which 3 ms to minimize.
[2024-06-01 04:28:05] [INFO ] Deduced a trap composed of 22 places in 259 ms of which 2 ms to minimize.
[2024-06-01 04:28:05] [INFO ] Deduced a trap composed of 25 places in 297 ms of which 3 ms to minimize.
[2024-06-01 04:28:06] [INFO ] Deduced a trap composed of 40 places in 271 ms of which 2 ms to minimize.
[2024-06-01 04:28:06] [INFO ] Deduced a trap composed of 41 places in 270 ms of which 3 ms to minimize.
[2024-06-01 04:28:06] [INFO ] Deduced a trap composed of 43 places in 265 ms of which 3 ms to minimize.
[2024-06-01 04:28:06] [INFO ] Deduced a trap composed of 43 places in 270 ms of which 3 ms to minimize.
[2024-06-01 04:28:07] [INFO ] Deduced a trap composed of 45 places in 283 ms of which 2 ms to minimize.
[2024-06-01 04:28:07] [INFO ] Deduced a trap composed of 42 places in 278 ms of which 3 ms to minimize.
[2024-06-01 04:28:07] [INFO ] Deduced a trap composed of 46 places in 278 ms of which 2 ms to minimize.
[2024-06-01 04:28:08] [INFO ] Deduced a trap composed of 31 places in 273 ms of which 3 ms to minimize.
[2024-06-01 04:28:08] [INFO ] Deduced a trap composed of 27 places in 271 ms of which 3 ms to minimize.
[2024-06-01 04:28:08] [INFO ] Deduced a trap composed of 45 places in 263 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 04:28:09] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 3 ms to minimize.
[2024-06-01 04:28:09] [INFO ] Deduced a trap composed of 48 places in 261 ms of which 2 ms to minimize.
[2024-06-01 04:28:09] [INFO ] Deduced a trap composed of 55 places in 265 ms of which 3 ms to minimize.
[2024-06-01 04:28:09] [INFO ] Deduced a trap composed of 35 places in 249 ms of which 3 ms to minimize.
[2024-06-01 04:28:10] [INFO ] Deduced a trap composed of 39 places in 246 ms of which 2 ms to minimize.
[2024-06-01 04:28:10] [INFO ] Deduced a trap composed of 46 places in 249 ms of which 2 ms to minimize.
[2024-06-01 04:28:10] [INFO ] Deduced a trap composed of 40 places in 257 ms of which 3 ms to minimize.
[2024-06-01 04:28:11] [INFO ] Deduced a trap composed of 41 places in 258 ms of which 2 ms to minimize.
[2024-06-01 04:28:11] [INFO ] Deduced a trap composed of 37 places in 247 ms of which 2 ms to minimize.
[2024-06-01 04:28:11] [INFO ] Deduced a trap composed of 50 places in 266 ms of which 2 ms to minimize.
[2024-06-01 04:28:12] [INFO ] Deduced a trap composed of 60 places in 257 ms of which 2 ms to minimize.
[2024-06-01 04:28:12] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 2 ms to minimize.
[2024-06-01 04:28:12] [INFO ] Deduced a trap composed of 45 places in 243 ms of which 3 ms to minimize.
[2024-06-01 04:28:13] [INFO ] Deduced a trap composed of 48 places in 240 ms of which 3 ms to minimize.
[2024-06-01 04:28:13] [INFO ] Deduced a trap composed of 45 places in 273 ms of which 2 ms to minimize.
[2024-06-01 04:28:13] [INFO ] Deduced a trap composed of 43 places in 270 ms of which 3 ms to minimize.
[2024-06-01 04:28:14] [INFO ] Deduced a trap composed of 53 places in 270 ms of which 3 ms to minimize.
[2024-06-01 04:28:14] [INFO ] Deduced a trap composed of 52 places in 327 ms of which 2 ms to minimize.
[2024-06-01 04:28:14] [INFO ] Deduced a trap composed of 44 places in 206 ms of which 3 ms to minimize.
[2024-06-01 04:28:14] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 04:28:18] [INFO ] Deduced a trap composed of 45 places in 231 ms of which 2 ms to minimize.
[2024-06-01 04:28:18] [INFO ] Deduced a trap composed of 49 places in 252 ms of which 3 ms to minimize.
[2024-06-01 04:28:19] [INFO ] Deduced a trap composed of 45 places in 237 ms of which 2 ms to minimize.
[2024-06-01 04:28:19] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 2 ms to minimize.
[2024-06-01 04:28:20] [INFO ] Deduced a trap composed of 44 places in 191 ms of which 2 ms to minimize.
[2024-06-01 04:28:20] [INFO ] Deduced a trap composed of 50 places in 196 ms of which 1 ms to minimize.
[2024-06-01 04:28:20] [INFO ] Deduced a trap composed of 52 places in 197 ms of which 2 ms to minimize.
[2024-06-01 04:28:20] [INFO ] Deduced a trap composed of 31 places in 249 ms of which 3 ms to minimize.
[2024-06-01 04:28:21] [INFO ] Deduced a trap composed of 31 places in 266 ms of which 3 ms to minimize.
[2024-06-01 04:28:21] [INFO ] Deduced a trap composed of 31 places in 256 ms of which 3 ms to minimize.
[2024-06-01 04:28:21] [INFO ] Deduced a trap composed of 31 places in 240 ms of which 3 ms to minimize.
[2024-06-01 04:28:22] [INFO ] Deduced a trap composed of 38 places in 231 ms of which 3 ms to minimize.
[2024-06-01 04:28:22] [INFO ] Deduced a trap composed of 40 places in 242 ms of which 2 ms to minimize.
[2024-06-01 04:28:22] [INFO ] Deduced a trap composed of 31 places in 230 ms of which 2 ms to minimize.
[2024-06-01 04:28:22] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 2 ms to minimize.
[2024-06-01 04:28:22] [INFO ] Deduced a trap composed of 46 places in 173 ms of which 2 ms to minimize.
[2024-06-01 04:28:23] [INFO ] Deduced a trap composed of 31 places in 243 ms of which 3 ms to minimize.
[2024-06-01 04:28:23] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 2 ms to minimize.
[2024-06-01 04:28:23] [INFO ] Deduced a trap composed of 52 places in 177 ms of which 2 ms to minimize.
[2024-06-01 04:28:24] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 04:28:24] [INFO ] Deduced a trap composed of 45 places in 233 ms of which 2 ms to minimize.
[2024-06-01 04:28:24] [INFO ] Deduced a trap composed of 41 places in 218 ms of which 2 ms to minimize.
[2024-06-01 04:28:25] [INFO ] Deduced a trap composed of 38 places in 245 ms of which 3 ms to minimize.
[2024-06-01 04:28:25] [INFO ] Deduced a trap composed of 36 places in 249 ms of which 3 ms to minimize.
[2024-06-01 04:28:25] [INFO ] Deduced a trap composed of 44 places in 223 ms of which 3 ms to minimize.
[2024-06-01 04:28:26] [INFO ] Deduced a trap composed of 45 places in 216 ms of which 3 ms to minimize.
SMT process timed out in 31750ms, After SMT, problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 31756ms
Starting structural reductions in LTL mode, iteration 1 : 264/285 places, 591/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32391 ms. Remains : 264/285 places, 591/808 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 122 ms.
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Computed a total of 42 stabilizing places and 43 stable transitions
Computed a total of 42 stabilizing places and 43 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 14 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-07b-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07b-LTLCardinality-10 finished in 32817 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Graph (trivial) has 268 edges and 285 vertex of which 4 / 285 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 111 place count 282 transition count 695
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 150 rules applied. Total rules applied 261 place count 172 transition count 655
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 285 place count 148 transition count 655
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 285 place count 148 transition count 650
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 295 place count 143 transition count 650
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 306 place count 132 transition count 639
Iterating global reduction 3 with 11 rules applied. Total rules applied 317 place count 132 transition count 639
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 3 with 196 rules applied. Total rules applied 513 place count 132 transition count 443
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 513 place count 132 transition count 442
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 515 place count 131 transition count 442
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 517 place count 129 transition count 434
Iterating global reduction 4 with 2 rules applied. Total rules applied 519 place count 129 transition count 434
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 521 place count 129 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 522 place count 128 transition count 432
Performed 55 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 6 with 110 rules applied. Total rules applied 632 place count 73 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 633 place count 73 transition count 375
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 646 place count 60 transition count 277
Iterating global reduction 7 with 13 rules applied. Total rules applied 659 place count 60 transition count 277
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 665 place count 60 transition count 271
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 667 place count 59 transition count 270
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 669 place count 57 transition count 268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 670 place count 56 transition count 268
Applied a total of 670 rules in 65 ms. Remains 56 /285 variables (removed 229) and now considering 268/808 (removed 540) transitions.
// Phase 1: matrix 268 rows 56 cols
[2024-06-01 04:28:26] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 04:28:26] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-01 04:28:26] [INFO ] Invariant cache hit.
[2024-06-01 04:28:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 04:28:26] [INFO ] Implicit Places using invariants and state equation in 208 ms returned [51, 55]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 325 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/285 places, 268/808 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 53 transition count 267
Applied a total of 2 rules in 9 ms. Remains 53 /54 variables (removed 1) and now considering 267/268 (removed 1) transitions.
// Phase 1: matrix 267 rows 53 cols
[2024-06-01 04:28:26] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 04:28:26] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-01 04:28:26] [INFO ] Invariant cache hit.
[2024-06-01 04:28:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:28:27] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/285 places, 267/808 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 701 ms. Remains : 53/285 places, 267/808 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-11
Product exploration explored 100000 steps with 41 reset in 58 ms.
Product exploration explored 100000 steps with 144 reset in 73 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 169 steps (9 resets) in 5 ms. (28 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 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 267/267 transitions.
Applied a total of 0 rules in 7 ms. Remains 53 /53 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-06-01 04:28:27] [INFO ] Invariant cache hit.
[2024-06-01 04:28:27] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-01 04:28:27] [INFO ] Invariant cache hit.
[2024-06-01 04:28:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:28:28] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-06-01 04:28:28] [INFO ] Redundant transitions in 16 ms returned [263]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 264 sub problems to find dead transitions.
// Phase 1: matrix 266 rows 53 cols
[2024-06-01 04:28:28] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 04:28:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (OVERLAPS) 265/317 variables, 52/60 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-01 04:28:30] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 1 ms to minimize.
[2024-06-01 04:28:32] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (OVERLAPS) 1/318 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 1/319 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (OVERLAPS) 0/319 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 64 constraints, problems are : Problem set: 0 solved, 264 unsolved in 11501 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 265/317 variables, 52/62 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 264/326 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 1/318 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 1/319 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/319 variables, and 328 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 2/2 constraints]
After SMT, in 42528ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 42531ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/53 places, 266/267 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 51 transition count 264
Applied a total of 2 rules in 9 ms. Remains 51 /53 variables (removed 2) and now considering 264/266 (removed 2) transitions.
// Phase 1: matrix 264 rows 51 cols
[2024-06-01 04:29:10] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 04:29:10] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-01 04:29:10] [INFO ] Invariant cache hit.
[2024-06-01 04:29:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:29:10] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/53 places, 264/267 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 43204 ms. Remains : 51/53 places, 264/267 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 118 steps (5 resets) in 6 ms. (16 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 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 55 ms.
Product exploration explored 100000 steps with 79 reset in 75 ms.
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 264/264 transitions.
Applied a total of 0 rules in 7 ms. Remains 51 /51 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-06-01 04:29:11] [INFO ] Invariant cache hit.
[2024-06-01 04:29:11] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-01 04:29:11] [INFO ] Invariant cache hit.
[2024-06-01 04:29:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:29:11] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2024-06-01 04:29:12] [INFO ] Redundant transitions in 15 ms returned []
Running 263 sub problems to find dead transitions.
[2024-06-01 04:29:12] [INFO ] Invariant cache hit.
[2024-06-01 04:29:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (OVERLAPS) 263/314 variables, 51/59 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:29:14] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 1/315 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:29:18] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 0/315 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 62 constraints, problems are : Problem set: 0 solved, 263 unsolved in 10179 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 263/314 variables, 51/61 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 263/324 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 1/315 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 0/315 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 325 constraints, problems are : Problem set: 0 solved, 263 unsolved in 28318 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
After SMT, in 39477ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 39481ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39849 ms. Remains : 51/51 places, 264/264 transitions.
Treatment of property AutonomousCar-PT-07b-LTLCardinality-11 finished in 85121 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||p0)))'
Support contains 4 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 270 transition count 793
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 270 transition count 793
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 226 place count 270 transition count 597
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 230 place count 266 transition count 593
Iterating global reduction 1 with 4 rules applied. Total rules applied 234 place count 266 transition count 593
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 235 place count 265 transition count 592
Iterating global reduction 1 with 1 rules applied. Total rules applied 236 place count 265 transition count 592
Applied a total of 236 rules in 17 ms. Remains 265 /285 variables (removed 20) and now considering 592/808 (removed 216) transitions.
// Phase 1: matrix 592 rows 265 cols
[2024-06-01 04:29:51] [INFO ] Computed 12 invariants in 3 ms
[2024-06-01 04:29:51] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-01 04:29:51] [INFO ] Invariant cache hit.
[2024-06-01 04:29:52] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2024-06-01 04:29:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 04:30:01] [INFO ] Deduced a trap composed of 17 places in 311 ms of which 3 ms to minimize.
[2024-06-01 04:30:01] [INFO ] Deduced a trap composed of 40 places in 272 ms of which 2 ms to minimize.
[2024-06-01 04:30:01] [INFO ] Deduced a trap composed of 18 places in 262 ms of which 3 ms to minimize.
[2024-06-01 04:30:01] [INFO ] Deduced a trap composed of 37 places in 271 ms of which 2 ms to minimize.
[2024-06-01 04:30:02] [INFO ] Deduced a trap composed of 38 places in 293 ms of which 3 ms to minimize.
[2024-06-01 04:30:02] [INFO ] Deduced a trap composed of 31 places in 267 ms of which 2 ms to minimize.
[2024-06-01 04:30:03] [INFO ] Deduced a trap composed of 14 places in 269 ms of which 3 ms to minimize.
[2024-06-01 04:30:03] [INFO ] Deduced a trap composed of 25 places in 284 ms of which 2 ms to minimize.
[2024-06-01 04:30:03] [INFO ] Deduced a trap composed of 36 places in 277 ms of which 2 ms to minimize.
[2024-06-01 04:30:03] [INFO ] Deduced a trap composed of 45 places in 273 ms of which 3 ms to minimize.
[2024-06-01 04:30:04] [INFO ] Deduced a trap composed of 40 places in 262 ms of which 3 ms to minimize.
[2024-06-01 04:30:04] [INFO ] Deduced a trap composed of 44 places in 256 ms of which 3 ms to minimize.
[2024-06-01 04:30:04] [INFO ] Deduced a trap composed of 46 places in 254 ms of which 2 ms to minimize.
[2024-06-01 04:30:04] [INFO ] Deduced a trap composed of 42 places in 254 ms of which 3 ms to minimize.
[2024-06-01 04:30:05] [INFO ] Deduced a trap composed of 41 places in 250 ms of which 2 ms to minimize.
[2024-06-01 04:30:05] [INFO ] Deduced a trap composed of 49 places in 265 ms of which 3 ms to minimize.
[2024-06-01 04:30:05] [INFO ] Deduced a trap composed of 31 places in 286 ms of which 3 ms to minimize.
[2024-06-01 04:30:06] [INFO ] Deduced a trap composed of 41 places in 256 ms of which 2 ms to minimize.
[2024-06-01 04:30:06] [INFO ] Deduced a trap composed of 58 places in 233 ms of which 2 ms to minimize.
[2024-06-01 04:30:06] [INFO ] Deduced a trap composed of 40 places in 228 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 04:30:07] [INFO ] Deduced a trap composed of 40 places in 314 ms of which 2 ms to minimize.
[2024-06-01 04:30:07] [INFO ] Deduced a trap composed of 54 places in 292 ms of which 3 ms to minimize.
[2024-06-01 04:30:07] [INFO ] Deduced a trap composed of 40 places in 245 ms of which 2 ms to minimize.
[2024-06-01 04:30:08] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 2 ms to minimize.
[2024-06-01 04:30:08] [INFO ] Deduced a trap composed of 39 places in 240 ms of which 2 ms to minimize.
[2024-06-01 04:30:08] [INFO ] Deduced a trap composed of 27 places in 232 ms of which 2 ms to minimize.
[2024-06-01 04:30:08] [INFO ] Deduced a trap composed of 39 places in 232 ms of which 2 ms to minimize.
[2024-06-01 04:30:09] [INFO ] Deduced a trap composed of 51 places in 230 ms of which 2 ms to minimize.
[2024-06-01 04:30:09] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 3 ms to minimize.
[2024-06-01 04:30:09] [INFO ] Deduced a trap composed of 23 places in 258 ms of which 3 ms to minimize.
[2024-06-01 04:30:10] [INFO ] Deduced a trap composed of 22 places in 257 ms of which 3 ms to minimize.
[2024-06-01 04:30:10] [INFO ] Deduced a trap composed of 45 places in 258 ms of which 3 ms to minimize.
[2024-06-01 04:30:10] [INFO ] Deduced a trap composed of 62 places in 259 ms of which 3 ms to minimize.
[2024-06-01 04:30:10] [INFO ] Deduced a trap composed of 46 places in 245 ms of which 2 ms to minimize.
[2024-06-01 04:30:11] [INFO ] Deduced a trap composed of 45 places in 249 ms of which 3 ms to minimize.
[2024-06-01 04:30:11] [INFO ] Deduced a trap composed of 41 places in 250 ms of which 3 ms to minimize.
[2024-06-01 04:30:11] [INFO ] Deduced a trap composed of 43 places in 232 ms of which 2 ms to minimize.
[2024-06-01 04:30:12] [INFO ] Deduced a trap composed of 40 places in 228 ms of which 2 ms to minimize.
[2024-06-01 04:30:12] [INFO ] Deduced a trap composed of 42 places in 245 ms of which 2 ms to minimize.
[2024-06-01 04:30:12] [INFO ] Deduced a trap composed of 42 places in 220 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 04:30:16] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 2 ms to minimize.
[2024-06-01 04:30:16] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 2 ms to minimize.
[2024-06-01 04:30:17] [INFO ] Deduced a trap composed of 52 places in 284 ms of which 2 ms to minimize.
[2024-06-01 04:30:17] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 2 ms to minimize.
[2024-06-01 04:30:18] [INFO ] Deduced a trap composed of 47 places in 224 ms of which 3 ms to minimize.
[2024-06-01 04:30:18] [INFO ] Deduced a trap composed of 31 places in 210 ms of which 2 ms to minimize.
[2024-06-01 04:30:18] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 2 ms to minimize.
[2024-06-01 04:30:18] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 2 ms to minimize.
[2024-06-01 04:30:18] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 2 ms to minimize.
[2024-06-01 04:30:18] [INFO ] Deduced a trap composed of 32 places in 194 ms of which 3 ms to minimize.
[2024-06-01 04:30:19] [INFO ] Deduced a trap composed of 36 places in 263 ms of which 2 ms to minimize.
[2024-06-01 04:30:20] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 2 ms to minimize.
[2024-06-01 04:30:20] [INFO ] Deduced a trap composed of 38 places in 207 ms of which 3 ms to minimize.
[2024-06-01 04:30:20] [INFO ] Deduced a trap composed of 31 places in 210 ms of which 3 ms to minimize.
[2024-06-01 04:30:20] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 2 ms to minimize.
[2024-06-01 04:30:21] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 2 ms to minimize.
[2024-06-01 04:30:21] [INFO ] Deduced a trap composed of 32 places in 189 ms of which 2 ms to minimize.
[2024-06-01 04:30:21] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 2 ms to minimize.
[2024-06-01 04:30:21] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 1 ms to minimize.
[2024-06-01 04:30:21] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 04:30:23] [INFO ] Deduced a trap composed of 42 places in 285 ms of which 3 ms to minimize.
[2024-06-01 04:30:23] [INFO ] Deduced a trap composed of 30 places in 256 ms of which 3 ms to minimize.
[2024-06-01 04:30:23] [INFO ] Deduced a trap composed of 43 places in 251 ms of which 3 ms to minimize.
[2024-06-01 04:30:23] [INFO ] Deduced a trap composed of 41 places in 241 ms of which 2 ms to minimize.
[2024-06-01 04:30:24] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 3 ms to minimize.
SMT process timed out in 31912ms, After SMT, problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 31918ms
Starting structural reductions in LTL mode, iteration 1 : 265/285 places, 592/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32558 ms. Remains : 265/285 places, 592/808 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 15932 steps with 152 reset in 32 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-12 finished in 32704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!(p0 U p1))||!(G(p0) U G(p2))||X(p3))))'
Support contains 7 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 272 transition count 795
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 272 transition count 795
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 222 place count 272 transition count 599
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 226 place count 268 transition count 595
Iterating global reduction 1 with 4 rules applied. Total rules applied 230 place count 268 transition count 595
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 231 place count 267 transition count 594
Iterating global reduction 1 with 1 rules applied. Total rules applied 232 place count 267 transition count 594
Applied a total of 232 rules in 19 ms. Remains 267 /285 variables (removed 18) and now considering 594/808 (removed 214) transitions.
// Phase 1: matrix 594 rows 267 cols
[2024-06-01 04:30:24] [INFO ] Computed 12 invariants in 2 ms
[2024-06-01 04:30:24] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-06-01 04:30:24] [INFO ] Invariant cache hit.
[2024-06-01 04:30:25] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
Running 593 sub problems to find dead transitions.
[2024-06-01 04:30:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-06-01 04:30:34] [INFO ] Deduced a trap composed of 17 places in 314 ms of which 3 ms to minimize.
[2024-06-01 04:30:34] [INFO ] Deduced a trap composed of 28 places in 260 ms of which 2 ms to minimize.
[2024-06-01 04:30:34] [INFO ] Deduced a trap composed of 36 places in 269 ms of which 2 ms to minimize.
[2024-06-01 04:30:34] [INFO ] Deduced a trap composed of 33 places in 297 ms of which 3 ms to minimize.
[2024-06-01 04:30:35] [INFO ] Deduced a trap composed of 37 places in 282 ms of which 3 ms to minimize.
[2024-06-01 04:30:35] [INFO ] Deduced a trap composed of 38 places in 281 ms of which 2 ms to minimize.
[2024-06-01 04:30:35] [INFO ] Deduced a trap composed of 39 places in 247 ms of which 2 ms to minimize.
[2024-06-01 04:30:36] [INFO ] Deduced a trap composed of 37 places in 265 ms of which 3 ms to minimize.
[2024-06-01 04:30:36] [INFO ] Deduced a trap composed of 46 places in 243 ms of which 3 ms to minimize.
[2024-06-01 04:30:36] [INFO ] Deduced a trap composed of 46 places in 247 ms of which 3 ms to minimize.
[2024-06-01 04:30:36] [INFO ] Deduced a trap composed of 28 places in 234 ms of which 2 ms to minimize.
[2024-06-01 04:30:37] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 2 ms to minimize.
[2024-06-01 04:30:37] [INFO ] Deduced a trap composed of 41 places in 238 ms of which 3 ms to minimize.
[2024-06-01 04:30:37] [INFO ] Deduced a trap composed of 40 places in 221 ms of which 2 ms to minimize.
[2024-06-01 04:30:37] [INFO ] Deduced a trap composed of 38 places in 216 ms of which 2 ms to minimize.
[2024-06-01 04:30:38] [INFO ] Deduced a trap composed of 41 places in 265 ms of which 2 ms to minimize.
[2024-06-01 04:30:38] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 3 ms to minimize.
[2024-06-01 04:30:38] [INFO ] Deduced a trap composed of 60 places in 271 ms of which 3 ms to minimize.
[2024-06-01 04:30:39] [INFO ] Deduced a trap composed of 31 places in 237 ms of which 2 ms to minimize.
[2024-06-01 04:30:39] [INFO ] Deduced a trap composed of 42 places in 252 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-06-01 04:30:40] [INFO ] Deduced a trap composed of 14 places in 283 ms of which 3 ms to minimize.
[2024-06-01 04:30:40] [INFO ] Deduced a trap composed of 41 places in 288 ms of which 2 ms to minimize.
[2024-06-01 04:30:40] [INFO ] Deduced a trap composed of 32 places in 287 ms of which 3 ms to minimize.
[2024-06-01 04:30:41] [INFO ] Deduced a trap composed of 32 places in 271 ms of which 2 ms to minimize.
[2024-06-01 04:30:41] [INFO ] Deduced a trap composed of 18 places in 249 ms of which 3 ms to minimize.
[2024-06-01 04:30:41] [INFO ] Deduced a trap composed of 24 places in 247 ms of which 2 ms to minimize.
[2024-06-01 04:30:42] [INFO ] Deduced a trap composed of 52 places in 267 ms of which 3 ms to minimize.
[2024-06-01 04:30:42] [INFO ] Deduced a trap composed of 40 places in 269 ms of which 3 ms to minimize.
[2024-06-01 04:30:42] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 2 ms to minimize.
[2024-06-01 04:30:43] [INFO ] Deduced a trap composed of 43 places in 232 ms of which 2 ms to minimize.
[2024-06-01 04:30:43] [INFO ] Deduced a trap composed of 46 places in 201 ms of which 4 ms to minimize.
[2024-06-01 04:30:43] [INFO ] Deduced a trap composed of 46 places in 220 ms of which 3 ms to minimize.
[2024-06-01 04:30:43] [INFO ] Deduced a trap composed of 49 places in 201 ms of which 2 ms to minimize.
[2024-06-01 04:30:43] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 1 ms to minimize.
[2024-06-01 04:30:44] [INFO ] Deduced a trap composed of 45 places in 189 ms of which 2 ms to minimize.
[2024-06-01 04:30:44] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 2 ms to minimize.
[2024-06-01 04:30:44] [INFO ] Deduced a trap composed of 47 places in 187 ms of which 2 ms to minimize.
[2024-06-01 04:30:44] [INFO ] Deduced a trap composed of 41 places in 249 ms of which 3 ms to minimize.
[2024-06-01 04:30:45] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 2 ms to minimize.
[2024-06-01 04:30:45] [INFO ] Deduced a trap composed of 45 places in 180 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-06-01 04:30:49] [INFO ] Deduced a trap composed of 26 places in 281 ms of which 2 ms to minimize.
[2024-06-01 04:30:49] [INFO ] Deduced a trap composed of 34 places in 273 ms of which 3 ms to minimize.
[2024-06-01 04:30:49] [INFO ] Deduced a trap composed of 51 places in 292 ms of which 2 ms to minimize.
[2024-06-01 04:30:50] [INFO ] Deduced a trap composed of 45 places in 259 ms of which 2 ms to minimize.
[2024-06-01 04:30:50] [INFO ] Deduced a trap composed of 42 places in 265 ms of which 3 ms to minimize.
[2024-06-01 04:30:51] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 2 ms to minimize.
[2024-06-01 04:30:51] [INFO ] Deduced a trap composed of 48 places in 264 ms of which 2 ms to minimize.
[2024-06-01 04:30:51] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 3 ms to minimize.
[2024-06-01 04:30:52] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 2 ms to minimize.
[2024-06-01 04:30:52] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 2 ms to minimize.
[2024-06-01 04:30:52] [INFO ] Deduced a trap composed of 57 places in 244 ms of which 2 ms to minimize.
[2024-06-01 04:30:52] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 2 ms to minimize.
[2024-06-01 04:30:53] [INFO ] Deduced a trap composed of 38 places in 235 ms of which 3 ms to minimize.
[2024-06-01 04:30:53] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 3 ms to minimize.
[2024-06-01 04:30:53] [INFO ] Deduced a trap composed of 45 places in 185 ms of which 2 ms to minimize.
[2024-06-01 04:30:54] [INFO ] Deduced a trap composed of 42 places in 192 ms of which 3 ms to minimize.
[2024-06-01 04:30:54] [INFO ] Deduced a trap composed of 46 places in 188 ms of which 2 ms to minimize.
[2024-06-01 04:30:54] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 1 ms to minimize.
[2024-06-01 04:30:54] [INFO ] Deduced a trap composed of 46 places in 160 ms of which 2 ms to minimize.
[2024-06-01 04:30:54] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-06-01 04:30:55] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 2 ms to minimize.
[2024-06-01 04:30:55] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 267/861 variables, and 74 constraints, problems are : Problem set: 0 solved, 593 unsolved in 30080 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/267 constraints, PredecessorRefiner: 593/593 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 593 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 62/74 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-06-01 04:31:01] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-01 04:31:01] [INFO ] Deduced a trap composed of 32 places in 215 ms of which 2 ms to minimize.
[2024-06-01 04:31:02] [INFO ] Deduced a trap composed of 40 places in 254 ms of which 3 ms to minimize.
[2024-06-01 04:31:02] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 2 ms to minimize.
[2024-06-01 04:31:02] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 2 ms to minimize.
[2024-06-01 04:31:03] [INFO ] Deduced a trap composed of 36 places in 259 ms of which 2 ms to minimize.
[2024-06-01 04:31:03] [INFO ] Deduced a trap composed of 52 places in 196 ms of which 2 ms to minimize.
[2024-06-01 04:31:03] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 2 ms to minimize.
[2024-06-01 04:31:04] [INFO ] Deduced a trap composed of 31 places in 242 ms of which 2 ms to minimize.
[2024-06-01 04:31:04] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 2 ms to minimize.
[2024-06-01 04:31:04] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 1 ms to minimize.
[2024-06-01 04:31:04] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 1 ms to minimize.
[2024-06-01 04:31:04] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 2 ms to minimize.
[2024-06-01 04:31:04] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 2 ms to minimize.
[2024-06-01 04:31:05] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 2 ms to minimize.
[2024-06-01 04:31:05] [INFO ] Deduced a trap composed of 32 places in 219 ms of which 3 ms to minimize.
[2024-06-01 04:31:06] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 2 ms to minimize.
[2024-06-01 04:31:06] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 18/92 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-06-01 04:31:10] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 2 ms to minimize.
[2024-06-01 04:31:11] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 2 ms to minimize.
[2024-06-01 04:31:11] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 2 ms to minimize.
[2024-06-01 04:31:11] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 2 ms to minimize.
[2024-06-01 04:31:11] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 2 ms to minimize.
[2024-06-01 04:31:12] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 2 ms to minimize.
[2024-06-01 04:31:12] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 2 ms to minimize.
[2024-06-01 04:31:12] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 2 ms to minimize.
[2024-06-01 04:31:13] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 2 ms to minimize.
[2024-06-01 04:31:13] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 2 ms to minimize.
[2024-06-01 04:31:13] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 1 ms to minimize.
[2024-06-01 04:31:13] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 12/104 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 593 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD455 is UNSAT
At refinement iteration 6 (OVERLAPS) 594/861 variables, 267/371 constraints. Problems are: Problem set: 2 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 861/861 variables, and 962 constraints, problems are : Problem set: 2 solved, 591 unsolved in 30100 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 591/593 constraints, Known Traps: 92/92 constraints]
After SMT, in 61803ms problems are : Problem set: 2 solved, 591 unsolved
Search for dead transitions found 2 dead transitions in 61811ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 267/285 places, 592/808 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 266 transition count 592
Applied a total of 1 rules in 6 ms. Remains 266 /267 variables (removed 1) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 266 cols
[2024-06-01 04:31:26] [INFO ] Computed 12 invariants in 2 ms
[2024-06-01 04:31:27] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-06-01 04:31:27] [INFO ] Invariant cache hit.
[2024-06-01 04:31:27] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 266/285 places, 592/808 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63216 ms. Remains : 266/285 places, 592/808 transitions.
Stuttering acceptance computed with spot in 252 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-13
Product exploration explored 100000 steps with 11520 reset in 180 ms.
Product exploration explored 100000 steps with 11611 reset in 175 ms.
Computed a total of 43 stabilizing places and 43 stable transitions
Computed a total of 43 stabilizing places and 43 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X p2), (X (NOT p3)), (X (NOT (AND p0 p2 p1 (NOT p3)))), (X (OR (AND p0 p2 (NOT p3)) (AND p2 p1 (NOT p3)))), (X (AND p0 (NOT p3))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 p1 p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p2 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 129 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
RANDOM walk for 31189 steps (298 resets) in 126 ms. (245 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X p2), (X (NOT p3)), (X (NOT (AND p0 p2 p1 (NOT p3)))), (X (OR (AND p0 p2 (NOT p3)) (AND p2 p1 (NOT p3)))), (X (AND p0 (NOT p3))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 p1 p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p2 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p3 (NOT p1)))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F p1), (F (NOT (OR (AND p0 p2 (NOT p3)) (AND p2 (NOT p3) p1)))), (F (NOT p2)), (F (NOT (OR (NOT p2) (NOT p1)))), (F p3), (F (NOT p0)), (F (NOT (OR (AND p0 p2) (AND p2 p1))))]
Knowledge based reduction with 17 factoid took 528 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 341 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Support contains 7 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 592/592 transitions.
Applied a total of 0 rules in 4 ms. Remains 266 /266 variables (removed 0) and now considering 592/592 (removed 0) transitions.
[2024-06-01 04:31:29] [INFO ] Invariant cache hit.
[2024-06-01 04:31:29] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-01 04:31:29] [INFO ] Invariant cache hit.
[2024-06-01 04:31:30] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2024-06-01 04:31:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 04:31:39] [INFO ] Deduced a trap composed of 17 places in 278 ms of which 3 ms to minimize.
[2024-06-01 04:31:39] [INFO ] Deduced a trap composed of 64 places in 269 ms of which 3 ms to minimize.
[2024-06-01 04:31:39] [INFO ] Deduced a trap composed of 22 places in 288 ms of which 3 ms to minimize.
[2024-06-01 04:31:39] [INFO ] Deduced a trap composed of 26 places in 269 ms of which 2 ms to minimize.
[2024-06-01 04:31:40] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 1 ms to minimize.
[2024-06-01 04:31:40] [INFO ] Deduced a trap composed of 38 places in 284 ms of which 3 ms to minimize.
[2024-06-01 04:31:40] [INFO ] Deduced a trap composed of 33 places in 226 ms of which 3 ms to minimize.
[2024-06-01 04:31:41] [INFO ] Deduced a trap composed of 14 places in 241 ms of which 2 ms to minimize.
[2024-06-01 04:31:41] [INFO ] Deduced a trap composed of 20 places in 262 ms of which 2 ms to minimize.
[2024-06-01 04:31:41] [INFO ] Deduced a trap composed of 23 places in 272 ms of which 3 ms to minimize.
[2024-06-01 04:31:41] [INFO ] Deduced a trap composed of 22 places in 280 ms of which 3 ms to minimize.
[2024-06-01 04:31:42] [INFO ] Deduced a trap composed of 25 places in 276 ms of which 3 ms to minimize.
[2024-06-01 04:31:42] [INFO ] Deduced a trap composed of 44 places in 284 ms of which 3 ms to minimize.
[2024-06-01 04:31:42] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 3 ms to minimize.
[2024-06-01 04:31:43] [INFO ] Deduced a trap composed of 31 places in 269 ms of which 2 ms to minimize.
[2024-06-01 04:31:43] [INFO ] Deduced a trap composed of 33 places in 282 ms of which 3 ms to minimize.
[2024-06-01 04:31:43] [INFO ] Deduced a trap composed of 74 places in 285 ms of which 3 ms to minimize.
[2024-06-01 04:31:44] [INFO ] Deduced a trap composed of 41 places in 263 ms of which 3 ms to minimize.
[2024-06-01 04:31:44] [INFO ] Deduced a trap composed of 33 places in 267 ms of which 2 ms to minimize.
[2024-06-01 04:31:44] [INFO ] Deduced a trap composed of 37 places in 269 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 04:31:45] [INFO ] Deduced a trap composed of 36 places in 260 ms of which 2 ms to minimize.
[2024-06-01 04:31:45] [INFO ] Deduced a trap composed of 18 places in 279 ms of which 3 ms to minimize.
[2024-06-01 04:31:45] [INFO ] Deduced a trap composed of 37 places in 270 ms of which 3 ms to minimize.
[2024-06-01 04:31:45] [INFO ] Deduced a trap composed of 33 places in 266 ms of which 2 ms to minimize.
[2024-06-01 04:31:46] [INFO ] Deduced a trap composed of 36 places in 271 ms of which 3 ms to minimize.
[2024-06-01 04:31:46] [INFO ] Deduced a trap composed of 43 places in 264 ms of which 3 ms to minimize.
[2024-06-01 04:31:46] [INFO ] Deduced a trap composed of 46 places in 262 ms of which 3 ms to minimize.
[2024-06-01 04:31:47] [INFO ] Deduced a trap composed of 25 places in 267 ms of which 2 ms to minimize.
[2024-06-01 04:31:47] [INFO ] Deduced a trap composed of 38 places in 263 ms of which 2 ms to minimize.
[2024-06-01 04:31:47] [INFO ] Deduced a trap composed of 60 places in 274 ms of which 3 ms to minimize.
[2024-06-01 04:31:48] [INFO ] Deduced a trap composed of 48 places in 276 ms of which 2 ms to minimize.
[2024-06-01 04:31:48] [INFO ] Deduced a trap composed of 43 places in 260 ms of which 3 ms to minimize.
[2024-06-01 04:31:48] [INFO ] Deduced a trap composed of 41 places in 267 ms of which 3 ms to minimize.
[2024-06-01 04:31:48] [INFO ] Deduced a trap composed of 44 places in 240 ms of which 2 ms to minimize.
[2024-06-01 04:31:49] [INFO ] Deduced a trap composed of 42 places in 230 ms of which 2 ms to minimize.
[2024-06-01 04:31:49] [INFO ] Deduced a trap composed of 45 places in 248 ms of which 2 ms to minimize.
[2024-06-01 04:31:49] [INFO ] Deduced a trap composed of 41 places in 245 ms of which 2 ms to minimize.
[2024-06-01 04:31:49] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 3 ms to minimize.
[2024-06-01 04:31:50] [INFO ] Deduced a trap composed of 27 places in 287 ms of which 3 ms to minimize.
[2024-06-01 04:31:50] [INFO ] Deduced a trap composed of 65 places in 277 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 04:31:54] [INFO ] Deduced a trap composed of 52 places in 233 ms of which 3 ms to minimize.
[2024-06-01 04:31:54] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 2 ms to minimize.
[2024-06-01 04:31:55] [INFO ] Deduced a trap composed of 31 places in 217 ms of which 2 ms to minimize.
[2024-06-01 04:31:55] [INFO ] Deduced a trap composed of 59 places in 274 ms of which 2 ms to minimize.
[2024-06-01 04:31:55] [INFO ] Deduced a trap composed of 51 places in 268 ms of which 3 ms to minimize.
[2024-06-01 04:31:56] [INFO ] Deduced a trap composed of 43 places in 217 ms of which 2 ms to minimize.
[2024-06-01 04:31:56] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 2 ms to minimize.
[2024-06-01 04:31:56] [INFO ] Deduced a trap composed of 52 places in 215 ms of which 2 ms to minimize.
[2024-06-01 04:31:57] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 3 ms to minimize.
[2024-06-01 04:31:57] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 2 ms to minimize.
[2024-06-01 04:31:57] [INFO ] Deduced a trap composed of 42 places in 197 ms of which 2 ms to minimize.
[2024-06-01 04:31:57] [INFO ] Deduced a trap composed of 31 places in 263 ms of which 2 ms to minimize.
[2024-06-01 04:31:58] [INFO ] Deduced a trap composed of 31 places in 254 ms of which 3 ms to minimize.
[2024-06-01 04:31:58] [INFO ] Deduced a trap composed of 46 places in 202 ms of which 3 ms to minimize.
[2024-06-01 04:31:58] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 2 ms to minimize.
[2024-06-01 04:31:58] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 2 ms to minimize.
[2024-06-01 04:31:59] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 2 ms to minimize.
[2024-06-01 04:31:59] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 2 ms to minimize.
[2024-06-01 04:31:59] [INFO ] Deduced a trap composed of 46 places in 202 ms of which 2 ms to minimize.
[2024-06-01 04:31:59] [INFO ] Deduced a trap composed of 51 places in 205 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 04:32:00] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 3 ms to minimize.
[2024-06-01 04:32:00] [INFO ] Deduced a trap composed of 31 places in 220 ms of which 2 ms to minimize.
[2024-06-01 04:32:01] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 2 ms to minimize.
[2024-06-01 04:32:01] [INFO ] Deduced a trap composed of 35 places in 253 ms of which 2 ms to minimize.
[2024-06-01 04:32:02] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 2 ms to minimize.
SMT process timed out in 31720ms, After SMT, problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 31726ms
Finished structural reductions in LTL mode , in 1 iterations and 32367 ms. Remains : 266/266 places, 592/592 transitions.
Computed a total of 43 stabilizing places and 43 stable transitions
Computed a total of 43 stabilizing places and 43 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X p2), (X (NOT p3)), (X (AND p0 (NOT p3))), (X (NOT (AND p0 p2 (NOT p3) p1))), (X (OR (AND p0 p2 (NOT p3)) (AND p2 (NOT p3) p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 p2 p3 p1)))), (X (X (NOT p3))), (X (X (NOT (AND p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p2 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 131 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
RANDOM walk for 36541 steps (197 resets) in 118 ms. (307 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X p2), (X (NOT p3)), (X (AND p0 (NOT p3))), (X (NOT (AND p0 p2 (NOT p3) p1))), (X (OR (AND p0 p2 (NOT p3)) (AND p2 (NOT p3) p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 p2 p3 p1)))), (X (X (NOT p3))), (X (X (NOT (AND p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p2 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p3 (NOT p1)))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F p1), (F (NOT (OR (AND p0 p2 (NOT p3)) (AND p2 (NOT p3) p1)))), (F (NOT p2)), (F (NOT (OR (NOT p2) (NOT p1)))), (F p3), (F (NOT p0)), (F (NOT (OR (AND p0 p2) (AND p2 p1))))]
Knowledge based reduction with 17 factoid took 533 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 247 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 245 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Product exploration explored 100000 steps with 11669 reset in 153 ms.
Product exploration explored 100000 steps with 11593 reset in 184 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 243 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Support contains 7 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 592/592 transitions.
Graph (trivial) has 240 edges and 266 vertex of which 4 / 266 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 92 rules applied. Total rules applied 93 place count 264 transition count 590
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 110 place count 264 transition count 573
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 110 place count 264 transition count 573
Deduced a syphon composed of 113 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 131 place count 264 transition count 573
Discarding 75 places :
Symmetric choice reduction at 2 with 75 rule applications. Total rules 206 place count 189 transition count 498
Deduced a syphon composed of 39 places in 1 ms
Iterating global reduction 2 with 75 rules applied. Total rules applied 281 place count 189 transition count 498
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 2 with 66 rules applied. Total rules applied 347 place count 189 transition count 506
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 349 place count 189 transition count 504
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 407 place count 131 transition count 369
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 3 with 58 rules applied. Total rules applied 465 place count 131 transition count 369
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 475 place count 131 transition count 359
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 480 place count 126 transition count 354
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 4 with 5 rules applied. Total rules applied 485 place count 126 transition count 354
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 486 place count 126 transition count 354
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 488 place count 124 transition count 352
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 490 place count 124 transition count 352
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 492 place count 124 transition count 358
Deduced a syphon composed of 56 places in 0 ms
Applied a total of 492 rules in 94 ms. Remains 124 /266 variables (removed 142) and now considering 358/592 (removed 234) transitions.
[2024-06-01 04:32:04] [INFO ] Redundant transitions in 6 ms returned []
Running 357 sub problems to find dead transitions.
// Phase 1: matrix 358 rows 124 cols
[2024-06-01 04:32:04] [INFO ] Computed 11 invariants in 3 ms
[2024-06-01 04:32:04] [INFO ] State equation strengthened by 119 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-06-01 04:32:08] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 04:32:08] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 04:32:09] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 2 ms to minimize.
[2024-06-01 04:32:09] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 1 ms to minimize.
[2024-06-01 04:32:09] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 2 ms to minimize.
[2024-06-01 04:32:09] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 04:32:09] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 04:32:09] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 2 ms to minimize.
[2024-06-01 04:32:10] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2024-06-01 04:32:10] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 1 ms to minimize.
[2024-06-01 04:32:10] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
[2024-06-01 04:32:10] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2024-06-01 04:32:10] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2024-06-01 04:32:10] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
[2024-06-01 04:32:10] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 2 ms to minimize.
[2024-06-01 04:32:11] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 1 ms to minimize.
[2024-06-01 04:32:11] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2024-06-01 04:32:11] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 2 ms to minimize.
[2024-06-01 04:32:11] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 04:32:11] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 20/31 constraints. Problems are: Problem set: 42 solved, 315 unsolved
[2024-06-01 04:32:11] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-06-01 04:32:11] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 1 ms to minimize.
[2024-06-01 04:32:12] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 1 ms to minimize.
[2024-06-01 04:32:12] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-06-01 04:32:12] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
Problem TDEAD165 is UNSAT
[2024-06-01 04:32:13] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
Problem TDEAD167 is UNSAT
[2024-06-01 04:32:13] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 1 ms to minimize.
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
[2024-06-01 04:32:13] [INFO ] Deduced a trap composed of 2 places in 152 ms of which 1 ms to minimize.
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD217 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 8/39 constraints. Problems are: Problem set: 53 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/39 constraints. Problems are: Problem set: 53 solved, 304 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
At refinement iteration 5 (OVERLAPS) 357/481 variables, 124/163 constraints. Problems are: Problem set: 65 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 118/281 constraints. Problems are: Problem set: 65 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/281 constraints. Problems are: Problem set: 65 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 1/482 variables, 1/282 constraints. Problems are: Problem set: 65 solved, 292 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 0/282 constraints. Problems are: Problem set: 65 solved, 292 unsolved
At refinement iteration 10 (OVERLAPS) 0/482 variables, 0/282 constraints. Problems are: Problem set: 65 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 282 constraints, problems are : Problem set: 65 solved, 292 unsolved in 21035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 124/124 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 65 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 65 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 57/124 variables, 11/11 constraints. Problems are: Problem set: 65 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 28/39 constraints. Problems are: Problem set: 65 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/39 constraints. Problems are: Problem set: 65 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 357/481 variables, 124/163 constraints. Problems are: Problem set: 65 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 118/281 constraints. Problems are: Problem set: 65 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 292/573 constraints. Problems are: Problem set: 65 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/573 constraints. Problems are: Problem set: 65 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 1/482 variables, 1/574 constraints. Problems are: Problem set: 65 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 574 constraints, problems are : Problem set: 65 solved, 292 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 124/124 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 292/357 constraints, Known Traps: 28/28 constraints]
After SMT, in 52443ms problems are : Problem set: 65 solved, 292 unsolved
Search for dead transitions found 65 dead transitions in 52447ms
Found 65 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 65 transitions
Dead transitions reduction (with SMT) removed 65 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 124/266 places, 293/592 transitions.
Graph (complete) has 635 edges and 124 vertex of which 68 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.2 ms
Discarding 56 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 19 ms. Remains 68 /124 variables (removed 56) and now considering 293/293 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/266 places, 293/592 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 52574 ms. Remains : 68/266 places, 293/592 transitions.
Support contains 7 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 592/592 transitions.
Applied a total of 0 rules in 5 ms. Remains 266 /266 variables (removed 0) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 266 cols
[2024-06-01 04:32:57] [INFO ] Computed 12 invariants in 4 ms
[2024-06-01 04:32:57] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-06-01 04:32:57] [INFO ] Invariant cache hit.
[2024-06-01 04:32:57] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2024-06-01 04:32:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 04:33:06] [INFO ] Deduced a trap composed of 17 places in 317 ms of which 3 ms to minimize.
[2024-06-01 04:33:07] [INFO ] Deduced a trap composed of 64 places in 335 ms of which 3 ms to minimize.
[2024-06-01 04:33:07] [INFO ] Deduced a trap composed of 22 places in 288 ms of which 2 ms to minimize.
[2024-06-01 04:33:07] [INFO ] Deduced a trap composed of 26 places in 293 ms of which 2 ms to minimize.
[2024-06-01 04:33:08] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 2 ms to minimize.
[2024-06-01 04:33:08] [INFO ] Deduced a trap composed of 38 places in 296 ms of which 3 ms to minimize.
[2024-06-01 04:33:08] [INFO ] Deduced a trap composed of 33 places in 210 ms of which 2 ms to minimize.
[2024-06-01 04:33:09] [INFO ] Deduced a trap composed of 14 places in 516 ms of which 2 ms to minimize.
[2024-06-01 04:33:09] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 3 ms to minimize.
[2024-06-01 04:33:09] [INFO ] Deduced a trap composed of 23 places in 258 ms of which 2 ms to minimize.
[2024-06-01 04:33:10] [INFO ] Deduced a trap composed of 22 places in 286 ms of which 3 ms to minimize.
[2024-06-01 04:33:10] [INFO ] Deduced a trap composed of 25 places in 274 ms of which 3 ms to minimize.
[2024-06-01 04:33:10] [INFO ] Deduced a trap composed of 44 places in 270 ms of which 3 ms to minimize.
[2024-06-01 04:33:10] [INFO ] Deduced a trap composed of 31 places in 207 ms of which 2 ms to minimize.
[2024-06-01 04:33:11] [INFO ] Deduced a trap composed of 31 places in 266 ms of which 3 ms to minimize.
[2024-06-01 04:33:11] [INFO ] Deduced a trap composed of 33 places in 294 ms of which 3 ms to minimize.
[2024-06-01 04:33:11] [INFO ] Deduced a trap composed of 74 places in 319 ms of which 2 ms to minimize.
[2024-06-01 04:33:12] [INFO ] Deduced a trap composed of 41 places in 294 ms of which 3 ms to minimize.
[2024-06-01 04:33:12] [INFO ] Deduced a trap composed of 33 places in 292 ms of which 2 ms to minimize.
[2024-06-01 04:33:12] [INFO ] Deduced a trap composed of 37 places in 274 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 04:33:13] [INFO ] Deduced a trap composed of 36 places in 272 ms of which 3 ms to minimize.
[2024-06-01 04:33:13] [INFO ] Deduced a trap composed of 18 places in 283 ms of which 3 ms to minimize.
[2024-06-01 04:33:13] [INFO ] Deduced a trap composed of 37 places in 279 ms of which 3 ms to minimize.
[2024-06-01 04:33:14] [INFO ] Deduced a trap composed of 33 places in 281 ms of which 3 ms to minimize.
[2024-06-01 04:33:14] [INFO ] Deduced a trap composed of 36 places in 270 ms of which 3 ms to minimize.
[2024-06-01 04:33:14] [INFO ] Deduced a trap composed of 43 places in 280 ms of which 3 ms to minimize.
[2024-06-01 04:33:15] [INFO ] Deduced a trap composed of 46 places in 274 ms of which 3 ms to minimize.
[2024-06-01 04:33:15] [INFO ] Deduced a trap composed of 25 places in 274 ms of which 3 ms to minimize.
[2024-06-01 04:33:15] [INFO ] Deduced a trap composed of 38 places in 279 ms of which 3 ms to minimize.
[2024-06-01 04:33:16] [INFO ] Deduced a trap composed of 60 places in 279 ms of which 3 ms to minimize.
[2024-06-01 04:33:16] [INFO ] Deduced a trap composed of 48 places in 261 ms of which 2 ms to minimize.
[2024-06-01 04:33:16] [INFO ] Deduced a trap composed of 43 places in 264 ms of which 3 ms to minimize.
[2024-06-01 04:33:16] [INFO ] Deduced a trap composed of 41 places in 273 ms of which 3 ms to minimize.
[2024-06-01 04:33:17] [INFO ] Deduced a trap composed of 44 places in 253 ms of which 2 ms to minimize.
[2024-06-01 04:33:17] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 2 ms to minimize.
[2024-06-01 04:33:17] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 2 ms to minimize.
[2024-06-01 04:33:18] [INFO ] Deduced a trap composed of 41 places in 250 ms of which 3 ms to minimize.
[2024-06-01 04:33:18] [INFO ] Deduced a trap composed of 42 places in 244 ms of which 3 ms to minimize.
[2024-06-01 04:33:18] [INFO ] Deduced a trap composed of 27 places in 268 ms of which 2 ms to minimize.
[2024-06-01 04:33:19] [INFO ] Deduced a trap composed of 65 places in 283 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 04:33:22] [INFO ] Deduced a trap composed of 52 places in 260 ms of which 2 ms to minimize.
[2024-06-01 04:33:23] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 3 ms to minimize.
[2024-06-01 04:33:23] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 2 ms to minimize.
[2024-06-01 04:33:24] [INFO ] Deduced a trap composed of 59 places in 279 ms of which 3 ms to minimize.
[2024-06-01 04:33:24] [INFO ] Deduced a trap composed of 51 places in 265 ms of which 3 ms to minimize.
[2024-06-01 04:33:24] [INFO ] Deduced a trap composed of 43 places in 211 ms of which 3 ms to minimize.
[2024-06-01 04:33:25] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 2 ms to minimize.
[2024-06-01 04:33:25] [INFO ] Deduced a trap composed of 52 places in 224 ms of which 3 ms to minimize.
[2024-06-01 04:33:25] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 2 ms to minimize.
[2024-06-01 04:33:26] [INFO ] Deduced a trap composed of 39 places in 199 ms of which 2 ms to minimize.
[2024-06-01 04:33:26] [INFO ] Deduced a trap composed of 42 places in 195 ms of which 2 ms to minimize.
[2024-06-01 04:33:26] [INFO ] Deduced a trap composed of 31 places in 257 ms of which 2 ms to minimize.
[2024-06-01 04:33:27] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 3 ms to minimize.
[2024-06-01 04:33:27] [INFO ] Deduced a trap composed of 46 places in 213 ms of which 3 ms to minimize.
[2024-06-01 04:33:27] [INFO ] Deduced a trap composed of 46 places in 178 ms of which 3 ms to minimize.
[2024-06-01 04:33:27] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 2 ms to minimize.
[2024-06-01 04:33:27] [INFO ] Deduced a trap composed of 38 places in 191 ms of which 2 ms to minimize.
[2024-06-01 04:33:28] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 2 ms to minimize.
[2024-06-01 04:33:28] [INFO ] Deduced a trap composed of 46 places in 208 ms of which 3 ms to minimize.
[2024-06-01 04:33:28] [INFO ] Deduced a trap composed of 51 places in 191 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 04:33:29] [INFO ] Deduced a trap composed of 31 places in 215 ms of which 3 ms to minimize.
[2024-06-01 04:33:29] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 266/858 variables, and 74 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/266 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 62/74 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 04:33:34] [INFO ] Deduced a trap composed of 43 places in 226 ms of which 3 ms to minimize.
[2024-06-01 04:33:34] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 2 ms to minimize.
[2024-06-01 04:33:35] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 2 ms to minimize.
[2024-06-01 04:33:35] [INFO ] Deduced a trap composed of 46 places in 261 ms of which 2 ms to minimize.
[2024-06-01 04:33:36] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 2 ms to minimize.
[2024-06-01 04:33:36] [INFO ] Deduced a trap composed of 46 places in 191 ms of which 2 ms to minimize.
[2024-06-01 04:33:36] [INFO ] Deduced a trap composed of 45 places in 185 ms of which 2 ms to minimize.
[2024-06-01 04:33:36] [INFO ] Deduced a trap composed of 45 places in 194 ms of which 2 ms to minimize.
[2024-06-01 04:33:37] [INFO ] Deduced a trap composed of 46 places in 210 ms of which 3 ms to minimize.
[2024-06-01 04:33:37] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 2 ms to minimize.
[2024-06-01 04:33:37] [INFO ] Deduced a trap composed of 46 places in 178 ms of which 2 ms to minimize.
[2024-06-01 04:33:37] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 2 ms to minimize.
[2024-06-01 04:33:38] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 2 ms to minimize.
[2024-06-01 04:33:38] [INFO ] Deduced a trap composed of 41 places in 205 ms of which 2 ms to minimize.
[2024-06-01 04:33:38] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 2 ms to minimize.
[2024-06-01 04:33:38] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 5 ms to minimize.
[2024-06-01 04:33:39] [INFO ] Deduced a trap composed of 47 places in 193 ms of which 6 ms to minimize.
[2024-06-01 04:33:39] [INFO ] Deduced a trap composed of 45 places in 178 ms of which 2 ms to minimize.
[2024-06-01 04:33:39] [INFO ] Deduced a trap composed of 46 places in 166 ms of which 1 ms to minimize.
[2024-06-01 04:33:40] [INFO ] Deduced a trap composed of 25 places in 257 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 04:33:41] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 2 ms to minimize.
[2024-06-01 04:33:41] [INFO ] Deduced a trap composed of 46 places in 172 ms of which 2 ms to minimize.
[2024-06-01 04:33:43] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 2 ms to minimize.
[2024-06-01 04:33:43] [INFO ] Deduced a trap composed of 14 places in 243 ms of which 2 ms to minimize.
[2024-06-01 04:33:43] [INFO ] Deduced a trap composed of 45 places in 252 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 5/99 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 04:33:48] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 3 ms to minimize.
[2024-06-01 04:33:48] [INFO ] Deduced a trap composed of 41 places in 256 ms of which 2 ms to minimize.
[2024-06-01 04:33:49] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 2 ms to minimize.
[2024-06-01 04:33:49] [INFO ] Deduced a trap composed of 51 places in 140 ms of which 1 ms to minimize.
[2024-06-01 04:33:49] [INFO ] Deduced a trap composed of 31 places in 253 ms of which 2 ms to minimize.
[2024-06-01 04:33:50] [INFO ] Deduced a trap composed of 32 places in 282 ms of which 3 ms to minimize.
[2024-06-01 04:33:50] [INFO ] Deduced a trap composed of 31 places in 212 ms of which 2 ms to minimize.
[2024-06-01 04:33:50] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 1 ms to minimize.
[2024-06-01 04:33:50] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 2 ms to minimize.
[2024-06-01 04:33:50] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 1 ms to minimize.
[2024-06-01 04:33:51] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 3 ms to minimize.
[2024-06-01 04:33:51] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 1 ms to minimize.
[2024-06-01 04:33:51] [INFO ] Deduced a trap composed of 31 places in 233 ms of which 3 ms to minimize.
[2024-06-01 04:33:52] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 1 ms to minimize.
[2024-06-01 04:33:52] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 3 ms to minimize.
[2024-06-01 04:33:52] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 2 ms to minimize.
[2024-06-01 04:33:53] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 2 ms to minimize.
[2024-06-01 04:33:53] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 3 ms to minimize.
[2024-06-01 04:33:53] [INFO ] Deduced a trap composed of 38 places in 252 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 19/118 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 266/858 variables, and 118 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/266 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 106/106 constraints]
After SMT, in 61807ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 61813ms
Finished structural reductions in LTL mode , in 1 iterations and 62430 ms. Remains : 266/266 places, 592/592 transitions.
Treatment of property AutonomousCar-PT-07b-LTLCardinality-13 finished in 215588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Support contains 3 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Graph (trivial) has 268 edges and 285 vertex of which 4 / 285 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 282 transition count 694
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 152 rules applied. Total rules applied 264 place count 171 transition count 653
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 288 place count 147 transition count 653
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 288 place count 147 transition count 647
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 300 place count 141 transition count 647
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 310 place count 131 transition count 637
Iterating global reduction 3 with 10 rules applied. Total rules applied 320 place count 131 transition count 637
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 3 with 196 rules applied. Total rules applied 516 place count 131 transition count 441
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 516 place count 131 transition count 440
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 518 place count 130 transition count 440
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 520 place count 128 transition count 432
Iterating global reduction 4 with 2 rules applied. Total rules applied 522 place count 128 transition count 432
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 524 place count 128 transition count 430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 525 place count 127 transition count 430
Performed 54 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 6 with 108 rules applied. Total rules applied 633 place count 73 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 634 place count 73 transition count 374
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 645 place count 62 transition count 291
Iterating global reduction 7 with 11 rules applied. Total rules applied 656 place count 62 transition count 291
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 661 place count 62 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 663 place count 61 transition count 285
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 665 place count 59 transition count 283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 666 place count 58 transition count 283
Applied a total of 666 rules in 58 ms. Remains 58 /285 variables (removed 227) and now considering 283/808 (removed 525) transitions.
// Phase 1: matrix 283 rows 58 cols
[2024-06-01 04:33:59] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 04:34:00] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 04:34:00] [INFO ] Invariant cache hit.
[2024-06-01 04:34:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 04:34:00] [INFO ] Implicit Places using invariants and state equation in 221 ms returned [51, 57]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 353 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/285 places, 283/808 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 282
Applied a total of 2 rules in 10 ms. Remains 55 /56 variables (removed 1) and now considering 282/283 (removed 1) transitions.
// Phase 1: matrix 282 rows 55 cols
[2024-06-01 04:34:00] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 04:34:00] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-01 04:34:00] [INFO ] Invariant cache hit.
[2024-06-01 04:34:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:34:00] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/285 places, 282/808 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 743 ms. Remains : 55/285 places, 282/808 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 243 steps with 18 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-15 finished in 847 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((F(G(p1)) U p2))||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(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' '!(G(F(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' '!(G((F(!(p0 U p1))||!(G(p0) U G(p2))||X(p3))))'
Found a Lengthening insensitive property : AutonomousCar-PT-07b-LTLCardinality-13
Stuttering acceptance computed with spot in 242 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Support contains 7 out of 285 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Graph (trivial) has 259 edges and 285 vertex of which 4 / 285 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 282 transition count 701
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 141 rules applied. Total rules applied 246 place count 178 transition count 664
Reduce places removed 21 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 24 rules applied. Total rules applied 270 place count 157 transition count 661
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 275 place count 154 transition count 659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 276 place count 153 transition count 659
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 276 place count 153 transition count 651
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 292 place count 145 transition count 651
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 300 place count 137 transition count 643
Iterating global reduction 5 with 8 rules applied. Total rules applied 308 place count 137 transition count 643
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 5 with 196 rules applied. Total rules applied 504 place count 137 transition count 447
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 504 place count 137 transition count 446
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 506 place count 136 transition count 446
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 508 place count 134 transition count 438
Iterating global reduction 6 with 2 rules applied. Total rules applied 510 place count 134 transition count 438
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 512 place count 134 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 513 place count 133 transition count 436
Performed 51 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 8 with 102 rules applied. Total rules applied 615 place count 82 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 616 place count 82 transition count 383
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 627 place count 71 transition count 301
Iterating global reduction 9 with 11 rules applied. Total rules applied 638 place count 71 transition count 301
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 642 place count 71 transition count 297
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 644 place count 70 transition count 296
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 646 place count 68 transition count 294
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 647 place count 67 transition count 294
Applied a total of 647 rules in 58 ms. Remains 67 /285 variables (removed 218) and now considering 294/808 (removed 514) transitions.
// Phase 1: matrix 294 rows 67 cols
[2024-06-01 04:34:01] [INFO ] Computed 10 invariants in 2 ms
[2024-06-01 04:34:01] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-01 04:34:01] [INFO ] Invariant cache hit.
[2024-06-01 04:34:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 04:34:01] [INFO ] Implicit Places using invariants and state equation in 233 ms returned [62, 66]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 362 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 65/285 places, 294/808 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 293
Applied a total of 2 rules in 7 ms. Remains 64 /65 variables (removed 1) and now considering 293/294 (removed 1) transitions.
// Phase 1: matrix 293 rows 64 cols
[2024-06-01 04:34:01] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 04:34:02] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-01 04:34:02] [INFO ] Invariant cache hit.
[2024-06-01 04:34:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:34:02] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 64/285 places, 293/808 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 773 ms. Remains : 64/285 places, 293/808 transitions.
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-13
Product exploration explored 100000 steps with 2239 reset in 94 ms.
Product exploration explored 100000 steps with 3425 reset in 113 ms.
Computed a total of 7 stabilizing places and 8 stable transitions
Computed a total of 7 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X p2), (X (NOT p3)), (X (NOT (AND p0 p2 p1 (NOT p3)))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p2 p1 p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (OR (AND p0 p2 (NOT p3)) (AND p2 p1 (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p2 p1 (NOT p3))))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X p0), (X (NOT p0)), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 12 factoid took 390 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
RANDOM walk for 7430 steps (345 resets) in 29 ms. (247 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X p2), (X (NOT p3)), (X (NOT (AND p0 p2 p1 (NOT p3)))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p2 p1 p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (OR (AND p0 p2 (NOT p3)) (AND p2 p1 (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p2 p1 (NOT p3))))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X p0), (X (NOT p0)), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND p0 (NOT p1) p2))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR (AND p0 p2) (AND p1 p2)))), (F p3), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 12 factoid took 750 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 238 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Support contains 7 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 293/293 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-06-01 04:34:04] [INFO ] Invariant cache hit.
[2024-06-01 04:34:04] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-01 04:34:04] [INFO ] Invariant cache hit.
[2024-06-01 04:34:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:34:04] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 291 sub problems to find dead transitions.
[2024-06-01 04:34:04] [INFO ] Invariant cache hit.
[2024-06-01 04:34:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 04:34:07] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 1 ms to minimize.
[2024-06-01 04:34:08] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 1 ms to minimize.
[2024-06-01 04:34:08] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 1 ms to minimize.
[2024-06-01 04:34:08] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2024-06-01 04:34:08] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 1 ms to minimize.
[2024-06-01 04:34:08] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 0 ms to minimize.
[2024-06-01 04:34:08] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Problem TDEAD179 is UNSAT
At refinement iteration 5 (OVERLAPS) 292/356 variables, 64/79 constraints. Problems are: Problem set: 1 solved, 290 unsolved
[2024-06-01 04:34:11] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 1 ms to minimize.
[2024-06-01 04:34:11] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 0 ms to minimize.
[2024-06-01 04:34:11] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 3/82 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 1/357 variables, 1/83 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 10 (OVERLAPS) 0/357 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/357 variables, and 83 constraints, problems are : Problem set: 1 solved, 290 unsolved in 14386 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 1 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 7/12 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 6/18 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 6 (OVERLAPS) 292/355 variables, 63/81 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 290/371 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/371 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 9 (OVERLAPS) 1/356 variables, 1/372 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 0/372 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 11 (OVERLAPS) 1/357 variables, 1/373 constraints. Problems are: Problem set: 1 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 357/357 variables, and 373 constraints, problems are : Problem set: 1 solved, 290 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 290/291 constraints, Known Traps: 10/10 constraints]
After SMT, in 45555ms problems are : Problem set: 1 solved, 290 unsolved
Search for dead transitions found 1 dead transitions in 45558ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 64/64 places, 292/293 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45887 ms. Remains : 64/64 places, 292/293 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X p2), (X (NOT p3)), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 12 factoid took 401 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
RANDOM walk for 5992 steps (271 resets) in 43 ms. (136 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X p2), (X (NOT p3)), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND p0 (NOT p1) p2))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR (AND p0 p2) (AND p1 p2)))), (F p3), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 12 factoid took 781 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 247 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 252 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Product exploration explored 100000 steps with 2471 reset in 89 ms.
Product exploration explored 100000 steps with 5364 reset in 125 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 250 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Support contains 7 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 292/292 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 64 transition count 294
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 11 ms. Remains 64 /64 variables (removed 0) and now considering 294/292 (removed -2) transitions.
[2024-06-01 04:34:53] [INFO ] Redundant transitions in 80 ms returned []
Running 292 sub problems to find dead transitions.
// Phase 1: matrix 294 rows 64 cols
[2024-06-01 04:34:53] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 04:34:53] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-01 04:34:56] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 1 ms to minimize.
[2024-06-01 04:34:56] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 0 ms to minimize.
[2024-06-01 04:34:56] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 0 ms to minimize.
[2024-06-01 04:34:56] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2024-06-01 04:34:56] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2024-06-01 04:34:57] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2024-06-01 04:34:57] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
At refinement iteration 5 (OVERLAPS) 293/356 variables, 63/78 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 1/79 constraints. Problems are: Problem set: 3 solved, 289 unsolved
[2024-06-01 04:35:01] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 1/80 constraints. Problems are: Problem set: 3 solved, 289 unsolved
[2024-06-01 04:35:02] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 1 ms to minimize.
[2024-06-01 04:35:02] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 2/82 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 0/82 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 10 (OVERLAPS) 1/357 variables, 1/83 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/83 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 12 (OVERLAPS) 1/358 variables, 1/84 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/358 variables, 0/84 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 14 (OVERLAPS) 0/358 variables, 0/84 constraints. Problems are: Problem set: 3 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 84 constraints, problems are : Problem set: 3 solved, 289 unsolved in 19242 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 3 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 4/5 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 7/12 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 6/18 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 292/354 variables, 62/80 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 1/81 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 289/370 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/370 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 10 (OVERLAPS) 3/357 variables, 2/372 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/372 constraints. Problems are: Problem set: 3 solved, 289 unsolved
SMT process timed out in 50540ms, After SMT, problems are : Problem set: 3 solved, 289 unsolved
Search for dead transitions found 3 dead transitions in 50544ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 64/64 places, 291/292 transitions.
Graph (complete) has 562 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 63 /64 variables (removed 1) and now considering 291/291 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/64 places, 291/292 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 50652 ms. Remains : 63/64 places, 291/292 transitions.
Support contains 7 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 292/292 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 292/292 (removed 0) transitions.
// Phase 1: matrix 292 rows 64 cols
[2024-06-01 04:35:43] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 04:35:43] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-06-01 04:35:44] [INFO ] Invariant cache hit.
[2024-06-01 04:35:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:35:44] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2024-06-01 04:35:44] [INFO ] Invariant cache hit.
[2024-06-01 04:35:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-01 04:35:48] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 2 ms to minimize.
[2024-06-01 04:35:48] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 1 ms to minimize.
[2024-06-01 04:35:48] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 1 ms to minimize.
[2024-06-01 04:35:49] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 1 ms to minimize.
[2024-06-01 04:35:49] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 1 ms to minimize.
[2024-06-01 04:35:49] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 1 ms to minimize.
[2024-06-01 04:35:49] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 291/354 variables, 63/78 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-01 04:35:52] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 1 ms to minimize.
[2024-06-01 04:35:52] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 1 ms to minimize.
[2024-06-01 04:35:52] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 1 ms to minimize.
[2024-06-01 04:35:52] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 1/355 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (OVERLAPS) 1/356 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 12 (OVERLAPS) 0/356 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 84 constraints, problems are : Problem set: 0 solved, 290 unsolved in 25005 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (OVERLAPS) 291/354 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 290/372 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (OVERLAPS) 1/355 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 290 unsolved
SMT process timed out in 56469ms, After SMT, problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 56478ms
Finished structural reductions in LTL mode , in 1 iterations and 56980 ms. Remains : 64/64 places, 292/292 transitions.
Treatment of property AutonomousCar-PT-07b-LTLCardinality-13 finished in 159784 ms.
[2024-06-01 04:36:40] [INFO ] Flatten gal took : 71 ms
[2024-06-01 04:36:40] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 04:36:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 285 places, 808 transitions and 5789 arcs took 18 ms.
Total runtime 1086061 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutonomousCar-PT-07b-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-07b-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-07b-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-07b-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717218831034

--------------------
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 AutonomousCar-PT-07b-LTLCardinality-03
ltl formula formula --ltl=/tmp/5020/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 285 places, 808 transitions and 5789 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.120 real 0.030 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5020/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5020/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5020/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5020/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 286 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 286, there are 1159 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~103 levels ~10000 states ~29336 transitions
pnml2lts-mc( 0/ 4): ~103 levels ~20000 states ~63204 transitions
pnml2lts-mc( 1/ 4): ~139 levels ~40000 states ~146940 transitions
pnml2lts-mc( 0/ 4): ~109 levels ~80000 states ~285100 transitions
pnml2lts-mc( 0/ 4): ~112 levels ~160000 states ~596956 transitions
pnml2lts-mc( 0/ 4): ~113 levels ~320000 states ~1313636 transitions
pnml2lts-mc( 1/ 4): ~146 levels ~640000 states ~2871592 transitions
pnml2lts-mc( 1/ 4): ~146 levels ~1280000 states ~5941164 transitions
pnml2lts-mc( 1/ 4): ~152 levels ~2560000 states ~12678792 transitions
pnml2lts-mc( 1/ 4): ~152 levels ~5120000 states ~28088436 transitions
pnml2lts-mc( 1/ 4): ~152 levels ~10240000 states ~58236724 transitions
pnml2lts-mc( 1/ 4): ~169 levels ~20480000 states ~123620896 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33551962
pnml2lts-mc( 0/ 4): unique states count: 33552381
pnml2lts-mc( 0/ 4): unique transitions count: 221358416
pnml2lts-mc( 0/ 4): - self-loop count: 549
pnml2lts-mc( 0/ 4): - claim dead count: 187803455
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33552393
pnml2lts-mc( 0/ 4): - cum. max stack depth: 530
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33552393 states 221358463 transitions, fanout: 6.597
pnml2lts-mc( 0/ 4): Total exploration time 571.150 sec (571.120 sec minimum, 571.138 sec on average)
pnml2lts-mc( 0/ 4): States per second: 58745, Transitions per second: 387566
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 258.9MB, 8.1 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/4.0%
pnml2lts-mc( 0/ 4): Stored 820 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 258.9MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-07b-LTLCardinality-07
ltl formula formula --ltl=/tmp/5020/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 285 places, 808 transitions and 5789 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.140 real 0.040 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5020/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5020/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5020/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5020/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 286 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 286, there are 820 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): ~95 levels ~10000 states ~39696 transitions
pnml2lts-mc( 2/ 4): ~95 levels ~20000 states ~84848 transitions
pnml2lts-mc( 2/ 4): ~95 levels ~40000 states ~178868 transitions
pnml2lts-mc( 2/ 4): ~95 levels ~80000 states ~396440 transitions
pnml2lts-mc( 2/ 4): ~105 levels ~160000 states ~804936 transitions
pnml2lts-mc( 2/ 4): ~105 levels ~320000 states ~1662224 transitions
pnml2lts-mc( 1/ 4): ~107 levels ~640000 states ~3622052 transitions
pnml2lts-mc( 1/ 4): ~108 levels ~1280000 states ~7186100 transitions
pnml2lts-mc( 1/ 4): ~115 levels ~2560000 states ~14537740 transitions
pnml2lts-mc( 1/ 4): ~115 levels ~5120000 states ~31378336 transitions
pnml2lts-mc( 1/ 4): ~117 levels ~10240000 states ~64571620 transitions
pnml2lts-mc( 1/ 4): ~117 levels ~20480000 states ~131085376 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 28424406
pnml2lts-mc( 0/ 4): unique states count: 33532382
pnml2lts-mc( 0/ 4): unique transitions count: 238861443
pnml2lts-mc( 0/ 4): - self-loop count: 99
pnml2lts-mc( 0/ 4): - claim dead count: 181898416
pnml2lts-mc( 0/ 4): - claim found count: 23359189
pnml2lts-mc( 0/ 4): - claim success count: 33532393
pnml2lts-mc( 0/ 4): - cum. max stack depth: 18094
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33532393 states 238861469 transitions, fanout: 7.123
pnml2lts-mc( 0/ 4): Total exploration time 564.380 sec (564.340 sec minimum, 564.355 sec on average)
pnml2lts-mc( 0/ 4): States per second: 59415, Transitions per second: 423228
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 257.4MB, 8.0 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 820 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 257.4MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-07b-LTLCardinality-11
ltl formula formula --ltl=/tmp/5020/ltl_2_
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 285 places, 808 transitions and 5789 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.100 real 0.040 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5020/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5020/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5020/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5020/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 287 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 286, there are 817 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): ~106 levels ~10000 states ~41560 transitions
pnml2lts-mc( 3/ 4): ~106 levels ~20000 states ~88112 transitions
pnml2lts-mc( 3/ 4): ~106 levels ~40000 states ~184212 transitions
pnml2lts-mc( 3/ 4): ~106 levels ~80000 states ~396232 transitions
pnml2lts-mc( 3/ 4): ~106 levels ~160000 states ~850288 transitions
pnml2lts-mc( 3/ 4): ~108 levels ~320000 states ~1685336 transitions
pnml2lts-mc( 3/ 4): ~108 levels ~640000 states ~3542792 transitions
pnml2lts-mc( 3/ 4): ~108 levels ~1280000 states ~7180280 transitions
pnml2lts-mc( 3/ 4): ~114 levels ~2560000 states ~14596576 transitions
pnml2lts-mc( 3/ 4): ~114 levels ~5120000 states ~30016416 transitions
pnml2lts-mc( 3/ 4): ~114 levels ~10240000 states ~64380416 transitions
pnml2lts-mc( 3/ 4): ~119 levels ~20480000 states ~127862644 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33552379
pnml2lts-mc( 0/ 4): unique states count: 33552749
pnml2lts-mc( 0/ 4): unique transitions count: 226217955
pnml2lts-mc( 0/ 4): - self-loop count: 235
pnml2lts-mc( 0/ 4): - claim dead count: 192663306
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33552760
pnml2lts-mc( 0/ 4): - cum. max stack depth: 461
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33552760 states 226217995 transitions, fanout: 6.742
pnml2lts-mc( 0/ 4): Total exploration time 549.910 sec (549.880 sec minimum, 549.895 sec on average)
pnml2lts-mc( 0/ 4): States per second: 61015, Transitions per second: 411373
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 256.6MB, 8.0 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 820 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 256.6MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-07b-LTLCardinality-13
ltl formula formula --ltl=/tmp/5020/ltl_3_
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 285 places, 808 transitions and 5789 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.110 real 0.040 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5020/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5020/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5020/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5020/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 286 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 286, there are 915 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~106 levels ~10000 states ~34660 transitions
pnml2lts-mc( 0/ 4): ~107 levels ~20000 states ~75316 transitions
pnml2lts-mc( 0/ 4): ~107 levels ~40000 states ~160300 transitions
pnml2lts-mc( 1/ 4): ~109 levels ~80000 states ~358240 transitions
pnml2lts-mc( 0/ 4): ~107 levels ~160000 states ~801688 transitions
pnml2lts-mc( 0/ 4): ~108 levels ~320000 states ~1624376 transitions
pnml2lts-mc( 0/ 4): ~114 levels ~640000 states ~3302936 transitions
pnml2lts-mc( 0/ 4): ~115 levels ~1280000 states ~6820436 transitions
pnml2lts-mc( 0/ 4): ~115 levels ~2560000 states ~14295976 transitions
pnml2lts-mc( 0/ 4): ~115 levels ~5120000 states ~28531252 transitions
pnml2lts-mc( 0/ 4): ~115 levels ~10240000 states ~59472540 transitions
pnml2lts-mc( 0/ 4): ~122 levels ~20480000 states ~123077720 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~6339!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 29988544
pnml2lts-mc( 0/ 4): unique states count: 30472484
pnml2lts-mc( 0/ 4): unique transitions count: 204917008
pnml2lts-mc( 0/ 4): - self-loop count: 310
pnml2lts-mc( 0/ 4): - claim dead count: 173908063
pnml2lts-mc( 0/ 4): - claim found count: 500422
pnml2lts-mc( 0/ 4): - claim success count: 30472916
pnml2lts-mc( 0/ 4): - cum. max stack depth: 6714
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 30472916 states 204918518 transitions, fanout: 6.725
pnml2lts-mc( 0/ 4): Total exploration time 541.610 sec (541.610 sec minimum, 541.610 sec on average)
pnml2lts-mc( 0/ 4): States per second: 56264, Transitions per second: 378351
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 235.3MB, 8.1 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 90.0%/4.0%
pnml2lts-mc( 0/ 4): Stored 820 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 235.3MB (~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="AutonomousCar-PT-07b"
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 AutonomousCar-PT-07b, 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 r468-smll-171620167500323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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