About the Execution of LTSMin+red for AutonomousCar-PT-08b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12806.207 | 1090954.00 | 3032183.00 | 1487.80 | FFTFFFTTTTFFTTTF | normal |
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-171620167500339.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-08b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167500339
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 12 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 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 517K 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-08b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717218420592
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-08b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:07:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:07:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:07:02] [INFO ] Load time of PNML (sax parser for PT used): 241 ms
[2024-06-01 05:07:02] [INFO ] Transformed 357 places.
[2024-06-01 05:07:02] [INFO ] Transformed 1128 transitions.
[2024-06-01 05:07:02] [INFO ] Found NUPN structural information;
[2024-06-01 05:07:02] [INFO ] Parsed PT model containing 357 places and 1128 transitions and 9454 arcs in 426 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA AutonomousCar-PT-08b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 357 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 357/357 places, 1128/1128 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 310 transition count 1081
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 310 transition count 1081
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 0 with 256 rules applied. Total rules applied 350 place count 310 transition count 825
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 359 place count 301 transition count 816
Iterating global reduction 1 with 9 rules applied. Total rules applied 368 place count 301 transition count 816
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 369 place count 300 transition count 815
Iterating global reduction 1 with 1 rules applied. Total rules applied 370 place count 300 transition count 815
Applied a total of 370 rules in 160 ms. Remains 300 /357 variables (removed 57) and now considering 815/1128 (removed 313) transitions.
// Phase 1: matrix 815 rows 300 cols
[2024-06-01 05:07:03] [INFO ] Computed 13 invariants in 36 ms
[2024-06-01 05:07:04] [INFO ] Implicit Places using invariants in 689 ms returned []
[2024-06-01 05:07:04] [INFO ] Invariant cache hit.
[2024-06-01 05:07:04] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 1481 ms to find 0 implicit places.
Running 814 sub problems to find dead transitions.
[2024-06-01 05:07:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 814 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 814 unsolved
[2024-06-01 05:07:22] [INFO ] Deduced a trap composed of 31 places in 548 ms of which 38 ms to minimize.
[2024-06-01 05:07:23] [INFO ] Deduced a trap composed of 67 places in 472 ms of which 5 ms to minimize.
[2024-06-01 05:07:23] [INFO ] Deduced a trap composed of 21 places in 425 ms of which 3 ms to minimize.
[2024-06-01 05:07:23] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 2 ms to minimize.
[2024-06-01 05:07:24] [INFO ] Deduced a trap composed of 23 places in 470 ms of which 3 ms to minimize.
[2024-06-01 05:07:24] [INFO ] Deduced a trap composed of 31 places in 405 ms of which 3 ms to minimize.
[2024-06-01 05:07:25] [INFO ] Deduced a trap composed of 31 places in 376 ms of which 3 ms to minimize.
[2024-06-01 05:07:25] [INFO ] Deduced a trap composed of 42 places in 451 ms of which 3 ms to minimize.
[2024-06-01 05:07:26] [INFO ] Deduced a trap composed of 40 places in 476 ms of which 4 ms to minimize.
[2024-06-01 05:07:26] [INFO ] Deduced a trap composed of 32 places in 417 ms of which 4 ms to minimize.
[2024-06-01 05:07:27] [INFO ] Deduced a trap composed of 45 places in 429 ms of which 3 ms to minimize.
[2024-06-01 05:07:27] [INFO ] Deduced a trap composed of 80 places in 410 ms of which 3 ms to minimize.
[2024-06-01 05:07:28] [INFO ] Deduced a trap composed of 29 places in 414 ms of which 3 ms to minimize.
[2024-06-01 05:07:28] [INFO ] Deduced a trap composed of 42 places in 462 ms of which 3 ms to minimize.
[2024-06-01 05:07:29] [INFO ] Deduced a trap composed of 18 places in 403 ms of which 3 ms to minimize.
[2024-06-01 05:07:29] [INFO ] Deduced a trap composed of 39 places in 391 ms of which 3 ms to minimize.
[2024-06-01 05:07:29] [INFO ] Deduced a trap composed of 24 places in 368 ms of which 3 ms to minimize.
[2024-06-01 05:07:30] [INFO ] Deduced a trap composed of 40 places in 377 ms of which 3 ms to minimize.
[2024-06-01 05:07:31] [INFO ] Deduced a trap composed of 49 places in 393 ms of which 3 ms to minimize.
[2024-06-01 05:07:31] [INFO ] Deduced a trap composed of 32 places in 385 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 814 unsolved
[2024-06-01 05:07:32] [INFO ] Deduced a trap composed of 14 places in 382 ms of which 3 ms to minimize.
[2024-06-01 05:07:32] [INFO ] Deduced a trap composed of 32 places in 316 ms of which 3 ms to minimize.
[2024-06-01 05:07:32] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-06-01 05:07:33] [INFO ] Deduced a trap composed of 51 places in 310 ms of which 3 ms to minimize.
[2024-06-01 05:07:33] [INFO ] Deduced a trap composed of 38 places in 347 ms of which 3 ms to minimize.
[2024-06-01 05:07:33] [INFO ] Deduced a trap composed of 43 places in 309 ms of which 2 ms to minimize.
[2024-06-01 05:07:34] [INFO ] Deduced a trap composed of 48 places in 347 ms of which 3 ms to minimize.
[2024-06-01 05:07:34] [INFO ] Deduced a trap composed of 43 places in 323 ms of which 3 ms to minimize.
[2024-06-01 05:07:35] [INFO ] Deduced a trap composed of 52 places in 332 ms of which 3 ms to minimize.
[2024-06-01 05:07:35] [INFO ] Deduced a trap composed of 47 places in 321 ms of which 3 ms to minimize.
[2024-06-01 05:07:35] [INFO ] Deduced a trap composed of 46 places in 335 ms of which 3 ms to minimize.
[2024-06-01 05:07:36] [INFO ] Deduced a trap composed of 48 places in 339 ms of which 2 ms to minimize.
[2024-06-01 05:07:36] [INFO ] Deduced a trap composed of 44 places in 338 ms of which 3 ms to minimize.
[2024-06-01 05:07:36] [INFO ] Deduced a trap composed of 42 places in 322 ms of which 2 ms to minimize.
[2024-06-01 05:07:37] [INFO ] Deduced a trap composed of 45 places in 319 ms of which 3 ms to minimize.
[2024-06-01 05:07:37] [INFO ] Deduced a trap composed of 41 places in 322 ms of which 3 ms to minimize.
[2024-06-01 05:07:37] [INFO ] Deduced a trap composed of 39 places in 333 ms of which 3 ms to minimize.
[2024-06-01 05:07:38] [INFO ] Deduced a trap composed of 48 places in 252 ms of which 3 ms to minimize.
[2024-06-01 05:07:38] [INFO ] Deduced a trap composed of 48 places in 259 ms of which 2 ms to minimize.
[2024-06-01 05:07:38] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 814 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 300/1115 variables, and 53 constraints, problems are : Problem set: 0 solved, 814 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/300 constraints, PredecessorRefiner: 814/814 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 814 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 814 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 814 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 814 unsolved
[2024-06-01 05:07:48] [INFO ] Deduced a trap composed of 41 places in 395 ms of which 3 ms to minimize.
[2024-06-01 05:07:48] [INFO ] Deduced a trap composed of 72 places in 430 ms of which 3 ms to minimize.
[2024-06-01 05:07:49] [INFO ] Deduced a trap composed of 46 places in 332 ms of which 2 ms to minimize.
[2024-06-01 05:07:49] [INFO ] Deduced a trap composed of 47 places in 325 ms of which 3 ms to minimize.
[2024-06-01 05:07:50] [INFO ] Deduced a trap composed of 47 places in 378 ms of which 3 ms to minimize.
[2024-06-01 05:07:50] [INFO ] Deduced a trap composed of 46 places in 366 ms of which 2 ms to minimize.
[2024-06-01 05:07:51] [INFO ] Deduced a trap composed of 43 places in 301 ms of which 2 ms to minimize.
[2024-06-01 05:07:51] [INFO ] Deduced a trap composed of 49 places in 305 ms of which 2 ms to minimize.
[2024-06-01 05:07:51] [INFO ] Deduced a trap composed of 45 places in 304 ms of which 2 ms to minimize.
[2024-06-01 05:07:51] [INFO ] Deduced a trap composed of 47 places in 316 ms of which 2 ms to minimize.
[2024-06-01 05:07:52] [INFO ] Deduced a trap composed of 51 places in 314 ms of which 3 ms to minimize.
[2024-06-01 05:07:52] [INFO ] Deduced a trap composed of 51 places in 309 ms of which 2 ms to minimize.
[2024-06-01 05:07:53] [INFO ] Deduced a trap composed of 43 places in 302 ms of which 3 ms to minimize.
[2024-06-01 05:07:53] [INFO ] Deduced a trap composed of 45 places in 290 ms of which 2 ms to minimize.
[2024-06-01 05:07:53] [INFO ] Deduced a trap composed of 48 places in 261 ms of which 3 ms to minimize.
[2024-06-01 05:07:54] [INFO ] Deduced a trap composed of 50 places in 260 ms of which 2 ms to minimize.
[2024-06-01 05:07:54] [INFO ] Deduced a trap composed of 47 places in 268 ms of which 5 ms to minimize.
[2024-06-01 05:07:54] [INFO ] Deduced a trap composed of 52 places in 259 ms of which 3 ms to minimize.
[2024-06-01 05:07:54] [INFO ] Deduced a trap composed of 48 places in 252 ms of which 2 ms to minimize.
[2024-06-01 05:07:55] [INFO ] Deduced a trap composed of 44 places in 328 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 814 unsolved
[2024-06-01 05:07:57] [INFO ] Deduced a trap composed of 46 places in 239 ms of which 2 ms to minimize.
[2024-06-01 05:07:57] [INFO ] Deduced a trap composed of 49 places in 238 ms of which 2 ms to minimize.
[2024-06-01 05:07:57] [INFO ] Deduced a trap composed of 48 places in 236 ms of which 2 ms to minimize.
[2024-06-01 05:07:58] [INFO ] Deduced a trap composed of 31 places in 336 ms of which 4 ms to minimize.
[2024-06-01 05:07:58] [INFO ] Deduced a trap composed of 31 places in 330 ms of which 3 ms to minimize.
[2024-06-01 05:07:58] [INFO ] Deduced a trap composed of 31 places in 328 ms of which 3 ms to minimize.
[2024-06-01 05:07:59] [INFO ] Deduced a trap composed of 57 places in 334 ms of which 3 ms to minimize.
[2024-06-01 05:07:59] [INFO ] Deduced a trap composed of 47 places in 320 ms of which 3 ms to minimize.
[2024-06-01 05:07:59] [INFO ] Deduced a trap composed of 40 places in 297 ms of which 3 ms to minimize.
[2024-06-01 05:08:00] [INFO ] Deduced a trap composed of 53 places in 333 ms of which 2 ms to minimize.
[2024-06-01 05:08:00] [INFO ] Deduced a trap composed of 31 places in 251 ms of which 2 ms to minimize.
[2024-06-01 05:08:01] [INFO ] Deduced a trap composed of 46 places in 233 ms of which 2 ms to minimize.
[2024-06-01 05:08:01] [INFO ] Deduced a trap composed of 52 places in 223 ms of which 2 ms to minimize.
[2024-06-01 05:08:01] [INFO ] Deduced a trap composed of 52 places in 311 ms of which 3 ms to minimize.
[2024-06-01 05:08:02] [INFO ] Deduced a trap composed of 31 places in 310 ms of which 3 ms to minimize.
[2024-06-01 05:08:02] [INFO ] Deduced a trap composed of 57 places in 321 ms of which 3 ms to minimize.
[2024-06-01 05:08:03] [INFO ] Deduced a trap composed of 32 places in 299 ms of which 2 ms to minimize.
[2024-06-01 05:08:03] [INFO ] Deduced a trap composed of 48 places in 237 ms of which 2 ms to minimize.
[2024-06-01 05:08:03] [INFO ] Deduced a trap composed of 46 places in 223 ms of which 2 ms to minimize.
[2024-06-01 05:08:03] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 814 unsolved
[2024-06-01 05:08:05] [INFO ] Deduced a trap composed of 31 places in 278 ms of which 3 ms to minimize.
[2024-06-01 05:08:05] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 1 ms to minimize.
[2024-06-01 05:08:06] [INFO ] Deduced a trap composed of 44 places in 252 ms of which 2 ms to minimize.
[2024-06-01 05:08:06] [INFO ] Deduced a trap composed of 47 places in 215 ms of which 2 ms to minimize.
[2024-06-01 05:08:06] [INFO ] Deduced a trap composed of 46 places in 239 ms of which 2 ms to minimize.
[2024-06-01 05:08:07] [INFO ] Deduced a trap composed of 48 places in 229 ms of which 2 ms to minimize.
[2024-06-01 05:08:07] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 2 ms to minimize.
[2024-06-01 05:08:07] [INFO ] Deduced a trap composed of 49 places in 220 ms of which 2 ms to minimize.
[2024-06-01 05:08:08] [INFO ] Deduced a trap composed of 45 places in 214 ms of which 2 ms to minimize.
[2024-06-01 05:08:08] [INFO ] Deduced a trap composed of 46 places in 230 ms of which 2 ms to minimize.
[2024-06-01 05:08:08] [INFO ] Deduced a trap composed of 48 places in 223 ms of which 2 ms to minimize.
[2024-06-01 05:08:09] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 2 ms to minimize.
[2024-06-01 05:08:09] [INFO ] Deduced a trap composed of 47 places in 267 ms of which 2 ms to minimize.
[2024-06-01 05:08:09] [INFO ] Deduced a trap composed of 48 places in 246 ms of which 2 ms to minimize.
[2024-06-01 05:08:10] [INFO ] Deduced a trap composed of 49 places in 221 ms of which 2 ms to minimize.
[2024-06-01 05:08:10] [INFO ] Deduced a trap composed of 44 places in 212 ms of which 1 ms to minimize.
[2024-06-01 05:08:11] [INFO ] Deduced a trap composed of 46 places in 290 ms of which 2 ms to minimize.
[2024-06-01 05:08:11] [INFO ] Deduced a trap composed of 49 places in 254 ms of which 2 ms to minimize.
SMT process timed out in 66506ms, After SMT, problems are : Problem set: 0 solved, 814 unsolved
Search for dead transitions found 0 dead transitions in 66548ms
Starting structural reductions in LTL mode, iteration 1 : 300/357 places, 815/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68242 ms. Remains : 300/357 places, 815/1128 transitions.
Support contains 21 out of 300 places after structural reductions.
[2024-06-01 05:08:11] [INFO ] Flatten gal took : 220 ms
[2024-06-01 05:08:11] [INFO ] Flatten gal took : 115 ms
[2024-06-01 05:08:12] [INFO ] Input system was already deterministic with 815 transitions.
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 32348 steps (283 resets) in 2022 ms. (15 steps per ms) remains 0/12 properties
FORMULA AutonomousCar-PT-08b-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 49 stabilizing places and 50 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 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 815/815 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 293 transition count 808
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 293 transition count 808
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 291 transition count 806
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 291 transition count 806
Applied a total of 18 rules in 34 ms. Remains 291 /300 variables (removed 9) and now considering 806/815 (removed 9) transitions.
// Phase 1: matrix 806 rows 291 cols
[2024-06-01 05:08:13] [INFO ] Computed 13 invariants in 8 ms
[2024-06-01 05:08:13] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-06-01 05:08:13] [INFO ] Invariant cache hit.
[2024-06-01 05:08:14] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 926 ms to find 0 implicit places.
Running 805 sub problems to find dead transitions.
[2024-06-01 05:08:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:08:31] [INFO ] Deduced a trap composed of 21 places in 482 ms of which 3 ms to minimize.
[2024-06-01 05:08:31] [INFO ] Deduced a trap composed of 14 places in 454 ms of which 4 ms to minimize.
[2024-06-01 05:08:32] [INFO ] Deduced a trap composed of 22 places in 426 ms of which 3 ms to minimize.
[2024-06-01 05:08:32] [INFO ] Deduced a trap composed of 39 places in 431 ms of which 3 ms to minimize.
[2024-06-01 05:08:32] [INFO ] Deduced a trap composed of 35 places in 439 ms of which 3 ms to minimize.
[2024-06-01 05:08:33] [INFO ] Deduced a trap composed of 41 places in 440 ms of which 2 ms to minimize.
[2024-06-01 05:08:33] [INFO ] Deduced a trap composed of 36 places in 423 ms of which 3 ms to minimize.
[2024-06-01 05:08:34] [INFO ] Deduced a trap composed of 45 places in 426 ms of which 3 ms to minimize.
[2024-06-01 05:08:34] [INFO ] Deduced a trap composed of 46 places in 409 ms of which 4 ms to minimize.
[2024-06-01 05:08:35] [INFO ] Deduced a trap composed of 43 places in 407 ms of which 3 ms to minimize.
[2024-06-01 05:08:35] [INFO ] Deduced a trap composed of 53 places in 410 ms of which 3 ms to minimize.
[2024-06-01 05:08:36] [INFO ] Deduced a trap composed of 45 places in 421 ms of which 2 ms to minimize.
[2024-06-01 05:08:36] [INFO ] Deduced a trap composed of 21 places in 412 ms of which 3 ms to minimize.
[2024-06-01 05:08:36] [INFO ] Deduced a trap composed of 23 places in 423 ms of which 3 ms to minimize.
[2024-06-01 05:08:37] [INFO ] Deduced a trap composed of 32 places in 421 ms of which 2 ms to minimize.
[2024-06-01 05:08:37] [INFO ] Deduced a trap composed of 40 places in 409 ms of which 2 ms to minimize.
[2024-06-01 05:08:38] [INFO ] Deduced a trap composed of 43 places in 391 ms of which 3 ms to minimize.
[2024-06-01 05:08:38] [INFO ] Deduced a trap composed of 42 places in 401 ms of which 3 ms to minimize.
[2024-06-01 05:08:39] [INFO ] Deduced a trap composed of 27 places in 426 ms of which 3 ms to minimize.
[2024-06-01 05:08:39] [INFO ] Deduced a trap composed of 34 places in 429 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:08:40] [INFO ] Deduced a trap composed of 56 places in 458 ms of which 3 ms to minimize.
[2024-06-01 05:08:40] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 1 ms to minimize.
[2024-06-01 05:08:41] [INFO ] Deduced a trap composed of 38 places in 469 ms of which 3 ms to minimize.
[2024-06-01 05:08:41] [INFO ] Deduced a trap composed of 46 places in 440 ms of which 4 ms to minimize.
[2024-06-01 05:08:42] [INFO ] Deduced a trap composed of 43 places in 384 ms of which 3 ms to minimize.
[2024-06-01 05:08:42] [INFO ] Deduced a trap composed of 31 places in 429 ms of which 3 ms to minimize.
[2024-06-01 05:08:43] [INFO ] Deduced a trap composed of 32 places in 423 ms of which 2 ms to minimize.
[2024-06-01 05:08:43] [INFO ] Deduced a trap composed of 24 places in 408 ms of which 3 ms to minimize.
[2024-06-01 05:08:44] [INFO ] Deduced a trap composed of 37 places in 442 ms of which 3 ms to minimize.
[2024-06-01 05:08:44] [INFO ] Deduced a trap composed of 44 places in 229 ms of which 3 ms to minimize.
[2024-06-01 05:08:44] [INFO ] Deduced a trap composed of 48 places in 232 ms of which 3 ms to minimize.
[2024-06-01 05:08:44] [INFO ] Deduced a trap composed of 47 places in 210 ms of which 2 ms to minimize.
[2024-06-01 05:08:45] [INFO ] Deduced a trap composed of 46 places in 222 ms of which 2 ms to minimize.
[2024-06-01 05:08:45] [INFO ] Deduced a trap composed of 45 places in 221 ms of which 2 ms to minimize.
[2024-06-01 05:08:45] [INFO ] Deduced a trap composed of 48 places in 217 ms of which 2 ms to minimize.
[2024-06-01 05:08:45] [INFO ] Deduced a trap composed of 43 places in 213 ms of which 2 ms to minimize.
[2024-06-01 05:08:46] [INFO ] Deduced a trap composed of 42 places in 371 ms of which 3 ms to minimize.
[2024-06-01 05:08:46] [INFO ] Deduced a trap composed of 46 places in 249 ms of which 2 ms to minimize.
[2024-06-01 05:08:47] [INFO ] Deduced a trap composed of 45 places in 256 ms of which 2 ms to minimize.
[2024-06-01 05:08:47] [INFO ] Deduced a trap composed of 42 places in 249 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 291/1097 variables, and 53 constraints, problems are : Problem set: 0 solved, 805 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/291 constraints, PredecessorRefiner: 805/805 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 805 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:08:56] [INFO ] Deduced a trap composed of 31 places in 346 ms of which 3 ms to minimize.
[2024-06-01 05:08:57] [INFO ] Deduced a trap composed of 31 places in 357 ms of which 3 ms to minimize.
[2024-06-01 05:08:57] [INFO ] Deduced a trap composed of 23 places in 403 ms of which 2 ms to minimize.
[2024-06-01 05:08:58] [INFO ] Deduced a trap composed of 31 places in 296 ms of which 3 ms to minimize.
[2024-06-01 05:08:58] [INFO ] Deduced a trap composed of 63 places in 284 ms of which 3 ms to minimize.
[2024-06-01 05:08:59] [INFO ] Deduced a trap composed of 47 places in 315 ms of which 3 ms to minimize.
[2024-06-01 05:08:59] [INFO ] Deduced a trap composed of 58 places in 292 ms of which 2 ms to minimize.
[2024-06-01 05:09:00] [INFO ] Deduced a trap composed of 43 places in 377 ms of which 3 ms to minimize.
[2024-06-01 05:09:00] [INFO ] Deduced a trap composed of 31 places in 315 ms of which 3 ms to minimize.
[2024-06-01 05:09:00] [INFO ] Deduced a trap composed of 45 places in 238 ms of which 2 ms to minimize.
[2024-06-01 05:09:01] [INFO ] Deduced a trap composed of 48 places in 232 ms of which 2 ms to minimize.
[2024-06-01 05:09:01] [INFO ] Deduced a trap composed of 47 places in 213 ms of which 2 ms to minimize.
[2024-06-01 05:09:01] [INFO ] Deduced a trap composed of 48 places in 219 ms of which 2 ms to minimize.
[2024-06-01 05:09:01] [INFO ] Deduced a trap composed of 43 places in 224 ms of which 2 ms to minimize.
[2024-06-01 05:09:02] [INFO ] Deduced a trap composed of 47 places in 243 ms of which 2 ms to minimize.
[2024-06-01 05:09:02] [INFO ] Deduced a trap composed of 46 places in 234 ms of which 2 ms to minimize.
[2024-06-01 05:09:02] [INFO ] Deduced a trap composed of 48 places in 236 ms of which 2 ms to minimize.
[2024-06-01 05:09:03] [INFO ] Deduced a trap composed of 43 places in 233 ms of which 1 ms to minimize.
[2024-06-01 05:09:03] [INFO ] Deduced a trap composed of 48 places in 213 ms of which 2 ms to minimize.
[2024-06-01 05:09:03] [INFO ] Deduced a trap composed of 45 places in 282 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:09:05] [INFO ] Deduced a trap composed of 44 places in 319 ms of which 3 ms to minimize.
[2024-06-01 05:09:05] [INFO ] Deduced a trap composed of 42 places in 332 ms of which 3 ms to minimize.
[2024-06-01 05:09:06] [INFO ] Deduced a trap composed of 43 places in 305 ms of which 3 ms to minimize.
[2024-06-01 05:09:06] [INFO ] Deduced a trap composed of 43 places in 266 ms of which 2 ms to minimize.
[2024-06-01 05:09:07] [INFO ] Deduced a trap composed of 47 places in 331 ms of which 2 ms to minimize.
[2024-06-01 05:09:07] [INFO ] Deduced a trap composed of 44 places in 287 ms of which 2 ms to minimize.
[2024-06-01 05:09:07] [INFO ] Deduced a trap composed of 44 places in 259 ms of which 2 ms to minimize.
[2024-06-01 05:09:08] [INFO ] Deduced a trap composed of 44 places in 255 ms of which 2 ms to minimize.
[2024-06-01 05:09:08] [INFO ] Deduced a trap composed of 32 places in 322 ms of which 2 ms to minimize.
[2024-06-01 05:09:09] [INFO ] Deduced a trap composed of 59 places in 343 ms of which 3 ms to minimize.
[2024-06-01 05:09:09] [INFO ] Deduced a trap composed of 44 places in 324 ms of which 3 ms to minimize.
[2024-06-01 05:09:09] [INFO ] Deduced a trap composed of 47 places in 352 ms of which 3 ms to minimize.
[2024-06-01 05:09:10] [INFO ] Deduced a trap composed of 32 places in 311 ms of which 3 ms to minimize.
[2024-06-01 05:09:10] [INFO ] Deduced a trap composed of 44 places in 312 ms of which 3 ms to minimize.
[2024-06-01 05:09:11] [INFO ] Deduced a trap composed of 32 places in 335 ms of which 3 ms to minimize.
[2024-06-01 05:09:11] [INFO ] Deduced a trap composed of 31 places in 358 ms of which 3 ms to minimize.
[2024-06-01 05:09:12] [INFO ] Deduced a trap composed of 47 places in 319 ms of which 2 ms to minimize.
[2024-06-01 05:09:12] [INFO ] Deduced a trap composed of 28 places in 311 ms of which 2 ms to minimize.
[2024-06-01 05:09:12] [INFO ] Deduced a trap composed of 48 places in 330 ms of which 3 ms to minimize.
[2024-06-01 05:09:13] [INFO ] Deduced a trap composed of 46 places in 329 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 805 unsolved
[2024-06-01 05:09:15] [INFO ] Deduced a trap composed of 42 places in 258 ms of which 2 ms to minimize.
[2024-06-01 05:09:15] [INFO ] Deduced a trap composed of 48 places in 275 ms of which 3 ms to minimize.
[2024-06-01 05:09:15] [INFO ] Deduced a trap composed of 47 places in 266 ms of which 2 ms to minimize.
[2024-06-01 05:09:16] [INFO ] Deduced a trap composed of 46 places in 261 ms of which 2 ms to minimize.
[2024-06-01 05:09:16] [INFO ] Deduced a trap composed of 46 places in 246 ms of which 2 ms to minimize.
[2024-06-01 05:09:18] [INFO ] Deduced a trap composed of 15 places in 396 ms of which 3 ms to minimize.
[2024-06-01 05:09:18] [INFO ] Deduced a trap composed of 32 places in 218 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 291/1097 variables, and 100 constraints, problems are : Problem set: 0 solved, 805 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/291 constraints, PredecessorRefiner: 0/805 constraints, Known Traps: 87/87 constraints]
After SMT, in 65764ms problems are : Problem set: 0 solved, 805 unsolved
Search for dead transitions found 0 dead transitions in 65779ms
Starting structural reductions in LTL mode, iteration 1 : 291/300 places, 806/815 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66744 ms. Remains : 291/300 places, 806/815 transitions.
Stuttering acceptance computed with spot in 272 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-08b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLCardinality-01 finished in 67101 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 U (p1||G(p0)))))'
Support contains 3 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 815/815 transitions.
Graph (trivial) has 283 edges and 300 vertex of which 4 / 300 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.
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 297 transition count 701
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 158 rules applied. Total rules applied 270 place count 186 transition count 654
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 298 place count 158 transition count 654
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 298 place count 158 transition count 648
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 310 place count 152 transition count 648
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 316 place count 146 transition count 642
Iterating global reduction 3 with 6 rules applied. Total rules applied 322 place count 146 transition count 642
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 322 place count 146 transition count 641
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 324 place count 145 transition count 641
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 325 place count 144 transition count 633
Iterating global reduction 3 with 1 rules applied. Total rules applied 326 place count 144 transition count 633
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 3 with 2 rules applied. Total rules applied 328 place count 144 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 329 place count 143 transition count 631
Performed 60 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 5 with 120 rules applied. Total rules applied 449 place count 83 transition count 570
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 450 place count 83 transition count 569
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 465 place count 68 transition count 448
Iterating global reduction 6 with 15 rules applied. Total rules applied 480 place count 68 transition count 448
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 486 place count 68 transition count 442
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 490 place count 66 transition count 440
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 491 place count 66 transition count 440
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 493 place count 64 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 494 place count 63 transition count 438
Applied a total of 494 rules in 321 ms. Remains 63 /300 variables (removed 237) and now considering 438/815 (removed 377) transitions.
// Phase 1: matrix 438 rows 63 cols
[2024-06-01 05:09:20] [INFO ] Computed 11 invariants in 11 ms
[2024-06-01 05:09:20] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-06-01 05:09:20] [INFO ] Invariant cache hit.
[2024-06-01 05:09:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 05:09:21] [INFO ] Implicit Places using invariants and state equation in 378 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 587 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/300 places, 438/815 transitions.
Applied a total of 0 rules in 22 ms. Remains 62 /62 variables (removed 0) and now considering 438/438 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 933 ms. Remains : 62/300 places, 438/815 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-08b-LTLCardinality-02
Product exploration explored 100000 steps with 802 reset in 466 ms.
Product exploration explored 100000 steps with 212 reset in 204 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Detected a total of 3/62 stabilizing places and 4/438 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 4 factoid took 433 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 13570 steps (763 resets) in 402 ms. (33 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 541 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 438/438 transitions.
Applied a total of 0 rules in 32 ms. Remains 62 /62 variables (removed 0) and now considering 438/438 (removed 0) transitions.
// Phase 1: matrix 438 rows 62 cols
[2024-06-01 05:09:23] [INFO ] Computed 10 invariants in 4 ms
[2024-06-01 05:09:23] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-06-01 05:09:23] [INFO ] Invariant cache hit.
[2024-06-01 05:09:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:09:24] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2024-06-01 05:09:24] [INFO ] Redundant transitions in 46 ms returned [298]
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 435 sub problems to find dead transitions.
// Phase 1: matrix 437 rows 62 cols
[2024-06-01 05:09:24] [INFO ] Computed 10 invariants in 4 ms
[2024-06-01 05:09:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2024-06-01 05:09:32] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2024-06-01 05:09:32] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 5 (OVERLAPS) 436/497 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2024-06-01 05:09:37] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 2 ms to minimize.
[2024-06-01 05:09:37] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 8 (OVERLAPS) 1/498 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 10 (OVERLAPS) 1/499 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/499 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 12 (OVERLAPS) 0/499 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 435 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 77 constraints, problems are : Problem set: 0 solved, 435 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 435/435 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 435 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 6 (OVERLAPS) 436/497 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 435/510 constraints. Problems are: Problem set: 0 solved, 435 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/499 variables, and 510 constraints, problems are : Problem set: 0 solved, 435 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 61/62 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 435/435 constraints, Known Traps: 4/4 constraints]
After SMT, in 64275ms problems are : Problem set: 0 solved, 435 unsolved
Search for dead transitions found 0 dead transitions in 64281ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/62 places, 437/438 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 20 ms. Remains 61 /62 variables (removed 1) and now considering 436/437 (removed 1) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 64901 ms. Remains : 61/62 places, 436/438 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/61 stabilizing places and 2/436 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 173 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 33100 steps (1989 resets) in 1087 ms. (30 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 315 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 14 reset in 78 ms.
Product exploration explored 100000 steps with 1737 reset in 351 ms.
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 436/436 transitions.
Applied a total of 0 rules in 17 ms. Remains 61 /61 variables (removed 0) and now considering 436/436 (removed 0) transitions.
// Phase 1: matrix 436 rows 61 cols
[2024-06-01 05:10:29] [INFO ] Computed 10 invariants in 4 ms
[2024-06-01 05:10:30] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-06-01 05:10:30] [INFO ] Invariant cache hit.
[2024-06-01 05:10:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:10:30] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2024-06-01 05:10:30] [INFO ] Redundant transitions in 43 ms returned []
Running 435 sub problems to find dead transitions.
[2024-06-01 05:10:30] [INFO ] Invariant cache hit.
[2024-06-01 05:10:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2024-06-01 05:10:38] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 1 ms to minimize.
[2024-06-01 05:10:38] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 5 (OVERLAPS) 435/496 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2024-06-01 05:10:43] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 1 ms to minimize.
[2024-06-01 05:10:43] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 8 (OVERLAPS) 1/497 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/497 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 10 (OVERLAPS) 0/497 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 435 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 76 constraints, problems are : Problem set: 0 solved, 435 unsolved in 21804 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 435/435 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 435 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 6 (OVERLAPS) 435/496 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 435/510 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 435 unsolved
SMT process timed out in 55726ms, After SMT, problems are : Problem set: 0 solved, 435 unsolved
Search for dead transitions found 0 dead transitions in 55731ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56327 ms. Remains : 61/61 places, 436/436 transitions.
Treatment of property AutonomousCar-PT-08b-LTLCardinality-02 finished in 125908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 815/815 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 294 transition count 809
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 294 transition count 809
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 292 transition count 807
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 292 transition count 807
Applied a total of 16 rules in 16 ms. Remains 292 /300 variables (removed 8) and now considering 807/815 (removed 8) transitions.
// Phase 1: matrix 807 rows 292 cols
[2024-06-01 05:11:26] [INFO ] Computed 13 invariants in 7 ms
[2024-06-01 05:11:26] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-06-01 05:11:26] [INFO ] Invariant cache hit.
[2024-06-01 05:11:27] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
Running 806 sub problems to find dead transitions.
[2024-06-01 05:11:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 806 unsolved
At refinement iteration 1 (OVERLAPS) 1/292 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 806 unsolved
[2024-06-01 05:11:43] [INFO ] Deduced a trap composed of 21 places in 468 ms of which 3 ms to minimize.
[2024-06-01 05:11:43] [INFO ] Deduced a trap composed of 14 places in 470 ms of which 3 ms to minimize.
[2024-06-01 05:11:44] [INFO ] Deduced a trap composed of 55 places in 427 ms of which 3 ms to minimize.
[2024-06-01 05:11:44] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 1 ms to minimize.
[2024-06-01 05:11:44] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 2 ms to minimize.
[2024-06-01 05:11:45] [INFO ] Deduced a trap composed of 38 places in 458 ms of which 3 ms to minimize.
[2024-06-01 05:11:45] [INFO ] Deduced a trap composed of 39 places in 407 ms of which 3 ms to minimize.
[2024-06-01 05:11:45] [INFO ] Deduced a trap composed of 43 places in 410 ms of which 3 ms to minimize.
[2024-06-01 05:11:46] [INFO ] Deduced a trap composed of 41 places in 401 ms of which 3 ms to minimize.
[2024-06-01 05:11:46] [INFO ] Deduced a trap composed of 49 places in 400 ms of which 3 ms to minimize.
[2024-06-01 05:11:47] [INFO ] Deduced a trap composed of 45 places in 429 ms of which 3 ms to minimize.
[2024-06-01 05:11:47] [INFO ] Deduced a trap composed of 44 places in 431 ms of which 3 ms to minimize.
[2024-06-01 05:11:48] [INFO ] Deduced a trap composed of 48 places in 436 ms of which 3 ms to minimize.
[2024-06-01 05:11:48] [INFO ] Deduced a trap composed of 48 places in 447 ms of which 3 ms to minimize.
[2024-06-01 05:11:49] [INFO ] Deduced a trap composed of 31 places in 445 ms of which 3 ms to minimize.
[2024-06-01 05:11:49] [INFO ] Deduced a trap composed of 42 places in 504 ms of which 3 ms to minimize.
[2024-06-01 05:11:50] [INFO ] Deduced a trap composed of 24 places in 444 ms of which 3 ms to minimize.
[2024-06-01 05:11:50] [INFO ] Deduced a trap composed of 42 places in 433 ms of which 3 ms to minimize.
[2024-06-01 05:11:51] [INFO ] Deduced a trap composed of 44 places in 284 ms of which 3 ms to minimize.
[2024-06-01 05:11:51] [INFO ] Deduced a trap composed of 42 places in 276 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 806 unsolved
[2024-06-01 05:11:52] [INFO ] Deduced a trap composed of 40 places in 424 ms of which 3 ms to minimize.
[2024-06-01 05:11:53] [INFO ] Deduced a trap composed of 36 places in 385 ms of which 2 ms to minimize.
[2024-06-01 05:11:53] [INFO ] Deduced a trap composed of 38 places in 404 ms of which 3 ms to minimize.
[2024-06-01 05:11:53] [INFO ] Deduced a trap composed of 36 places in 367 ms of which 3 ms to minimize.
[2024-06-01 05:11:54] [INFO ] Deduced a trap composed of 45 places in 376 ms of which 3 ms to minimize.
[2024-06-01 05:11:54] [INFO ] Deduced a trap composed of 43 places in 389 ms of which 3 ms to minimize.
[2024-06-01 05:11:55] [INFO ] Deduced a trap composed of 32 places in 360 ms of which 2 ms to minimize.
[2024-06-01 05:11:55] [INFO ] Deduced a trap composed of 49 places in 345 ms of which 2 ms to minimize.
[2024-06-01 05:11:55] [INFO ] Deduced a trap composed of 49 places in 307 ms of which 3 ms to minimize.
[2024-06-01 05:11:56] [INFO ] Deduced a trap composed of 23 places in 297 ms of which 3 ms to minimize.
[2024-06-01 05:11:56] [INFO ] Deduced a trap composed of 21 places in 301 ms of which 3 ms to minimize.
[2024-06-01 05:11:56] [INFO ] Deduced a trap composed of 32 places in 306 ms of which 3 ms to minimize.
[2024-06-01 05:11:56] [INFO ] Deduced a trap composed of 32 places in 305 ms of which 3 ms to minimize.
[2024-06-01 05:11:57] [INFO ] Deduced a trap composed of 32 places in 284 ms of which 3 ms to minimize.
[2024-06-01 05:11:57] [INFO ] Deduced a trap composed of 46 places in 280 ms of which 2 ms to minimize.
[2024-06-01 05:11:58] [INFO ] Deduced a trap composed of 44 places in 259 ms of which 2 ms to minimize.
[2024-06-01 05:11:58] [INFO ] Deduced a trap composed of 45 places in 266 ms of which 2 ms to minimize.
[2024-06-01 05:11:58] [INFO ] Deduced a trap composed of 48 places in 277 ms of which 2 ms to minimize.
[2024-06-01 05:11:58] [INFO ] Deduced a trap composed of 43 places in 262 ms of which 3 ms to minimize.
[2024-06-01 05:11:59] [INFO ] Deduced a trap composed of 47 places in 267 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 292/1099 variables, and 53 constraints, problems are : Problem set: 0 solved, 806 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/292 constraints, PredecessorRefiner: 806/806 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 806 unsolved
At refinement iteration 1 (OVERLAPS) 1/292 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 806 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 806 unsolved
[2024-06-01 05:12:09] [INFO ] Deduced a trap composed of 70 places in 455 ms of which 2 ms to minimize.
[2024-06-01 05:12:09] [INFO ] Deduced a trap composed of 23 places in 335 ms of which 3 ms to minimize.
[2024-06-01 05:12:09] [INFO ] Deduced a trap composed of 31 places in 321 ms of which 3 ms to minimize.
[2024-06-01 05:12:10] [INFO ] Deduced a trap composed of 31 places in 326 ms of which 2 ms to minimize.
[2024-06-01 05:12:10] [INFO ] Deduced a trap composed of 24 places in 321 ms of which 2 ms to minimize.
[2024-06-01 05:12:11] [INFO ] Deduced a trap composed of 34 places in 341 ms of which 5 ms to minimize.
[2024-06-01 05:12:11] [INFO ] Deduced a trap composed of 27 places in 328 ms of which 3 ms to minimize.
[2024-06-01 05:12:12] [INFO ] Deduced a trap composed of 57 places in 309 ms of which 2 ms to minimize.
[2024-06-01 05:12:12] [INFO ] Deduced a trap composed of 31 places in 320 ms of which 3 ms to minimize.
[2024-06-01 05:12:13] [INFO ] Deduced a trap composed of 42 places in 226 ms of which 2 ms to minimize.
[2024-06-01 05:12:13] [INFO ] Deduced a trap composed of 47 places in 212 ms of which 2 ms to minimize.
[2024-06-01 05:12:13] [INFO ] Deduced a trap composed of 45 places in 218 ms of which 2 ms to minimize.
[2024-06-01 05:12:13] [INFO ] Deduced a trap composed of 48 places in 206 ms of which 2 ms to minimize.
[2024-06-01 05:12:13] [INFO ] Deduced a trap composed of 48 places in 199 ms of which 2 ms to minimize.
[2024-06-01 05:12:14] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 1 ms to minimize.
[2024-06-01 05:12:14] [INFO ] Deduced a trap composed of 49 places in 307 ms of which 3 ms to minimize.
[2024-06-01 05:12:14] [INFO ] Deduced a trap composed of 46 places in 309 ms of which 3 ms to minimize.
[2024-06-01 05:12:15] [INFO ] Deduced a trap composed of 32 places in 295 ms of which 2 ms to minimize.
[2024-06-01 05:12:15] [INFO ] Deduced a trap composed of 52 places in 359 ms of which 3 ms to minimize.
[2024-06-01 05:12:15] [INFO ] Deduced a trap composed of 42 places in 265 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 806 unsolved
[2024-06-01 05:12:18] [INFO ] Deduced a trap composed of 38 places in 394 ms of which 3 ms to minimize.
[2024-06-01 05:12:18] [INFO ] Deduced a trap composed of 22 places in 384 ms of which 4 ms to minimize.
[2024-06-01 05:12:19] [INFO ] Deduced a trap composed of 48 places in 371 ms of which 6 ms to minimize.
[2024-06-01 05:12:19] [INFO ] Deduced a trap composed of 45 places in 316 ms of which 2 ms to minimize.
[2024-06-01 05:12:20] [INFO ] Deduced a trap composed of 47 places in 279 ms of which 2 ms to minimize.
[2024-06-01 05:12:20] [INFO ] Deduced a trap composed of 45 places in 256 ms of which 2 ms to minimize.
[2024-06-01 05:12:21] [INFO ] Deduced a trap composed of 46 places in 283 ms of which 2 ms to minimize.
[2024-06-01 05:12:21] [INFO ] Deduced a trap composed of 45 places in 258 ms of which 2 ms to minimize.
[2024-06-01 05:12:21] [INFO ] Deduced a trap composed of 45 places in 248 ms of which 2 ms to minimize.
[2024-06-01 05:12:22] [INFO ] Deduced a trap composed of 65 places in 335 ms of which 3 ms to minimize.
[2024-06-01 05:12:22] [INFO ] Deduced a trap composed of 48 places in 327 ms of which 3 ms to minimize.
[2024-06-01 05:12:23] [INFO ] Deduced a trap composed of 47 places in 312 ms of which 2 ms to minimize.
[2024-06-01 05:12:23] [INFO ] Deduced a trap composed of 46 places in 275 ms of which 2 ms to minimize.
[2024-06-01 05:12:23] [INFO ] Deduced a trap composed of 48 places in 263 ms of which 2 ms to minimize.
[2024-06-01 05:12:24] [INFO ] Deduced a trap composed of 43 places in 243 ms of which 2 ms to minimize.
[2024-06-01 05:12:24] [INFO ] Deduced a trap composed of 6 places in 387 ms of which 3 ms to minimize.
[2024-06-01 05:12:25] [INFO ] Deduced a trap composed of 11 places in 396 ms of which 2 ms to minimize.
[2024-06-01 05:12:25] [INFO ] Deduced a trap composed of 20 places in 250 ms of which 3 ms to minimize.
[2024-06-01 05:12:25] [INFO ] Deduced a trap composed of 18 places in 244 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 19/92 constraints. Problems are: Problem set: 0 solved, 806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 292/1099 variables, and 92 constraints, problems are : Problem set: 0 solved, 806 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/292 constraints, PredecessorRefiner: 0/806 constraints, Known Traps: 79/79 constraints]
After SMT, in 65225ms problems are : Problem set: 0 solved, 806 unsolved
Search for dead transitions found 0 dead transitions in 65235ms
Starting structural reductions in LTL mode, iteration 1 : 292/300 places, 807/815 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66102 ms. Remains : 292/300 places, 807/815 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLCardinality-05
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLCardinality-05 finished in 66198 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))'
Support contains 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 815/815 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 294 transition count 809
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 294 transition count 809
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 292 transition count 807
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 292 transition count 807
Applied a total of 16 rules in 17 ms. Remains 292 /300 variables (removed 8) and now considering 807/815 (removed 8) transitions.
// Phase 1: matrix 807 rows 292 cols
[2024-06-01 05:12:32] [INFO ] Computed 13 invariants in 7 ms
[2024-06-01 05:12:32] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-06-01 05:12:32] [INFO ] Invariant cache hit.
[2024-06-01 05:12:33] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
Running 806 sub problems to find dead transitions.
[2024-06-01 05:12:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 806 unsolved
At refinement iteration 1 (OVERLAPS) 1/292 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 806 unsolved
[2024-06-01 05:12:49] [INFO ] Deduced a trap composed of 17 places in 482 ms of which 4 ms to minimize.
[2024-06-01 05:12:49] [INFO ] Deduced a trap composed of 77 places in 350 ms of which 3 ms to minimize.
[2024-06-01 05:12:49] [INFO ] Deduced a trap composed of 40 places in 370 ms of which 3 ms to minimize.
[2024-06-01 05:12:50] [INFO ] Deduced a trap composed of 37 places in 372 ms of which 2 ms to minimize.
[2024-06-01 05:12:50] [INFO ] Deduced a trap composed of 41 places in 433 ms of which 3 ms to minimize.
[2024-06-01 05:12:51] [INFO ] Deduced a trap composed of 46 places in 375 ms of which 3 ms to minimize.
[2024-06-01 05:12:51] [INFO ] Deduced a trap composed of 42 places in 386 ms of which 2 ms to minimize.
[2024-06-01 05:12:51] [INFO ] Deduced a trap composed of 46 places in 372 ms of which 3 ms to minimize.
[2024-06-01 05:12:52] [INFO ] Deduced a trap composed of 53 places in 389 ms of which 3 ms to minimize.
[2024-06-01 05:12:52] [INFO ] Deduced a trap composed of 43 places in 414 ms of which 3 ms to minimize.
[2024-06-01 05:12:53] [INFO ] Deduced a trap composed of 21 places in 390 ms of which 2 ms to minimize.
[2024-06-01 05:12:53] [INFO ] Deduced a trap composed of 39 places in 394 ms of which 2 ms to minimize.
[2024-06-01 05:12:54] [INFO ] Deduced a trap composed of 48 places in 473 ms of which 2 ms to minimize.
[2024-06-01 05:12:54] [INFO ] Deduced a trap composed of 50 places in 377 ms of which 2 ms to minimize.
[2024-06-01 05:12:54] [INFO ] Deduced a trap composed of 48 places in 365 ms of which 3 ms to minimize.
[2024-06-01 05:12:55] [INFO ] Deduced a trap composed of 32 places in 390 ms of which 2 ms to minimize.
[2024-06-01 05:12:56] [INFO ] Deduced a trap composed of 38 places in 459 ms of which 3 ms to minimize.
[2024-06-01 05:12:56] [INFO ] Deduced a trap composed of 31 places in 444 ms of which 3 ms to minimize.
[2024-06-01 05:12:56] [INFO ] Deduced a trap composed of 31 places in 396 ms of which 3 ms to minimize.
[2024-06-01 05:12:57] [INFO ] Deduced a trap composed of 46 places in 373 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 806 unsolved
[2024-06-01 05:12:58] [INFO ] Deduced a trap composed of 14 places in 444 ms of which 3 ms to minimize.
[2024-06-01 05:12:58] [INFO ] Deduced a trap composed of 26 places in 392 ms of which 2 ms to minimize.
[2024-06-01 05:12:59] [INFO ] Deduced a trap composed of 43 places in 438 ms of which 3 ms to minimize.
[2024-06-01 05:12:59] [INFO ] Deduced a trap composed of 37 places in 426 ms of which 3 ms to minimize.
[2024-06-01 05:13:00] [INFO ] Deduced a trap composed of 41 places in 393 ms of which 3 ms to minimize.
[2024-06-01 05:13:00] [INFO ] Deduced a trap composed of 50 places in 400 ms of which 3 ms to minimize.
[2024-06-01 05:13:00] [INFO ] Deduced a trap composed of 47 places in 395 ms of which 2 ms to minimize.
[2024-06-01 05:13:01] [INFO ] Deduced a trap composed of 71 places in 386 ms of which 3 ms to minimize.
[2024-06-01 05:13:01] [INFO ] Deduced a trap composed of 48 places in 386 ms of which 3 ms to minimize.
[2024-06-01 05:13:02] [INFO ] Deduced a trap composed of 61 places in 412 ms of which 3 ms to minimize.
[2024-06-01 05:13:02] [INFO ] Deduced a trap composed of 56 places in 395 ms of which 3 ms to minimize.
[2024-06-01 05:13:03] [INFO ] Deduced a trap composed of 32 places in 381 ms of which 3 ms to minimize.
[2024-06-01 05:13:04] [INFO ] Deduced a trap composed of 43 places in 432 ms of which 3 ms to minimize.
[2024-06-01 05:13:04] [INFO ] Deduced a trap composed of 42 places in 317 ms of which 2 ms to minimize.
[2024-06-01 05:13:05] [INFO ] Deduced a trap composed of 45 places in 405 ms of which 3 ms to minimize.
[2024-06-01 05:13:05] [INFO ] Deduced a trap composed of 48 places in 393 ms of which 2 ms to minimize.
[2024-06-01 05:13:06] [INFO ] Deduced a trap composed of 62 places in 378 ms of which 3 ms to minimize.
[2024-06-01 05:13:06] [INFO ] Deduced a trap composed of 45 places in 356 ms of which 2 ms to minimize.
[2024-06-01 05:13:06] [INFO ] Deduced a trap composed of 45 places in 331 ms of which 3 ms to minimize.
[2024-06-01 05:13:07] [INFO ] Deduced a trap composed of 45 places in 319 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 292/1099 variables, and 53 constraints, problems are : Problem set: 0 solved, 806 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/292 constraints, PredecessorRefiner: 806/806 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 806 unsolved
At refinement iteration 1 (OVERLAPS) 1/292 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 806 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 806 unsolved
[2024-06-01 05:13:14] [INFO ] Deduced a trap composed of 31 places in 378 ms of which 3 ms to minimize.
[2024-06-01 05:13:15] [INFO ] Deduced a trap composed of 31 places in 337 ms of which 2 ms to minimize.
[2024-06-01 05:13:15] [INFO ] Deduced a trap composed of 31 places in 325 ms of which 3 ms to minimize.
[2024-06-01 05:13:15] [INFO ] Deduced a trap composed of 31 places in 310 ms of which 2 ms to minimize.
[2024-06-01 05:13:16] [INFO ] Deduced a trap composed of 31 places in 294 ms of which 2 ms to minimize.
[2024-06-01 05:13:16] [INFO ] Deduced a trap composed of 24 places in 302 ms of which 2 ms to minimize.
[2024-06-01 05:13:17] [INFO ] Deduced a trap composed of 23 places in 419 ms of which 2 ms to minimize.
[2024-06-01 05:13:18] [INFO ] Deduced a trap composed of 45 places in 271 ms of which 2 ms to minimize.
[2024-06-01 05:13:18] [INFO ] Deduced a trap composed of 39 places in 267 ms of which 2 ms to minimize.
[2024-06-01 05:13:18] [INFO ] Deduced a trap composed of 48 places in 265 ms of which 3 ms to minimize.
[2024-06-01 05:13:18] [INFO ] Deduced a trap composed of 43 places in 244 ms of which 2 ms to minimize.
[2024-06-01 05:13:19] [INFO ] Deduced a trap composed of 44 places in 325 ms of which 3 ms to minimize.
[2024-06-01 05:13:20] [INFO ] Deduced a trap composed of 65 places in 332 ms of which 3 ms to minimize.
[2024-06-01 05:13:20] [INFO ] Deduced a trap composed of 45 places in 310 ms of which 2 ms to minimize.
[2024-06-01 05:13:20] [INFO ] Deduced a trap composed of 38 places in 326 ms of which 3 ms to minimize.
[2024-06-01 05:13:21] [INFO ] Deduced a trap composed of 44 places in 318 ms of which 3 ms to minimize.
[2024-06-01 05:13:21] [INFO ] Deduced a trap composed of 43 places in 265 ms of which 2 ms to minimize.
[2024-06-01 05:13:21] [INFO ] Deduced a trap composed of 43 places in 249 ms of which 2 ms to minimize.
[2024-06-01 05:13:21] [INFO ] Deduced a trap composed of 48 places in 254 ms of which 2 ms to minimize.
[2024-06-01 05:13:22] [INFO ] Deduced a trap composed of 38 places in 248 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 806 unsolved
[2024-06-01 05:13:22] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 1 ms to minimize.
[2024-06-01 05:13:23] [INFO ] Deduced a trap composed of 31 places in 343 ms of which 2 ms to minimize.
[2024-06-01 05:13:23] [INFO ] Deduced a trap composed of 31 places in 339 ms of which 2 ms to minimize.
[2024-06-01 05:13:24] [INFO ] Deduced a trap composed of 31 places in 334 ms of which 2 ms to minimize.
[2024-06-01 05:13:24] [INFO ] Deduced a trap composed of 49 places in 339 ms of which 2 ms to minimize.
[2024-06-01 05:13:24] [INFO ] Deduced a trap composed of 29 places in 315 ms of which 2 ms to minimize.
[2024-06-01 05:13:25] [INFO ] Deduced a trap composed of 32 places in 309 ms of which 2 ms to minimize.
[2024-06-01 05:13:25] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 2 ms to minimize.
[2024-06-01 05:13:26] [INFO ] Deduced a trap composed of 73 places in 396 ms of which 3 ms to minimize.
[2024-06-01 05:13:26] [INFO ] Deduced a trap composed of 45 places in 262 ms of which 2 ms to minimize.
[2024-06-01 05:13:26] [INFO ] Deduced a trap composed of 48 places in 238 ms of which 2 ms to minimize.
[2024-06-01 05:13:26] [INFO ] Deduced a trap composed of 47 places in 239 ms of which 2 ms to minimize.
[2024-06-01 05:13:27] [INFO ] Deduced a trap composed of 46 places in 232 ms of which 1 ms to minimize.
[2024-06-01 05:13:27] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 2 ms to minimize.
[2024-06-01 05:13:27] [INFO ] Deduced a trap composed of 43 places in 229 ms of which 1 ms to minimize.
[2024-06-01 05:13:28] [INFO ] Deduced a trap composed of 53 places in 243 ms of which 2 ms to minimize.
[2024-06-01 05:13:28] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 2 ms to minimize.
[2024-06-01 05:13:28] [INFO ] Deduced a trap composed of 49 places in 215 ms of which 2 ms to minimize.
[2024-06-01 05:13:28] [INFO ] Deduced a trap composed of 47 places in 207 ms of which 2 ms to minimize.
[2024-06-01 05:13:29] [INFO ] Deduced a trap composed of 47 places in 217 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 806 unsolved
[2024-06-01 05:13:30] [INFO ] Deduced a trap composed of 45 places in 271 ms of which 2 ms to minimize.
[2024-06-01 05:13:31] [INFO ] Deduced a trap composed of 48 places in 239 ms of which 1 ms to minimize.
[2024-06-01 05:13:31] [INFO ] Deduced a trap composed of 48 places in 223 ms of which 1 ms to minimize.
[2024-06-01 05:13:31] [INFO ] Deduced a trap composed of 49 places in 234 ms of which 2 ms to minimize.
[2024-06-01 05:13:32] [INFO ] Deduced a trap composed of 46 places in 295 ms of which 2 ms to minimize.
[2024-06-01 05:13:33] [INFO ] Deduced a trap composed of 48 places in 286 ms of which 2 ms to minimize.
[2024-06-01 05:13:33] [INFO ] Deduced a trap composed of 48 places in 279 ms of which 2 ms to minimize.
[2024-06-01 05:13:33] [INFO ] Deduced a trap composed of 43 places in 263 ms of which 2 ms to minimize.
[2024-06-01 05:13:34] [INFO ] Deduced a trap composed of 32 places in 447 ms of which 3 ms to minimize.
[2024-06-01 05:13:34] [INFO ] Deduced a trap composed of 42 places in 287 ms of which 2 ms to minimize.
[2024-06-01 05:13:35] [INFO ] Deduced a trap composed of 44 places in 223 ms of which 1 ms to minimize.
[2024-06-01 05:13:35] [INFO ] Deduced a trap composed of 32 places in 411 ms of which 2 ms to minimize.
[2024-06-01 05:13:36] [INFO ] Deduced a trap composed of 31 places in 326 ms of which 3 ms to minimize.
[2024-06-01 05:13:36] [INFO ] Deduced a trap composed of 48 places in 254 ms of which 2 ms to minimize.
[2024-06-01 05:13:36] [INFO ] Deduced a trap composed of 47 places in 256 ms of which 2 ms to minimize.
[2024-06-01 05:13:36] [INFO ] Deduced a trap composed of 51 places in 235 ms of which 2 ms to minimize.
[2024-06-01 05:13:37] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 2 ms to minimize.
[2024-06-01 05:13:37] [INFO ] Deduced a trap composed of 48 places in 209 ms of which 2 ms to minimize.
[2024-06-01 05:13:37] [INFO ] Deduced a trap composed of 32 places in 364 ms of which 3 ms to minimize.
[2024-06-01 05:13:38] [INFO ] Deduced a trap composed of 46 places in 249 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 292/1099 variables, and 113 constraints, problems are : Problem set: 0 solved, 806 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/292 constraints, PredecessorRefiner: 0/806 constraints, Known Traps: 100/100 constraints]
After SMT, in 64933ms problems are : Problem set: 0 solved, 806 unsolved
Search for dead transitions found 0 dead transitions in 64946ms
Starting structural reductions in LTL mode, iteration 1 : 292/300 places, 807/815 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65809 ms. Remains : 292/300 places, 807/815 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutonomousCar-PT-08b-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 679 ms.
Product exploration explored 100000 steps with 50000 reset in 164 ms.
Computed a total of 45 stabilizing places and 46 stable transitions
Computed a total of 45 stabilizing places and 46 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-08b-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-08b-LTLCardinality-07 finished in 66780 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!p0) U p1))))'
Support contains 4 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 815/815 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 294 transition count 809
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 294 transition count 809
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 292 transition count 807
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 292 transition count 807
Applied a total of 16 rules in 17 ms. Remains 292 /300 variables (removed 8) and now considering 807/815 (removed 8) transitions.
// Phase 1: matrix 807 rows 292 cols
[2024-06-01 05:13:39] [INFO ] Computed 13 invariants in 6 ms
[2024-06-01 05:13:39] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-06-01 05:13:39] [INFO ] Invariant cache hit.
[2024-06-01 05:13:40] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
Running 806 sub problems to find dead transitions.
[2024-06-01 05:13:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 806 unsolved
At refinement iteration 1 (OVERLAPS) 1/292 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 806 unsolved
[2024-06-01 05:13:57] [INFO ] Deduced a trap composed of 21 places in 727 ms of which 5 ms to minimize.
[2024-06-01 05:13:58] [INFO ] Deduced a trap composed of 14 places in 741 ms of which 5 ms to minimize.
[2024-06-01 05:13:59] [INFO ] Deduced a trap composed of 72 places in 608 ms of which 4 ms to minimize.
[2024-06-01 05:13:59] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 2 ms to minimize.
[2024-06-01 05:13:59] [INFO ] Deduced a trap composed of 64 places in 583 ms of which 5 ms to minimize.
[2024-06-01 05:14:00] [INFO ] Deduced a trap composed of 67 places in 405 ms of which 3 ms to minimize.
[2024-06-01 05:14:00] [INFO ] Deduced a trap composed of 55 places in 487 ms of which 4 ms to minimize.
[2024-06-01 05:14:01] [INFO ] Deduced a trap composed of 40 places in 652 ms of which 5 ms to minimize.
[2024-06-01 05:14:02] [INFO ] Deduced a trap composed of 26 places in 718 ms of which 5 ms to minimize.
[2024-06-01 05:14:03] [INFO ] Deduced a trap composed of 37 places in 617 ms of which 4 ms to minimize.
[2024-06-01 05:14:04] [INFO ] Deduced a trap composed of 36 places in 586 ms of which 4 ms to minimize.
[2024-06-01 05:14:04] [INFO ] Deduced a trap composed of 41 places in 636 ms of which 4 ms to minimize.
[2024-06-01 05:14:05] [INFO ] Deduced a trap composed of 39 places in 588 ms of which 3 ms to minimize.
[2024-06-01 05:14:05] [INFO ] Deduced a trap composed of 39 places in 626 ms of which 5 ms to minimize.
[2024-06-01 05:14:06] [INFO ] Deduced a trap composed of 42 places in 645 ms of which 5 ms to minimize.
[2024-06-01 05:14:07] [INFO ] Deduced a trap composed of 45 places in 661 ms of which 4 ms to minimize.
[2024-06-01 05:14:07] [INFO ] Deduced a trap composed of 50 places in 630 ms of which 4 ms to minimize.
[2024-06-01 05:14:08] [INFO ] Deduced a trap composed of 45 places in 709 ms of which 4 ms to minimize.
[2024-06-01 05:14:09] [INFO ] Deduced a trap composed of 31 places in 706 ms of which 5 ms to minimize.
[2024-06-01 05:14:10] [INFO ] Deduced a trap composed of 31 places in 678 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 806 unsolved
[2024-06-01 05:14:11] [INFO ] Deduced a trap composed of 40 places in 643 ms of which 4 ms to minimize.
[2024-06-01 05:14:12] [INFO ] Deduced a trap composed of 83 places in 796 ms of which 4 ms to minimize.
[2024-06-01 05:14:13] [INFO ] Deduced a trap composed of 51 places in 717 ms of which 4 ms to minimize.
[2024-06-01 05:14:14] [INFO ] Deduced a trap composed of 44 places in 710 ms of which 4 ms to minimize.
[2024-06-01 05:14:14] [INFO ] Deduced a trap composed of 31 places in 683 ms of which 5 ms to minimize.
[2024-06-01 05:14:15] [INFO ] Deduced a trap composed of 23 places in 585 ms of which 3 ms to minimize.
SMT process timed out in 35102ms, After SMT, problems are : Problem set: 0 solved, 806 unsolved
Search for dead transitions found 0 dead transitions in 35111ms
Starting structural reductions in LTL mode, iteration 1 : 292/300 places, 807/815 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36022 ms. Remains : 292/300 places, 807/815 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : AutonomousCar-PT-08b-LTLCardinality-09
Product exploration explored 100000 steps with 33333 reset in 144 ms.
Product exploration explored 100000 steps with 33333 reset in 157 ms.
Computed a total of 45 stabilizing places and 46 stable transitions
Computed a total of 45 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-08b-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-08b-LTLCardinality-09 finished in 36559 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 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 815/815 transitions.
Graph (trivial) has 284 edges and 300 vertex of which 4 / 300 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 297 transition count 702
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 157 rules applied. Total rules applied 268 place count 187 transition count 655
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 296 place count 159 transition count 655
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 296 place count 159 transition count 648
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 310 place count 152 transition count 648
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 316 place count 146 transition count 642
Iterating global reduction 3 with 6 rules applied. Total rules applied 322 place count 146 transition count 642
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 322 place count 146 transition count 641
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 324 place count 145 transition count 641
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 325 place count 144 transition count 633
Iterating global reduction 3 with 1 rules applied. Total rules applied 326 place count 144 transition count 633
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 3 with 2 rules applied. Total rules applied 328 place count 144 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 329 place count 143 transition count 631
Performed 62 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 124 rules applied. Total rules applied 453 place count 81 transition count 568
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 454 place count 81 transition count 567
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 468 place count 67 transition count 454
Iterating global reduction 6 with 14 rules applied. Total rules applied 482 place count 67 transition count 454
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 487 place count 67 transition count 449
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 7 with 4 rules applied. Total rules applied 491 place count 65 transition count 447
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 493 place count 63 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 494 place count 62 transition count 445
Applied a total of 494 rules in 168 ms. Remains 62 /300 variables (removed 238) and now considering 445/815 (removed 370) transitions.
// Phase 1: matrix 445 rows 62 cols
[2024-06-01 05:14:16] [INFO ] Computed 11 invariants in 3 ms
[2024-06-01 05:14:16] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-06-01 05:14:16] [INFO ] Invariant cache hit.
[2024-06-01 05:14:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 05:14:16] [INFO ] Implicit Places using invariants and state equation in 438 ms returned [57, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 722 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/300 places, 445/815 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 59 transition count 444
Applied a total of 2 rules in 32 ms. Remains 59 /60 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 59 cols
[2024-06-01 05:14:16] [INFO ] Computed 9 invariants in 5 ms
[2024-06-01 05:14:17] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-06-01 05:14:17] [INFO ] Invariant cache hit.
[2024-06-01 05:14:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:14:17] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/300 places, 444/815 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1545 ms. Remains : 59/300 places, 444/815 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLCardinality-11
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLCardinality-11 finished in 1650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 815/815 transitions.
Graph (trivial) has 284 edges and 300 vertex of which 4 / 300 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 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 110 place count 297 transition count 703
Reduce places removed 109 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 156 rules applied. Total rules applied 266 place count 188 transition count 656
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 294 place count 160 transition count 656
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 294 place count 160 transition count 648
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 310 place count 152 transition count 648
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 316 place count 146 transition count 642
Iterating global reduction 3 with 6 rules applied. Total rules applied 322 place count 146 transition count 642
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 322 place count 146 transition count 641
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 324 place count 145 transition count 641
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 326 place count 143 transition count 625
Iterating global reduction 3 with 2 rules applied. Total rules applied 328 place count 143 transition count 625
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 332 place count 143 transition count 621
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 334 place count 141 transition count 621
Performed 61 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 5 with 122 rules applied. Total rules applied 456 place count 80 transition count 559
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 457 place count 80 transition count 558
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 472 place count 65 transition count 437
Iterating global reduction 6 with 15 rules applied. Total rules applied 487 place count 65 transition count 437
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 493 place count 65 transition count 431
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 497 place count 63 transition count 429
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 499 place count 61 transition count 427
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 500 place count 60 transition count 427
Applied a total of 500 rules in 177 ms. Remains 60 /300 variables (removed 240) and now considering 427/815 (removed 388) transitions.
// Phase 1: matrix 427 rows 60 cols
[2024-06-01 05:14:17] [INFO ] Computed 11 invariants in 4 ms
[2024-06-01 05:14:17] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-06-01 05:14:17] [INFO ] Invariant cache hit.
[2024-06-01 05:14:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 05:14:18] [INFO ] Implicit Places using invariants and state equation in 444 ms returned [55, 59]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 705 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/300 places, 427/815 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 57 transition count 426
Applied a total of 2 rules in 29 ms. Remains 57 /58 variables (removed 1) and now considering 426/427 (removed 1) transitions.
// Phase 1: matrix 426 rows 57 cols
[2024-06-01 05:14:18] [INFO ] Computed 9 invariants in 4 ms
[2024-06-01 05:14:18] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-06-01 05:14:18] [INFO ] Invariant cache hit.
[2024-06-01 05:14:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:14:19] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/300 places, 426/815 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1548 ms. Remains : 57/300 places, 426/815 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLCardinality-13
Product exploration explored 100000 steps with 40007 reset in 171 ms.
Product exploration explored 100000 steps with 40016 reset in 188 ms.
Computed a total of 3 stabilizing places and 6 stable transitions
Computed a total of 3 stabilizing places and 6 stable transitions
Detected a total of 3/57 stabilizing places and 6/426 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 255 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 6 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 276 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2024-06-01 05:14:20] [INFO ] Invariant cache hit.
[2024-06-01 05:14:20] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-06-01 05:14:20] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2024-06-01 05:14:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:14:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-06-01 05:14:21] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2024-06-01 05:14:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:14:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:14:21] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 1 ms to minimize.
[2024-06-01 05:14:21] [INFO ] Deduced a trap composed of 6 places in 257 ms of which 1 ms to minimize.
[2024-06-01 05:14:22] [INFO ] Deduced a trap composed of 6 places in 252 ms of which 1 ms to minimize.
[2024-06-01 05:14:22] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 2 ms to minimize.
[2024-06-01 05:14:22] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 1 ms to minimize.
[2024-06-01 05:14:22] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 0 ms to minimize.
[2024-06-01 05:14:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1466 ms
[2024-06-01 05:14:22] [INFO ] Computed and/alt/rep : 7/16/7 causal constraints (skipped 417 transitions) in 97 ms.
[2024-06-01 05:14:22] [INFO ] Added : 0 causal constraints over 0 iterations in 143 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 426/426 transitions.
Applied a total of 0 rules in 17 ms. Remains 57 /57 variables (removed 0) and now considering 426/426 (removed 0) transitions.
[2024-06-01 05:14:22] [INFO ] Invariant cache hit.
[2024-06-01 05:14:23] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-06-01 05:14:23] [INFO ] Invariant cache hit.
[2024-06-01 05:14:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:14:23] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2024-06-01 05:14:23] [INFO ] Redundant transitions in 52 ms returned [295]
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 423 sub problems to find dead transitions.
// Phase 1: matrix 425 rows 57 cols
[2024-06-01 05:14:23] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 05:14:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (OVERLAPS) 1/56 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-01 05:14:31] [INFO ] Deduced a trap composed of 6 places in 245 ms of which 1 ms to minimize.
[2024-06-01 05:14:32] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 2 ms to minimize.
[2024-06-01 05:14:32] [INFO ] Deduced a trap composed of 6 places in 245 ms of which 1 ms to minimize.
[2024-06-01 05:14:32] [INFO ] Deduced a trap composed of 6 places in 248 ms of which 1 ms to minimize.
[2024-06-01 05:14:32] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 2 ms to minimize.
[2024-06-01 05:14:33] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 1 ms to minimize.
[2024-06-01 05:14:33] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (OVERLAPS) 424/480 variables, 56/72 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-01 05:14:39] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 8 (OVERLAPS) 1/481 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 423 unsolved
SMT process timed out in 34692ms, After SMT, problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 34700ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/57 places, 425/426 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 55 transition count 423
Applied a total of 2 rules in 24 ms. Remains 55 /57 variables (removed 2) and now considering 423/425 (removed 2) transitions.
// Phase 1: matrix 423 rows 55 cols
[2024-06-01 05:14:58] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 05:14:58] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-06-01 05:14:58] [INFO ] Invariant cache hit.
[2024-06-01 05:14:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:14:58] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/57 places, 423/426 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 35876 ms. Remains : 55/57 places, 423/426 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/55 stabilizing places and 5/423 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-08b-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-08b-LTLCardinality-13 finished in 41331 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 U (p1||G(p0)))))'
[2024-06-01 05:14:59] [INFO ] Flatten gal took : 111 ms
[2024-06-01 05:14:59] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 05:14:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 300 places, 815 transitions and 7292 arcs took 24 ms.
Total runtime 477063 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutonomousCar-PT-08b-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717219511546
--------------------
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-08b-LTLCardinality-02
ltl formula formula --ltl=/tmp/2195/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 300 places, 815 transitions and 7292 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.150 real 0.050 user 0.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2195/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2195/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2195/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2195/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 301 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 301, there are 825 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): ~110 levels ~10000 states ~35100 transitions
pnml2lts-mc( 0/ 4): ~110 levels ~20000 states ~78340 transitions
pnml2lts-mc( 0/ 4): ~110 levels ~40000 states ~171672 transitions
pnml2lts-mc( 2/ 4): ~116 levels ~80000 states ~401256 transitions
pnml2lts-mc( 2/ 4): ~116 levels ~160000 states ~831908 transitions
pnml2lts-mc( 3/ 4): ~399 levels ~320000 states ~832728 transitions
pnml2lts-mc( 3/ 4): ~399 levels ~640000 states ~1809580 transitions
pnml2lts-mc( 3/ 4): ~399 levels ~1280000 states ~3813208 transitions
pnml2lts-mc( 3/ 4): ~403 levels ~2560000 states ~7335664 transitions
pnml2lts-mc( 0/ 4): ~118 levels ~5120000 states ~33408132 transitions
pnml2lts-mc( 3/ 4): ~406 levels ~10240000 states ~33829716 transitions
pnml2lts-mc( 3/ 4): ~406 levels ~20480000 states ~73725960 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33549972
pnml2lts-mc( 0/ 4): unique states count: 33550668
pnml2lts-mc( 0/ 4): unique transitions count: 214821200
pnml2lts-mc( 0/ 4): - self-loop count: 191
pnml2lts-mc( 0/ 4): - claim dead count: 181266621
pnml2lts-mc( 0/ 4): - claim found count: 16
pnml2lts-mc( 0/ 4): - claim success count: 33550695
pnml2lts-mc( 0/ 4): - cum. max stack depth: 803
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33550695 states 214821274 transitions, fanout: 6.403
pnml2lts-mc( 0/ 4): Total exploration time 611.100 sec (611.090 sec minimum, 611.093 sec on average)
pnml2lts-mc( 0/ 4): States per second: 54902, Transitions per second: 351532
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 257.1MB, 8.0 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 827 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 257.1MB (~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-08b"
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-08b, 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-171620167500339"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-08b.tgz
mv AutonomousCar-PT-08b 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 '
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 ;