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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717215612199

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-07b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:20:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 04:20:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:20:15] [INFO ] Load time of PNML (sax parser for PT used): 302 ms
[2024-06-01 04:20:15] [INFO ] Transformed 323 places.
[2024-06-01 04:20:15] [INFO ] Transformed 846 transitions.
[2024-06-01 04:20:15] [INFO ] Found NUPN structural information;
[2024-06-01 04:20:15] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 559 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA AutonomousCar-PT-07b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 846/846 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 276 transition count 799
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 276 transition count 799
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 290 place count 276 transition count 603
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 299 place count 267 transition count 594
Iterating global reduction 1 with 9 rules applied. Total rules applied 308 place count 267 transition count 594
Applied a total of 308 rules in 180 ms. Remains 267 /323 variables (removed 56) and now considering 594/846 (removed 252) transitions.
// Phase 1: matrix 594 rows 267 cols
[2024-06-01 04:20:16] [INFO ] Computed 12 invariants in 42 ms
[2024-06-01 04:20:16] [INFO ] Implicit Places using invariants in 510 ms returned []
[2024-06-01 04:20:16] [INFO ] Invariant cache hit.
[2024-06-01 04:20:17] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 1266 ms to find 0 implicit places.
Running 593 sub problems to find dead transitions.
[2024-06-01 04:20:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-06-01 04:20:31] [INFO ] Deduced a trap composed of 17 places in 585 ms of which 61 ms to minimize.
[2024-06-01 04:20:32] [INFO ] Deduced a trap composed of 77 places in 530 ms of which 5 ms to minimize.
[2024-06-01 04:20:32] [INFO ] Deduced a trap composed of 41 places in 413 ms of which 5 ms to minimize.
[2024-06-01 04:20:33] [INFO ] Deduced a trap composed of 21 places in 484 ms of which 4 ms to minimize.
[2024-06-01 04:20:33] [INFO ] Deduced a trap composed of 35 places in 548 ms of which 85 ms to minimize.
[2024-06-01 04:20:34] [INFO ] Deduced a trap composed of 42 places in 450 ms of which 5 ms to minimize.
[2024-06-01 04:20:34] [INFO ] Deduced a trap composed of 43 places in 357 ms of which 2 ms to minimize.
[2024-06-01 04:20:35] [INFO ] Deduced a trap composed of 46 places in 256 ms of which 3 ms to minimize.
[2024-06-01 04:20:35] [INFO ] Deduced a trap composed of 40 places in 413 ms of which 4 ms to minimize.
[2024-06-01 04:20:35] [INFO ] Deduced a trap composed of 48 places in 422 ms of which 4 ms to minimize.
[2024-06-01 04:20:36] [INFO ] Deduced a trap composed of 41 places in 415 ms of which 5 ms to minimize.
[2024-06-01 04:20:36] [INFO ] Deduced a trap composed of 47 places in 434 ms of which 4 ms to minimize.
[2024-06-01 04:20:37] [INFO ] Deduced a trap composed of 49 places in 429 ms of which 4 ms to minimize.
[2024-06-01 04:20:37] [INFO ] Deduced a trap composed of 46 places in 428 ms of which 5 ms to minimize.
[2024-06-01 04:20:38] [INFO ] Deduced a trap composed of 46 places in 354 ms of which 4 ms to minimize.
[2024-06-01 04:20:38] [INFO ] Deduced a trap composed of 46 places in 372 ms of which 3 ms to minimize.
[2024-06-01 04:20:39] [INFO ] Deduced a trap composed of 39 places in 504 ms of which 4 ms to minimize.
[2024-06-01 04:20:39] [INFO ] Deduced a trap composed of 42 places in 424 ms of which 3 ms to minimize.
[2024-06-01 04:20:39] [INFO ] Deduced a trap composed of 43 places in 361 ms of which 4 ms to minimize.
[2024-06-01 04:20:40] [INFO ] Deduced a trap composed of 21 places in 419 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-06-01 04:20:41] [INFO ] Deduced a trap composed of 49 places in 482 ms of which 4 ms to minimize.
[2024-06-01 04:20:42] [INFO ] Deduced a trap composed of 14 places in 500 ms of which 5 ms to minimize.
[2024-06-01 04:20:42] [INFO ] Deduced a trap composed of 25 places in 469 ms of which 5 ms to minimize.
[2024-06-01 04:20:43] [INFO ] Deduced a trap composed of 63 places in 506 ms of which 5 ms to minimize.
[2024-06-01 04:20:43] [INFO ] Deduced a trap composed of 24 places in 396 ms of which 4 ms to minimize.
[2024-06-01 04:20:44] [INFO ] Deduced a trap composed of 41 places in 451 ms of which 4 ms to minimize.
[2024-06-01 04:20:44] [INFO ] Deduced a trap composed of 43 places in 422 ms of which 4 ms to minimize.
[2024-06-01 04:20:44] [INFO ] Deduced a trap composed of 42 places in 431 ms of which 4 ms to minimize.
[2024-06-01 04:20:45] [INFO ] Deduced a trap composed of 32 places in 361 ms of which 3 ms to minimize.
[2024-06-01 04:20:45] [INFO ] Deduced a trap composed of 31 places in 420 ms of which 4 ms to minimize.
[2024-06-01 04:20:46] [INFO ] Deduced a trap composed of 23 places in 407 ms of which 3 ms to minimize.
[2024-06-01 04:20:46] [INFO ] Deduced a trap composed of 31 places in 425 ms of which 4 ms to minimize.
[2024-06-01 04:20:47] [INFO ] Deduced a trap composed of 28 places in 387 ms of which 4 ms to minimize.
[2024-06-01 04:20:47] [INFO ] Deduced a trap composed of 40 places in 364 ms of which 4 ms to minimize.
[2024-06-01 04:20:48] [INFO ] Deduced a trap composed of 41 places in 416 ms of which 4 ms to minimize.
[2024-06-01 04:20:48] [INFO ] Deduced a trap composed of 42 places in 388 ms of which 4 ms to minimize.
[2024-06-01 04:20:49] [INFO ] Deduced a trap composed of 38 places in 378 ms of which 3 ms to minimize.
[2024-06-01 04:20:49] [INFO ] Deduced a trap composed of 48 places in 390 ms of which 4 ms to minimize.
[2024-06-01 04:20:50] [INFO ] Deduced a trap composed of 59 places in 386 ms of which 4 ms to minimize.
SMT process timed out in 33208ms, After SMT, problems are : Problem set: 0 solved, 593 unsolved
Search for dead transitions found 0 dead transitions in 33269ms
Starting structural reductions in LTL mode, iteration 1 : 267/323 places, 594/846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34766 ms. Remains : 267/323 places, 594/846 transitions.
Support contains 36 out of 267 places after structural reductions.
[2024-06-01 04:20:51] [INFO ] Flatten gal took : 223 ms
[2024-06-01 04:20:51] [INFO ] Flatten gal took : 128 ms
[2024-06-01 04:20:51] [INFO ] Input system was already deterministic with 594 transitions.
RANDOM walk for 40000 steps (175 resets) in 2351 ms. (17 steps per ms) remains 10/19 properties
BEST_FIRST walk for 40002 steps (66 resets) in 226 ms. (176 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40003 steps (67 resets) in 138 ms. (287 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (64 resets) in 132 ms. (300 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (63 resets) in 108 ms. (367 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (65 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (63 resets) in 146 ms. (272 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (85 resets) in 181 ms. (219 steps per ms) remains 6/6 properties
[2024-06-01 04:20:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 238/258 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 9/267 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 594/861 variables, 267/279 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/861 variables, 0/279 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/861 variables, 0/279 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 861/861 variables, and 279 constraints, problems are : Problem set: 1 solved, 5 unsolved in 734 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 170/180 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 87/267 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 04:20:54] [INFO ] Deduced a trap composed of 31 places in 360 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 594/861 variables, 267/280 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/861 variables, 5/285 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 04:20:55] [INFO ] Deduced a trap composed of 31 places in 218 ms of which 3 ms to minimize.
[2024-06-01 04:20:55] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/861 variables, 2/287 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/861 variables, 0/287 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/861 variables, 0/287 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 861/861 variables, and 287 constraints, problems are : Problem set: 1 solved, 5 unsolved in 2817 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 3664ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2985 ms.
Support contains 10 out of 267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 594/594 transitions.
Graph (trivial) has 244 edges and 267 vertex of which 4 / 267 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1086 edges and 265 vertex of which 263 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 95 rules applied. Total rules applied 97 place count 263 transition count 495
Reduce places removed 94 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 136 rules applied. Total rules applied 233 place count 169 transition count 453
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 258 place count 144 transition count 453
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 258 place count 144 transition count 446
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 272 place count 137 transition count 446
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 273 place count 136 transition count 445
Iterating global reduction 3 with 1 rules applied. Total rules applied 274 place count 136 transition count 445
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 394 place count 76 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 395 place count 76 transition count 384
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 406 place count 65 transition count 309
Iterating global reduction 4 with 11 rules applied. Total rules applied 417 place count 65 transition count 309
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 423 place count 65 transition count 303
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 5 with 2 rules applied. Total rules applied 425 place count 64 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 426 place count 64 transition count 301
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 437 place count 64 transition count 290
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 448 place count 53 transition count 290
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 450 place count 53 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 451 place count 52 transition count 289
Applied a total of 451 rules in 248 ms. Remains 52 /267 variables (removed 215) and now considering 289/594 (removed 305) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 249 ms. Remains : 52/267 places, 289/594 transitions.
RANDOM walk for 40000 steps (540 resets) in 373 ms. (106 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (186 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
// Phase 1: matrix 289 rows 52 cols
[2024-06-01 04:20:59] [INFO ] Computed 11 invariants in 4 ms
[2024-06-01 04:20:59] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 263/281 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/339 variables, 33/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/341 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/341 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 64 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 263/281 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/339 variables, 33/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/341 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/341 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 65 constraints, problems are : Problem set: 0 solved, 1 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 472ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 289/289 transitions.
Graph (complete) has 599 edges and 52 vertex of which 51 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 287
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 48 transition count 270
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 48 transition count 270
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 48 transition count 269
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 47 transition count 262
Applied a total of 17 rules in 41 ms. Remains 47 /52 variables (removed 5) and now considering 262/289 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 47/52 places, 262/289 transitions.
RANDOM walk for 34971 steps (237 resets) in 340 ms. (102 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 44 stabilizing places and 45 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(G((!X(p0) U p1)))||G((G(p0)||p1))))))'
Support contains 12 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 264 transition count 591
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 263 transition count 590
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 263 transition count 590
Applied a total of 8 rules in 37 ms. Remains 263 /267 variables (removed 4) and now considering 590/594 (removed 4) transitions.
// Phase 1: matrix 590 rows 263 cols
[2024-06-01 04:21:00] [INFO ] Computed 12 invariants in 5 ms
[2024-06-01 04:21:00] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-06-01 04:21:00] [INFO ] Invariant cache hit.
[2024-06-01 04:21:01] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2024-06-01 04:21:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 04:21:15] [INFO ] Deduced a trap composed of 17 places in 510 ms of which 5 ms to minimize.
[2024-06-01 04:21:15] [INFO ] Deduced a trap composed of 35 places in 477 ms of which 4 ms to minimize.
[2024-06-01 04:21:16] [INFO ] Deduced a trap composed of 37 places in 416 ms of which 4 ms to minimize.
[2024-06-01 04:21:16] [INFO ] Deduced a trap composed of 34 places in 456 ms of which 4 ms to minimize.
[2024-06-01 04:21:17] [INFO ] Deduced a trap composed of 25 places in 530 ms of which 5 ms to minimize.
[2024-06-01 04:21:18] [INFO ] Deduced a trap composed of 14 places in 448 ms of which 4 ms to minimize.
[2024-06-01 04:21:18] [INFO ] Deduced a trap composed of 36 places in 372 ms of which 12 ms to minimize.
[2024-06-01 04:21:18] [INFO ] Deduced a trap composed of 35 places in 456 ms of which 4 ms to minimize.
[2024-06-01 04:21:19] [INFO ] Deduced a trap composed of 36 places in 453 ms of which 6 ms to minimize.
[2024-06-01 04:21:19] [INFO ] Deduced a trap composed of 42 places in 444 ms of which 4 ms to minimize.
[2024-06-01 04:21:20] [INFO ] Deduced a trap composed of 36 places in 437 ms of which 4 ms to minimize.
[2024-06-01 04:21:20] [INFO ] Deduced a trap composed of 36 places in 436 ms of which 4 ms to minimize.
[2024-06-01 04:21:21] [INFO ] Deduced a trap composed of 49 places in 449 ms of which 5 ms to minimize.
[2024-06-01 04:21:21] [INFO ] Deduced a trap composed of 18 places in 435 ms of which 4 ms to minimize.
[2024-06-01 04:21:22] [INFO ] Deduced a trap composed of 24 places in 456 ms of which 7 ms to minimize.
[2024-06-01 04:21:22] [INFO ] Deduced a trap composed of 31 places in 432 ms of which 4 ms to minimize.
[2024-06-01 04:21:23] [INFO ] Deduced a trap composed of 41 places in 400 ms of which 4 ms to minimize.
[2024-06-01 04:21:23] [INFO ] Deduced a trap composed of 42 places in 311 ms of which 4 ms to minimize.
[2024-06-01 04:21:24] [INFO ] Deduced a trap composed of 43 places in 271 ms of which 3 ms to minimize.
[2024-06-01 04:21:24] [INFO ] Deduced a trap composed of 41 places in 321 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 04:21:25] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 2 ms to minimize.
[2024-06-01 04:21:26] [INFO ] Deduced a trap composed of 24 places in 506 ms of which 5 ms to minimize.
[2024-06-01 04:21:27] [INFO ] Deduced a trap composed of 75 places in 439 ms of which 5 ms to minimize.
[2024-06-01 04:21:27] [INFO ] Deduced a trap composed of 43 places in 476 ms of which 4 ms to minimize.
[2024-06-01 04:21:28] [INFO ] Deduced a trap composed of 59 places in 453 ms of which 4 ms to minimize.
[2024-06-01 04:21:28] [INFO ] Deduced a trap composed of 39 places in 446 ms of which 4 ms to minimize.
[2024-06-01 04:21:29] [INFO ] Deduced a trap composed of 31 places in 406 ms of which 4 ms to minimize.
[2024-06-01 04:21:29] [INFO ] Deduced a trap composed of 22 places in 356 ms of which 3 ms to minimize.
[2024-06-01 04:21:29] [INFO ] Deduced a trap composed of 42 places in 248 ms of which 4 ms to minimize.
[2024-06-01 04:21:30] [INFO ] Deduced a trap composed of 27 places in 252 ms of which 3 ms to minimize.
[2024-06-01 04:21:30] [INFO ] Deduced a trap composed of 38 places in 403 ms of which 4 ms to minimize.
[2024-06-01 04:21:31] [INFO ] Deduced a trap composed of 31 places in 295 ms of which 4 ms to minimize.
[2024-06-01 04:21:31] [INFO ] Deduced a trap composed of 31 places in 340 ms of which 4 ms to minimize.
[2024-06-01 04:21:31] [INFO ] Deduced a trap composed of 44 places in 447 ms of which 4 ms to minimize.
[2024-06-01 04:21:32] [INFO ] Deduced a trap composed of 40 places in 442 ms of which 5 ms to minimize.
[2024-06-01 04:21:32] [INFO ] Deduced a trap composed of 45 places in 430 ms of which 4 ms to minimize.
[2024-06-01 04:21:33] [INFO ] Deduced a trap composed of 46 places in 417 ms of which 4 ms to minimize.
[2024-06-01 04:21:33] [INFO ] Deduced a trap composed of 47 places in 389 ms of which 4 ms to minimize.
[2024-06-01 04:21:34] [INFO ] Deduced a trap composed of 44 places in 375 ms of which 4 ms to minimize.
SMT process timed out in 32505ms, After SMT, problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 32519ms
Starting structural reductions in LTL mode, iteration 1 : 263/267 places, 590/594 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33245 ms. Remains : 263/267 places, 590/594 transitions.
Stuttering acceptance computed with spot in 357 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-00
Stuttering criterion allowed to conclude after 97 steps with 0 reset in 8 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-00 finished in 33740 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)&&F(p1)&&F(G(p2)))))'
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Graph (trivial) has 249 edges and 267 vertex of which 4 / 267 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 264 transition count 495
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 138 rules applied. Total rules applied 235 place count 168 transition count 453
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 260 place count 143 transition count 453
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 260 place count 143 transition count 446
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 274 place count 136 transition count 446
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 275 place count 135 transition count 445
Iterating global reduction 3 with 1 rules applied. Total rules applied 276 place count 135 transition count 445
Performed 59 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 394 place count 76 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 395 place count 76 transition count 384
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 408 place count 63 transition count 293
Iterating global reduction 4 with 13 rules applied. Total rules applied 421 place count 63 transition count 293
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 427 place count 63 transition count 287
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 5 with 4 rules applied. Total rules applied 431 place count 61 transition count 285
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 433 place count 59 transition count 283
Applied a total of 433 rules in 197 ms. Remains 59 /267 variables (removed 208) and now considering 283/594 (removed 311) transitions.
// Phase 1: matrix 283 rows 59 cols
[2024-06-01 04:21:34] [INFO ] Computed 11 invariants in 4 ms
[2024-06-01 04:21:34] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-06-01 04:21:34] [INFO ] Invariant cache hit.
[2024-06-01 04:21:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 04:21:35] [INFO ] Implicit Places using invariants and state equation in 244 ms returned [54, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 425 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/267 places, 283/594 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 56 transition count 282
Applied a total of 2 rules in 36 ms. Remains 56 /57 variables (removed 1) and now considering 282/283 (removed 1) transitions.
// Phase 1: matrix 282 rows 56 cols
[2024-06-01 04:21:35] [INFO ] Computed 9 invariants in 3 ms
[2024-06-01 04:21:35] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-01 04:21:35] [INFO ] Invariant cache hit.
[2024-06-01 04:21:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:21:35] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/267 places, 282/594 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1039 ms. Remains : 56/267 places, 282/594 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-01
Stuttering criterion allowed to conclude after 29 steps with 1 reset in 2 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-01 finished in 1261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(G(p1)))))'
Support contains 5 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 265 transition count 592
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 265 transition count 592
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 264 transition count 591
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 264 transition count 591
Applied a total of 6 rules in 34 ms. Remains 264 /267 variables (removed 3) and now considering 591/594 (removed 3) transitions.
// Phase 1: matrix 591 rows 264 cols
[2024-06-01 04:21:35] [INFO ] Computed 12 invariants in 5 ms
[2024-06-01 04:21:35] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-06-01 04:21:35] [INFO ] Invariant cache hit.
[2024-06-01 04:21:36] [INFO ] Implicit Places using invariants and state equation in 587 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
Running 590 sub problems to find dead transitions.
[2024-06-01 04:21:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 04:21:50] [INFO ] Deduced a trap composed of 23 places in 507 ms of which 4 ms to minimize.
[2024-06-01 04:21:51] [INFO ] Deduced a trap composed of 14 places in 486 ms of which 4 ms to minimize.
[2024-06-01 04:21:51] [INFO ] Deduced a trap composed of 49 places in 430 ms of which 4 ms to minimize.
[2024-06-01 04:21:51] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 2 ms to minimize.
[2024-06-01 04:21:52] [INFO ] Deduced a trap composed of 25 places in 491 ms of which 4 ms to minimize.
[2024-06-01 04:21:53] [INFO ] Deduced a trap composed of 33 places in 486 ms of which 5 ms to minimize.
[2024-06-01 04:21:53] [INFO ] Deduced a trap composed of 38 places in 453 ms of which 4 ms to minimize.
[2024-06-01 04:21:54] [INFO ] Deduced a trap composed of 36 places in 379 ms of which 5 ms to minimize.
[2024-06-01 04:21:54] [INFO ] Deduced a trap composed of 33 places in 387 ms of which 4 ms to minimize.
[2024-06-01 04:21:54] [INFO ] Deduced a trap composed of 43 places in 435 ms of which 4 ms to minimize.
[2024-06-01 04:21:55] [INFO ] Deduced a trap composed of 46 places in 440 ms of which 5 ms to minimize.
[2024-06-01 04:21:55] [INFO ] Deduced a trap composed of 49 places in 442 ms of which 5 ms to minimize.
[2024-06-01 04:21:56] [INFO ] Deduced a trap composed of 45 places in 442 ms of which 5 ms to minimize.
[2024-06-01 04:21:56] [INFO ] Deduced a trap composed of 59 places in 423 ms of which 4 ms to minimize.
[2024-06-01 04:21:57] [INFO ] Deduced a trap composed of 43 places in 383 ms of which 4 ms to minimize.
[2024-06-01 04:21:57] [INFO ] Deduced a trap composed of 43 places in 412 ms of which 4 ms to minimize.
[2024-06-01 04:21:58] [INFO ] Deduced a trap composed of 43 places in 405 ms of which 4 ms to minimize.
[2024-06-01 04:21:58] [INFO ] Deduced a trap composed of 41 places in 412 ms of which 4 ms to minimize.
[2024-06-01 04:21:59] [INFO ] Deduced a trap composed of 43 places in 419 ms of which 4 ms to minimize.
[2024-06-01 04:21:59] [INFO ] Deduced a trap composed of 38 places in 425 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 04:22:00] [INFO ] Deduced a trap composed of 34 places in 418 ms of which 4 ms to minimize.
[2024-06-01 04:22:01] [INFO ] Deduced a trap composed of 39 places in 380 ms of which 4 ms to minimize.
[2024-06-01 04:22:01] [INFO ] Deduced a trap composed of 42 places in 403 ms of which 4 ms to minimize.
[2024-06-01 04:22:02] [INFO ] Deduced a trap composed of 48 places in 395 ms of which 4 ms to minimize.
[2024-06-01 04:22:02] [INFO ] Deduced a trap composed of 28 places in 301 ms of which 2 ms to minimize.
[2024-06-01 04:22:02] [INFO ] Deduced a trap composed of 36 places in 253 ms of which 3 ms to minimize.
[2024-06-01 04:22:02] [INFO ] Deduced a trap composed of 39 places in 245 ms of which 2 ms to minimize.
[2024-06-01 04:22:03] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 3 ms to minimize.
[2024-06-01 04:22:03] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 3 ms to minimize.
[2024-06-01 04:22:03] [INFO ] Deduced a trap composed of 32 places in 303 ms of which 4 ms to minimize.
[2024-06-01 04:22:04] [INFO ] Deduced a trap composed of 46 places in 342 ms of which 4 ms to minimize.
[2024-06-01 04:22:04] [INFO ] Deduced a trap composed of 41 places in 372 ms of which 5 ms to minimize.
[2024-06-01 04:22:05] [INFO ] Deduced a trap composed of 32 places in 310 ms of which 4 ms to minimize.
[2024-06-01 04:22:05] [INFO ] Deduced a trap composed of 31 places in 356 ms of which 4 ms to minimize.
[2024-06-01 04:22:06] [INFO ] Deduced a trap composed of 44 places in 253 ms of which 4 ms to minimize.
[2024-06-01 04:22:06] [INFO ] Deduced a trap composed of 43 places in 245 ms of which 3 ms to minimize.
[2024-06-01 04:22:06] [INFO ] Deduced a trap composed of 45 places in 224 ms of which 3 ms to minimize.
[2024-06-01 04:22:06] [INFO ] Deduced a trap composed of 41 places in 243 ms of which 3 ms to minimize.
[2024-06-01 04:22:07] [INFO ] Deduced a trap composed of 46 places in 211 ms of which 3 ms to minimize.
[2024-06-01 04:22:07] [INFO ] Deduced a trap composed of 46 places in 210 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 264/855 variables, and 52 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 04:22:16] [INFO ] Deduced a trap composed of 18 places in 374 ms of which 4 ms to minimize.
[2024-06-01 04:22:16] [INFO ] Deduced a trap composed of 25 places in 360 ms of which 4 ms to minimize.
[2024-06-01 04:22:18] [INFO ] Deduced a trap composed of 32 places in 405 ms of which 5 ms to minimize.
[2024-06-01 04:22:19] [INFO ] Deduced a trap composed of 31 places in 401 ms of which 4 ms to minimize.
[2024-06-01 04:22:19] [INFO ] Deduced a trap composed of 42 places in 276 ms of which 3 ms to minimize.
[2024-06-01 04:22:19] [INFO ] Deduced a trap composed of 31 places in 328 ms of which 3 ms to minimize.
[2024-06-01 04:22:19] [INFO ] Deduced a trap composed of 42 places in 257 ms of which 3 ms to minimize.
[2024-06-01 04:22:20] [INFO ] Deduced a trap composed of 45 places in 243 ms of which 3 ms to minimize.
[2024-06-01 04:22:20] [INFO ] Deduced a trap composed of 46 places in 217 ms of which 2 ms to minimize.
[2024-06-01 04:22:20] [INFO ] Deduced a trap composed of 44 places in 206 ms of which 2 ms to minimize.
[2024-06-01 04:22:20] [INFO ] Deduced a trap composed of 44 places in 205 ms of which 2 ms to minimize.
[2024-06-01 04:22:21] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 3 ms to minimize.
[2024-06-01 04:22:21] [INFO ] Deduced a trap composed of 31 places in 203 ms of which 3 ms to minimize.
[2024-06-01 04:22:21] [INFO ] Deduced a trap composed of 41 places in 237 ms of which 3 ms to minimize.
[2024-06-01 04:22:22] [INFO ] Deduced a trap composed of 45 places in 200 ms of which 3 ms to minimize.
[2024-06-01 04:22:22] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 2 ms to minimize.
[2024-06-01 04:22:22] [INFO ] Deduced a trap composed of 46 places in 164 ms of which 3 ms to minimize.
[2024-06-01 04:22:22] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 2 ms to minimize.
[2024-06-01 04:22:23] [INFO ] Deduced a trap composed of 52 places in 336 ms of which 4 ms to minimize.
[2024-06-01 04:22:23] [INFO ] Deduced a trap composed of 46 places in 350 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 04:22:26] [INFO ] Deduced a trap composed of 32 places in 345 ms of which 4 ms to minimize.
[2024-06-01 04:22:27] [INFO ] Deduced a trap composed of 38 places in 294 ms of which 4 ms to minimize.
[2024-06-01 04:22:27] [INFO ] Deduced a trap composed of 45 places in 241 ms of which 3 ms to minimize.
[2024-06-01 04:22:28] [INFO ] Deduced a trap composed of 44 places in 213 ms of which 3 ms to minimize.
[2024-06-01 04:22:28] [INFO ] Deduced a trap composed of 31 places in 354 ms of which 3 ms to minimize.
[2024-06-01 04:22:29] [INFO ] Deduced a trap composed of 46 places in 187 ms of which 2 ms to minimize.
[2024-06-01 04:22:29] [INFO ] Deduced a trap composed of 48 places in 327 ms of which 4 ms to minimize.
[2024-06-01 04:22:29] [INFO ] Deduced a trap composed of 32 places in 321 ms of which 4 ms to minimize.
[2024-06-01 04:22:30] [INFO ] Deduced a trap composed of 5 places in 386 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 04:22:38] [INFO ] Deduced a trap composed of 31 places in 347 ms of which 5 ms to minimize.
[2024-06-01 04:22:38] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 4 ms to minimize.
[2024-06-01 04:22:38] [INFO ] Deduced a trap composed of 46 places in 221 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 264/855 variables, and 84 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 0/590 constraints, Known Traps: 72/72 constraints]
After SMT, in 62561ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 62573ms
Starting structural reductions in LTL mode, iteration 1 : 264/267 places, 591/594 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63460 ms. Remains : 264/267 places, 591/594 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 13362 steps with 126 reset in 60 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-03 finished in 63676 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 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Graph (trivial) has 252 edges and 267 vertex of which 4 / 267 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 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 264 transition count 495
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 138 rules applied. Total rules applied 235 place count 168 transition count 453
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 26 rules applied. Total rules applied 261 place count 143 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 262 place count 142 transition count 452
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 262 place count 142 transition count 444
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 278 place count 134 transition count 444
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 280 place count 132 transition count 442
Iterating global reduction 4 with 2 rules applied. Total rules applied 282 place count 132 transition count 442
Performed 58 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 398 place count 74 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 399 place count 74 transition count 382
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 414 place count 59 transition count 276
Iterating global reduction 5 with 15 rules applied. Total rules applied 429 place count 59 transition count 276
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 436 place count 59 transition count 269
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 440 place count 57 transition count 267
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 442 place count 55 transition count 265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 443 place count 54 transition count 265
Applied a total of 443 rules in 119 ms. Remains 54 /267 variables (removed 213) and now considering 265/594 (removed 329) transitions.
// Phase 1: matrix 265 rows 54 cols
[2024-06-01 04:22:39] [INFO ] Computed 10 invariants in 2 ms
[2024-06-01 04:22:39] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-06-01 04:22:39] [INFO ] Invariant cache hit.
[2024-06-01 04:22:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 04:22:39] [INFO ] Implicit Places using invariants and state equation in 279 ms returned [49, 53]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 453 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/267 places, 265/594 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 51 transition count 264
Applied a total of 2 rules in 21 ms. Remains 51 /52 variables (removed 1) and now considering 264/265 (removed 1) transitions.
// Phase 1: matrix 264 rows 51 cols
[2024-06-01 04:22:39] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 04:22:40] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-01 04:22:40] [INFO ] Invariant cache hit.
[2024-06-01 04:22:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:22:40] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/267 places, 264/594 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1058 ms. Remains : 51/267 places, 264/594 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-04
Product exploration explored 100000 steps with 39959 reset in 279 ms.
Product exploration explored 100000 steps with 39969 reset in 414 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/51 stabilizing places and 4/264 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 230 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 93 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 297 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-06-01 04:22:41] [INFO ] Invariant cache hit.
[2024-06-01 04:22:42] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 04:22:42] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2024-06-01 04:22:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:22:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-01 04:22:42] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-06-01 04:22:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:22:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:22:42] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 2 ms to minimize.
[2024-06-01 04:22:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2024-06-01 04:22:42] [INFO ] Computed and/alt/rep : 6/7/6 causal constraints (skipped 256 transitions) in 107 ms.
[2024-06-01 04:22:42] [INFO ] Added : 0 causal constraints over 0 iterations in 147 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 264/264 transitions.
Applied a total of 0 rules in 17 ms. Remains 51 /51 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-06-01 04:22:43] [INFO ] Invariant cache hit.
[2024-06-01 04:22:43] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-06-01 04:22:43] [INFO ] Invariant cache hit.
[2024-06-01 04:22:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:22:43] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2024-06-01 04:22:43] [INFO ] Redundant transitions in 30 ms returned [163]
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 261 sub problems to find dead transitions.
// Phase 1: matrix 263 rows 51 cols
[2024-06-01 04:22:43] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 04:22:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 04:22:47] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 262/312 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 1/313 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 61 constraints, problems are : Problem set: 0 solved, 261 unsolved in 15400 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 1/50 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 262/312 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 261/320 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 04:23:12] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (OVERLAPS) 1/313 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/314 variables, and 322 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 2/2 constraints]
After SMT, in 47028ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 47033ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/51 places, 263/264 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 49 transition count 261
Applied a total of 2 rules in 21 ms. Remains 49 /51 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 49 cols
[2024-06-01 04:23:30] [INFO ] Computed 8 invariants in 3 ms
[2024-06-01 04:23:30] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-06-01 04:23:30] [INFO ] Invariant cache hit.
[2024-06-01 04:23:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:23:31] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/51 places, 261/264 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48020 ms. Remains : 49/51 places, 261/264 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/49 stabilizing places and 5/261 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 28 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-07b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07b-LTLFireability-04 finished in 51721 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||G(F((p1||G(F(p2))))))))'
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 264 transition count 591
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 263 transition count 590
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 263 transition count 590
Applied a total of 8 rules in 30 ms. Remains 263 /267 variables (removed 4) and now considering 590/594 (removed 4) transitions.
// Phase 1: matrix 590 rows 263 cols
[2024-06-01 04:23:31] [INFO ] Computed 12 invariants in 7 ms
[2024-06-01 04:23:31] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-06-01 04:23:31] [INFO ] Invariant cache hit.
[2024-06-01 04:23:31] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2024-06-01 04:23:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 04:23:45] [INFO ] Deduced a trap composed of 17 places in 490 ms of which 4 ms to minimize.
[2024-06-01 04:23:45] [INFO ] Deduced a trap composed of 35 places in 382 ms of which 4 ms to minimize.
[2024-06-01 04:23:46] [INFO ] Deduced a trap composed of 37 places in 429 ms of which 4 ms to minimize.
[2024-06-01 04:23:46] [INFO ] Deduced a trap composed of 34 places in 425 ms of which 4 ms to minimize.
[2024-06-01 04:23:47] [INFO ] Deduced a trap composed of 25 places in 466 ms of which 5 ms to minimize.
[2024-06-01 04:23:47] [INFO ] Deduced a trap composed of 14 places in 437 ms of which 4 ms to minimize.
[2024-06-01 04:23:48] [INFO ] Deduced a trap composed of 36 places in 415 ms of which 5 ms to minimize.
[2024-06-01 04:23:48] [INFO ] Deduced a trap composed of 35 places in 435 ms of which 4 ms to minimize.
[2024-06-01 04:23:49] [INFO ] Deduced a trap composed of 36 places in 444 ms of which 4 ms to minimize.
[2024-06-01 04:23:49] [INFO ] Deduced a trap composed of 42 places in 431 ms of which 5 ms to minimize.
[2024-06-01 04:23:50] [INFO ] Deduced a trap composed of 36 places in 421 ms of which 4 ms to minimize.
[2024-06-01 04:23:50] [INFO ] Deduced a trap composed of 36 places in 458 ms of which 5 ms to minimize.
[2024-06-01 04:23:51] [INFO ] Deduced a trap composed of 49 places in 457 ms of which 5 ms to minimize.
[2024-06-01 04:23:51] [INFO ] Deduced a trap composed of 18 places in 420 ms of which 4 ms to minimize.
[2024-06-01 04:23:52] [INFO ] Deduced a trap composed of 24 places in 532 ms of which 4 ms to minimize.
[2024-06-01 04:23:52] [INFO ] Deduced a trap composed of 31 places in 407 ms of which 4 ms to minimize.
[2024-06-01 04:23:53] [INFO ] Deduced a trap composed of 41 places in 361 ms of which 4 ms to minimize.
[2024-06-01 04:23:53] [INFO ] Deduced a trap composed of 42 places in 329 ms of which 4 ms to minimize.
[2024-06-01 04:23:53] [INFO ] Deduced a trap composed of 43 places in 298 ms of which 3 ms to minimize.
[2024-06-01 04:23:54] [INFO ] Deduced a trap composed of 41 places in 289 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 04:23:55] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 2 ms to minimize.
[2024-06-01 04:23:56] [INFO ] Deduced a trap composed of 24 places in 457 ms of which 5 ms to minimize.
[2024-06-01 04:23:56] [INFO ] Deduced a trap composed of 75 places in 443 ms of which 4 ms to minimize.
[2024-06-01 04:23:57] [INFO ] Deduced a trap composed of 43 places in 417 ms of which 4 ms to minimize.
[2024-06-01 04:23:57] [INFO ] Deduced a trap composed of 59 places in 470 ms of which 4 ms to minimize.
[2024-06-01 04:23:58] [INFO ] Deduced a trap composed of 39 places in 426 ms of which 4 ms to minimize.
[2024-06-01 04:23:58] [INFO ] Deduced a trap composed of 31 places in 448 ms of which 4 ms to minimize.
[2024-06-01 04:23:59] [INFO ] Deduced a trap composed of 22 places in 435 ms of which 4 ms to minimize.
[2024-06-01 04:23:59] [INFO ] Deduced a trap composed of 42 places in 431 ms of which 4 ms to minimize.
[2024-06-01 04:24:00] [INFO ] Deduced a trap composed of 27 places in 439 ms of which 4 ms to minimize.
[2024-06-01 04:24:00] [INFO ] Deduced a trap composed of 38 places in 368 ms of which 3 ms to minimize.
[2024-06-01 04:24:01] [INFO ] Deduced a trap composed of 31 places in 290 ms of which 4 ms to minimize.
[2024-06-01 04:24:01] [INFO ] Deduced a trap composed of 31 places in 311 ms of which 3 ms to minimize.
[2024-06-01 04:24:01] [INFO ] Deduced a trap composed of 44 places in 439 ms of which 4 ms to minimize.
[2024-06-01 04:24:02] [INFO ] Deduced a trap composed of 40 places in 444 ms of which 4 ms to minimize.
[2024-06-01 04:24:02] [INFO ] Deduced a trap composed of 45 places in 423 ms of which 4 ms to minimize.
[2024-06-01 04:24:03] [INFO ] Deduced a trap composed of 46 places in 429 ms of which 4 ms to minimize.
[2024-06-01 04:24:03] [INFO ] Deduced a trap composed of 47 places in 399 ms of which 4 ms to minimize.
[2024-06-01 04:24:04] [INFO ] Deduced a trap composed of 44 places in 391 ms of which 4 ms to minimize.
[2024-06-01 04:24:04] [INFO ] Deduced a trap composed of 40 places in 355 ms of which 4 ms to minimize.
SMT process timed out in 32485ms, After SMT, problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 32499ms
Starting structural reductions in LTL mode, iteration 1 : 263/267 places, 590/594 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33322 ms. Remains : 263/267 places, 590/594 transitions.
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-05
Stuttering criterion allowed to conclude after 106 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-05 finished in 33572 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Graph (trivial) has 251 edges and 267 vertex of which 4 / 267 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 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 264 transition count 493
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 140 rules applied. Total rules applied 239 place count 166 transition count 451
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 264 place count 141 transition count 451
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 264 place count 141 transition count 445
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 276 place count 135 transition count 445
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 278 place count 133 transition count 443
Iterating global reduction 3 with 2 rules applied. Total rules applied 280 place count 133 transition count 443
Performed 59 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 398 place count 74 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 399 place count 74 transition count 382
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 413 place count 60 transition count 284
Iterating global reduction 4 with 14 rules applied. Total rules applied 427 place count 60 transition count 284
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 434 place count 60 transition count 277
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 5 with 4 rules applied. Total rules applied 438 place count 58 transition count 275
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 440 place count 56 transition count 273
Applied a total of 440 rules in 104 ms. Remains 56 /267 variables (removed 211) and now considering 273/594 (removed 321) transitions.
// Phase 1: matrix 273 rows 56 cols
[2024-06-01 04:24:04] [INFO ] Computed 11 invariants in 3 ms
[2024-06-01 04:24:04] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-01 04:24:04] [INFO ] Invariant cache hit.
[2024-06-01 04:24:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 04:24:05] [INFO ] Implicit Places using invariants and state equation in 319 ms returned [51, 55]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 515 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/267 places, 273/594 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 53 transition count 272
Applied a total of 2 rules in 22 ms. Remains 53 /54 variables (removed 1) and now considering 272/273 (removed 1) transitions.
// Phase 1: matrix 272 rows 53 cols
[2024-06-01 04:24:05] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 04:24:05] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-01 04:24:05] [INFO ] Invariant cache hit.
[2024-06-01 04:24:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:24:05] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/267 places, 272/594 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 987 ms. Remains : 53/267 places, 272/594 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-07
Product exploration explored 100000 steps with 10 reset in 143 ms.
Product exploration explored 100000 steps with 121 reset in 167 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2113 resets) in 2228 ms. (17 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (192 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1970714 steps, run timeout after 3001 ms. (steps per millisecond=656 ) properties seen :0 out of 1
Probabilistic random walk after 1970714 steps, saw 282162 distinct states, run finished after 3006 ms. (steps per millisecond=655 ) properties seen :0
[2024-06-01 04:24:09] [INFO ] Invariant cache hit.
[2024-06-01 04:24:09] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 242/260 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/323 variables, 34/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/324 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/325 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/325 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/325 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 63 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 242/260 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/323 variables, 34/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/324 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/325 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/325 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 64 constraints, problems are : Problem set: 0 solved, 1 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 493ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 272/272 transitions.
Graph (complete) has 568 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 52 transition count 269
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 11 place count 52 transition count 261
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 19 place count 44 transition count 261
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 44 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 43 transition count 262
Applied a total of 21 rules in 52 ms. Remains 43 /53 variables (removed 10) and now considering 262/272 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 43/53 places, 262/272 transitions.
RANDOM walk for 28895 steps (280 resets) in 216 ms. (133 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 272/272 transitions.
Applied a total of 0 rules in 17 ms. Remains 53 /53 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-06-01 04:24:10] [INFO ] Invariant cache hit.
[2024-06-01 04:24:10] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-01 04:24:10] [INFO ] Invariant cache hit.
[2024-06-01 04:24:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:24:11] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-06-01 04:24:11] [INFO ] Redundant transitions in 37 ms returned [164]
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 268 sub problems to find dead transitions.
// Phase 1: matrix 271 rows 53 cols
[2024-06-01 04:24:11] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 04:24:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 270/322 variables, 52/61 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-01 04:24:17] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 1/323 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 9 (OVERLAPS) 1/324 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 11 (OVERLAPS) 0/324 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 64 constraints, problems are : Problem set: 0 solved, 268 unsolved in 17899 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 1/52 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 270/322 variables, 52/62 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 268/330 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 1/323 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 10 (OVERLAPS) 1/324 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/324 variables, and 332 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 1/1 constraints]
After SMT, in 49321ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 49325ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/53 places, 271/272 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 51 transition count 269
Applied a total of 2 rules in 17 ms. Remains 51 /53 variables (removed 2) and now considering 269/271 (removed 2) transitions.
// Phase 1: matrix 269 rows 51 cols
[2024-06-01 04:25:00] [INFO ] Computed 9 invariants in 3 ms
[2024-06-01 04:25:00] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-01 04:25:00] [INFO ] Invariant cache hit.
[2024-06-01 04:25:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:25:00] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/53 places, 269/272 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 50034 ms. Remains : 51/53 places, 269/272 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2201 resets) in 251 ms. (158 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (204 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1633800 steps, run timeout after 3001 ms. (steps per millisecond=544 ) properties seen :0 out of 1
Probabilistic random walk after 1633800 steps, saw 245036 distinct states, run finished after 3002 ms. (steps per millisecond=544 ) properties seen :0
[2024-06-01 04:25:03] [INFO ] Invariant cache hit.
[2024-06-01 04:25:03] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 244/262 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/319 variables, 33/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/320 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 61 constraints, problems are : Problem set: 0 solved, 1 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 244/262 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/319 variables, 33/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/320 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/320 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 62 constraints, problems are : Problem set: 0 solved, 1 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 571ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 269/269 transitions.
Graph (complete) has 561 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 267
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 10 place count 50 transition count 259
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 18 place count 42 transition count 259
Applied a total of 18 rules in 36 ms. Remains 42 /51 variables (removed 9) and now considering 259/269 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 42/51 places, 259/269 transitions.
RANDOM walk for 15096 steps (147 resets) in 107 ms. (139 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8 reset in 124 ms.
Product exploration explored 100000 steps with 180 reset in 242 ms.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 269/269 transitions.
Applied a total of 0 rules in 16 ms. Remains 51 /51 variables (removed 0) and now considering 269/269 (removed 0) transitions.
[2024-06-01 04:25:05] [INFO ] Invariant cache hit.
[2024-06-01 04:25:05] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-06-01 04:25:05] [INFO ] Invariant cache hit.
[2024-06-01 04:25:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:25:05] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2024-06-01 04:25:05] [INFO ] Redundant transitions in 23 ms returned []
Running 267 sub problems to find dead transitions.
[2024-06-01 04:25:05] [INFO ] Invariant cache hit.
[2024-06-01 04:25:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/319 variables, 51/60 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-06-01 04:25:13] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 1/320 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 9 (OVERLAPS) 0/320 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 62 constraints, problems are : Problem set: 0 solved, 267 unsolved in 16551 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (OVERLAPS) 1/51 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (OVERLAPS) 268/319 variables, 51/61 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 267/328 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 320/320 variables, and 329 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 1/1 constraints]
After SMT, in 48332ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 48339ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48828 ms. Remains : 51/51 places, 269/269 transitions.
Treatment of property AutonomousCar-PT-07b-LTLFireability-07 finished in 109815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)&&p0))))'
Support contains 9 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 264 transition count 591
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 263 transition count 590
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 263 transition count 590
Applied a total of 8 rules in 21 ms. Remains 263 /267 variables (removed 4) and now considering 590/594 (removed 4) transitions.
// Phase 1: matrix 590 rows 263 cols
[2024-06-01 04:25:54] [INFO ] Computed 12 invariants in 10 ms
[2024-06-01 04:25:54] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-06-01 04:25:54] [INFO ] Invariant cache hit.
[2024-06-01 04:25:55] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2024-06-01 04:25:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 04:26:08] [INFO ] Deduced a trap composed of 17 places in 495 ms of which 5 ms to minimize.
[2024-06-01 04:26:08] [INFO ] Deduced a trap composed of 35 places in 454 ms of which 4 ms to minimize.
[2024-06-01 04:26:09] [INFO ] Deduced a trap composed of 37 places in 422 ms of which 4 ms to minimize.
[2024-06-01 04:26:09] [INFO ] Deduced a trap composed of 34 places in 438 ms of which 4 ms to minimize.
[2024-06-01 04:26:10] [INFO ] Deduced a trap composed of 25 places in 463 ms of which 5 ms to minimize.
[2024-06-01 04:26:10] [INFO ] Deduced a trap composed of 14 places in 439 ms of which 4 ms to minimize.
[2024-06-01 04:26:11] [INFO ] Deduced a trap composed of 36 places in 446 ms of which 4 ms to minimize.
[2024-06-01 04:26:11] [INFO ] Deduced a trap composed of 35 places in 426 ms of which 4 ms to minimize.
[2024-06-01 04:26:12] [INFO ] Deduced a trap composed of 36 places in 432 ms of which 4 ms to minimize.
[2024-06-01 04:26:12] [INFO ] Deduced a trap composed of 42 places in 430 ms of which 4 ms to minimize.
[2024-06-01 04:26:12] [INFO ] Deduced a trap composed of 36 places in 408 ms of which 4 ms to minimize.
[2024-06-01 04:26:13] [INFO ] Deduced a trap composed of 36 places in 409 ms of which 4 ms to minimize.
[2024-06-01 04:26:13] [INFO ] Deduced a trap composed of 49 places in 441 ms of which 4 ms to minimize.
[2024-06-01 04:26:14] [INFO ] Deduced a trap composed of 18 places in 412 ms of which 4 ms to minimize.
[2024-06-01 04:26:14] [INFO ] Deduced a trap composed of 24 places in 414 ms of which 4 ms to minimize.
[2024-06-01 04:26:15] [INFO ] Deduced a trap composed of 31 places in 414 ms of which 4 ms to minimize.
[2024-06-01 04:26:16] [INFO ] Deduced a trap composed of 41 places in 487 ms of which 4 ms to minimize.
[2024-06-01 04:26:16] [INFO ] Deduced a trap composed of 42 places in 290 ms of which 3 ms to minimize.
[2024-06-01 04:26:16] [INFO ] Deduced a trap composed of 43 places in 306 ms of which 4 ms to minimize.
[2024-06-01 04:26:16] [INFO ] Deduced a trap composed of 41 places in 298 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 04:26:17] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 1 ms to minimize.
[2024-06-01 04:26:19] [INFO ] Deduced a trap composed of 24 places in 472 ms of which 5 ms to minimize.
[2024-06-01 04:26:19] [INFO ] Deduced a trap composed of 75 places in 457 ms of which 4 ms to minimize.
[2024-06-01 04:26:20] [INFO ] Deduced a trap composed of 43 places in 454 ms of which 4 ms to minimize.
[2024-06-01 04:26:20] [INFO ] Deduced a trap composed of 59 places in 390 ms of which 4 ms to minimize.
[2024-06-01 04:26:21] [INFO ] Deduced a trap composed of 39 places in 429 ms of which 4 ms to minimize.
[2024-06-01 04:26:21] [INFO ] Deduced a trap composed of 31 places in 421 ms of which 4 ms to minimize.
[2024-06-01 04:26:21] [INFO ] Deduced a trap composed of 22 places in 432 ms of which 4 ms to minimize.
[2024-06-01 04:26:22] [INFO ] Deduced a trap composed of 42 places in 418 ms of which 4 ms to minimize.
[2024-06-01 04:26:22] [INFO ] Deduced a trap composed of 27 places in 428 ms of which 4 ms to minimize.
[2024-06-01 04:26:23] [INFO ] Deduced a trap composed of 38 places in 406 ms of which 4 ms to minimize.
[2024-06-01 04:26:23] [INFO ] Deduced a trap composed of 31 places in 344 ms of which 4 ms to minimize.
[2024-06-01 04:26:24] [INFO ] Deduced a trap composed of 31 places in 331 ms of which 4 ms to minimize.
[2024-06-01 04:26:24] [INFO ] Deduced a trap composed of 44 places in 450 ms of which 5 ms to minimize.
[2024-06-01 04:26:25] [INFO ] Deduced a trap composed of 40 places in 451 ms of which 4 ms to minimize.
[2024-06-01 04:26:25] [INFO ] Deduced a trap composed of 45 places in 395 ms of which 4 ms to minimize.
[2024-06-01 04:26:25] [INFO ] Deduced a trap composed of 46 places in 434 ms of which 4 ms to minimize.
[2024-06-01 04:26:26] [INFO ] Deduced a trap composed of 47 places in 383 ms of which 4 ms to minimize.
[2024-06-01 04:26:26] [INFO ] Deduced a trap composed of 44 places in 383 ms of which 4 ms to minimize.
[2024-06-01 04:26:27] [INFO ] Deduced a trap composed of 40 places in 371 ms of which 4 ms to minimize.
SMT process timed out in 32032ms, After SMT, problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 32039ms
Starting structural reductions in LTL mode, iteration 1 : 263/267 places, 590/594 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32645 ms. Remains : 263/267 places, 590/594 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-09 finished in 32866 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 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Graph (trivial) has 251 edges and 267 vertex of which 4 / 267 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 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 264 transition count 493
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 140 rules applied. Total rules applied 239 place count 166 transition count 451
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 141 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 266 place count 140 transition count 450
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 266 place count 140 transition count 443
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 280 place count 133 transition count 443
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 282 place count 131 transition count 441
Iterating global reduction 4 with 2 rules applied. Total rules applied 284 place count 131 transition count 441
Performed 59 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 402 place count 72 transition count 381
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 403 place count 72 transition count 380
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 418 place count 57 transition count 274
Iterating global reduction 5 with 15 rules applied. Total rules applied 433 place count 57 transition count 274
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 440 place count 57 transition count 267
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 444 place count 55 transition count 265
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 446 place count 53 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 447 place count 52 transition count 263
Applied a total of 447 rules in 83 ms. Remains 52 /267 variables (removed 215) and now considering 263/594 (removed 331) transitions.
// Phase 1: matrix 263 rows 52 cols
[2024-06-01 04:26:27] [INFO ] Computed 10 invariants in 2 ms
[2024-06-01 04:26:27] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-06-01 04:26:27] [INFO ] Invariant cache hit.
[2024-06-01 04:26:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 04:26:27] [INFO ] Implicit Places using invariants and state equation in 297 ms returned [47, 51]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 480 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/267 places, 263/594 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 49 transition count 262
Applied a total of 2 rules in 17 ms. Remains 49 /50 variables (removed 1) and now considering 262/263 (removed 1) transitions.
// Phase 1: matrix 262 rows 49 cols
[2024-06-01 04:26:27] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 04:26:28] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-06-01 04:26:28] [INFO ] Invariant cache hit.
[2024-06-01 04:26:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:26:28] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/267 places, 262/594 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1069 ms. Remains : 49/267 places, 262/594 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-12
Product exploration explored 100000 steps with 39931 reset in 488 ms.
Product exploration explored 100000 steps with 39974 reset in 512 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 152 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 33 ms :[(NOT p0)]
RANDOM walk for 5 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 204 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 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
[2024-06-01 04:26:29] [INFO ] Invariant cache hit.
[2024-06-01 04:26:30] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 04:26:30] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2024-06-01 04:26:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:26:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 04:26:30] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2024-06-01 04:26:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:26:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:26:30] [INFO ] Computed and/alt/rep : 12/62/12 causal constraints (skipped 248 transitions) in 58 ms.
[2024-06-01 04:26:30] [INFO ] Added : 2 causal constraints over 2 iterations in 136 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 262/262 transitions.
Applied a total of 0 rules in 13 ms. Remains 49 /49 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-06-01 04:26:30] [INFO ] Invariant cache hit.
[2024-06-01 04:26:31] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-06-01 04:26:31] [INFO ] Invariant cache hit.
[2024-06-01 04:26:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:26:31] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2024-06-01 04:26:31] [INFO ] Redundant transitions in 17 ms returned [161]
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 259 sub problems to find dead transitions.
// Phase 1: matrix 261 rows 49 cols
[2024-06-01 04:26:31] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 04:26:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (OVERLAPS) 260/308 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 04:26:36] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 1/309 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 1/310 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (OVERLAPS) 0/310 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 59 constraints, problems are : Problem set: 0 solved, 259 unsolved in 16918 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 260/308 variables, 48/57 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 259/316 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 1/309 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 1/310 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/310 variables, and 318 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 1/1 constraints]
After SMT, in 48290ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 48295ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/49 places, 261/262 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 47 transition count 259
Applied a total of 2 rules in 13 ms. Remains 47 /49 variables (removed 2) and now considering 259/261 (removed 2) transitions.
// Phase 1: matrix 259 rows 47 cols
[2024-06-01 04:27:19] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 04:27:19] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-01 04:27:19] [INFO ] Invariant cache hit.
[2024-06-01 04:27:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:27:19] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/49 places, 259/262 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49144 ms. Remains : 47/49 places, 259/262 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 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-07b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07b-LTLFireability-12 finished in 52701 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X((X(!p0)&&!p1)) U p2))))'
Support contains 1 out of 267 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Graph (trivial) has 233 edges and 267 vertex of which 4 / 267 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 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 264 transition count 494
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 139 rules applied. Total rules applied 237 place count 167 transition count 452
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 26 rules applied. Total rules applied 263 place count 142 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 264 place count 141 transition count 451
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 264 place count 141 transition count 446
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 274 place count 136 transition count 446
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 276 place count 134 transition count 444
Iterating global reduction 4 with 2 rules applied. Total rules applied 278 place count 134 transition count 444
Performed 52 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 382 place count 82 transition count 391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 383 place count 82 transition count 390
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 394 place count 71 transition count 316
Iterating global reduction 5 with 11 rules applied. Total rules applied 405 place count 71 transition count 316
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 412 place count 71 transition count 309
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 416 place count 69 transition count 307
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 418 place count 67 transition count 305
Applied a total of 418 rules in 49 ms. Remains 67 /267 variables (removed 200) and now considering 305/594 (removed 289) transitions.
// Phase 1: matrix 305 rows 67 cols
[2024-06-01 04:27:20] [INFO ] Computed 11 invariants in 2 ms
[2024-06-01 04:27:20] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-01 04:27:20] [INFO ] Invariant cache hit.
[2024-06-01 04:27:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 04:27:20] [INFO ] Implicit Places using invariants and state equation in 248 ms returned [62, 66]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 356 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/267 places, 305/594 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 64 transition count 304
Applied a total of 2 rules in 17 ms. Remains 64 /65 variables (removed 1) and now considering 304/305 (removed 1) transitions.
// Phase 1: matrix 304 rows 64 cols
[2024-06-01 04:27:20] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 04:27:20] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-01 04:27:20] [INFO ] Invariant cache hit.
[2024-06-01 04:27:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:27:20] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/267 places, 304/594 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 768 ms. Remains : 64/267 places, 304/594 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p2), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-14
Stuttering criterion allowed to conclude after 764 steps with 95 reset in 4 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-14 finished in 893 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-06-01 04:27:21] [INFO ] Flatten gal took : 95 ms
[2024-06-01 04:27:21] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-01 04:27:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 267 places, 594 transitions and 4185 arcs took 23 ms.
Total runtime 426832 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutonomousCar-PT-07b-LTLFireability-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717216543499

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name AutonomousCar-PT-07b-LTLFireability-07
ltl formula formula --ltl=/tmp/1787/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 267 places, 594 transitions and 4185 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.020 user 0.040 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1787/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1787/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1787/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1787/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 268 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 268, there are 634 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( 1/ 4): ~104 levels ~10000 states ~134620 transitions
pnml2lts-mc( 1/ 4): ~104 levels ~20000 states ~273280 transitions
pnml2lts-mc( 1/ 4): ~104 levels ~40000 states ~601940 transitions
pnml2lts-mc( 1/ 4): ~108 levels ~80000 states ~1286696 transitions
pnml2lts-mc( 1/ 4): ~108 levels ~160000 states ~2656500 transitions
pnml2lts-mc( 0/ 4): ~113 levels ~320000 states ~5649536 transitions
pnml2lts-mc( 3/ 4): ~139 levels ~640000 states ~10666396 transitions
pnml2lts-mc( 3/ 4): ~139 levels ~1280000 states ~24464644 transitions
pnml2lts-mc( 3/ 4): ~155 levels ~2560000 states ~43110640 transitions
pnml2lts-mc( 3/ 4): ~165 levels ~5120000 states ~78493232 transitions
pnml2lts-mc( 3/ 4): ~165 levels ~10240000 states ~158224180 transitions
pnml2lts-mc( 3/ 4): ~185 levels ~20480000 states ~351030688 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 32742204
pnml2lts-mc( 0/ 4): unique states count: 33549803
pnml2lts-mc( 0/ 4): unique transitions count: 705954228
pnml2lts-mc( 0/ 4): - self-loop count: 2541
pnml2lts-mc( 0/ 4): - claim dead count: 669160356
pnml2lts-mc( 0/ 4): - claim found count: 3226661
pnml2lts-mc( 0/ 4): - claim success count: 33549823
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1186
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33549823 states 705954433 transitions, fanout: 21.042
pnml2lts-mc( 0/ 4): Total exploration time 500.960 sec (500.830 sec minimum, 500.882 sec on average)
pnml2lts-mc( 0/ 4): States per second: 66971, Transitions per second: 1409203
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 256.9MB, 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 606 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 256.9MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is AutonomousCar-PT-07b, examination is LTLFireability"
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-171620167500324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-07b.tgz
mv AutonomousCar-PT-07b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;