Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r009-oct2-167813598200684.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is AutonomousCar-PT-10b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598200684
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.8K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 5 18:22 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-10b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678642820228

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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-10b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:40:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 17:40:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:40:25] [INFO ] Load time of PNML (sax parser for PT used): 321 ms
[2023-03-12 17:40:25] [INFO ] Transformed 425 places.
[2023-03-12 17:40:25] [INFO ] Transformed 2252 transitions.
[2023-03-12 17:40:25] [INFO ] Found NUPN structural information;
[2023-03-12 17:40:25] [INFO ] Parsed PT model containing 425 places and 2252 transitions and 29816 arcs in 537 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutonomousCar-PT-10b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 425 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 2252/2252 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 362 transition count 2189
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 362 transition count 2189
Ensure Unique test removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Iterating post reduction 0 with 400 rules applied. Total rules applied 526 place count 362 transition count 1789
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 538 place count 350 transition count 1777
Iterating global reduction 1 with 12 rules applied. Total rules applied 550 place count 350 transition count 1777
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 551 place count 349 transition count 1776
Iterating global reduction 1 with 1 rules applied. Total rules applied 552 place count 349 transition count 1776
Applied a total of 552 rules in 136 ms. Remains 349 /425 variables (removed 76) and now considering 1776/2252 (removed 476) transitions.
// Phase 1: matrix 1776 rows 349 cols
[2023-03-12 17:40:25] [INFO ] Computed 15 place invariants in 66 ms
[2023-03-12 17:40:26] [INFO ] Implicit Places using invariants in 493 ms returned []
[2023-03-12 17:40:26] [INFO ] Invariant cache hit.
[2023-03-12 17:40:27] [INFO ] Implicit Places using invariants and state equation in 1517 ms returned []
Implicit Place search using SMT with State Equation took 2067 ms to find 0 implicit places.
[2023-03-12 17:40:27] [INFO ] Invariant cache hit.
[2023-03-12 17:40:28] [INFO ] Dead Transitions using invariants and state equation in 833 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 349/425 places, 1776/2252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3039 ms. Remains : 349/425 places, 1776/2252 transitions.
Support contains 47 out of 349 places after structural reductions.
[2023-03-12 17:40:29] [INFO ] Flatten gal took : 526 ms
[2023-03-12 17:40:29] [INFO ] Flatten gal took : 346 ms
[2023-03-12 17:40:30] [INFO ] Input system was already deterministic with 1776 transitions.
Incomplete random walk after 10000 steps, including 77 resets, run finished after 617 ms. (steps per millisecond=16 ) properties (out of 27) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-12 17:40:31] [INFO ] Invariant cache hit.
[2023-03-12 17:40:32] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-12 17:40:32] [INFO ] After 400ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-12 17:40:32] [INFO ] [Nat]Absence check using 15 positive place invariants in 35 ms returned sat
[2023-03-12 17:40:34] [INFO ] After 1623ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-12 17:40:36] [INFO ] After 3589ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 1339 ms.
[2023-03-12 17:40:38] [INFO ] After 5921ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 0 properties in 602 ms.
Support contains 40 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Graph (trivial) has 281 edges and 349 vertex of which 4 / 349 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1864 edges and 347 vertex of which 345 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 124 rules applied. Total rules applied 126 place count 345 transition count 1648
Reduce places removed 122 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 1 with 178 rules applied. Total rules applied 304 place count 223 transition count 1592
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 34 rules applied. Total rules applied 338 place count 190 transition count 1591
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 339 place count 189 transition count 1591
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 339 place count 189 transition count 1584
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 353 place count 182 transition count 1584
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 467 place count 125 transition count 1527
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 468 place count 125 transition count 1526
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 474 place count 119 transition count 1475
Iterating global reduction 5 with 6 rules applied. Total rules applied 480 place count 119 transition count 1475
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 485 place count 119 transition count 1470
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 6 with 2 rules applied. Total rules applied 487 place count 118 transition count 1469
Free-agglomeration rule applied 25 times.
Iterating global reduction 6 with 25 rules applied. Total rules applied 512 place count 118 transition count 1444
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 537 place count 93 transition count 1444
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 548 place count 93 transition count 1433
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 558 place count 93 transition count 1433
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 559 place count 92 transition count 1432
Applied a total of 559 rules in 647 ms. Remains 92 /349 variables (removed 257) and now considering 1432/1776 (removed 344) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 647 ms. Remains : 92/349 places, 1432/1776 transitions.
Incomplete random walk after 10000 steps, including 158 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 20) seen :6
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1432 rows 92 cols
[2023-03-12 17:40:40] [INFO ] Computed 15 place invariants in 11 ms
[2023-03-12 17:40:40] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:40:41] [INFO ] After 534ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:4
[2023-03-12 17:40:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:40:41] [INFO ] After 154ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :3 real:4
[2023-03-12 17:40:41] [INFO ] After 318ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:4
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-12 17:40:41] [INFO ] After 1048ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3 real:4
[2023-03-12 17:40:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned sat
[2023-03-12 17:40:42] [INFO ] After 805ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 17:40:42] [INFO ] After 394ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-12 17:40:43] [INFO ] After 748ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 418 ms.
[2023-03-12 17:40:43] [INFO ] After 2105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 121 ms.
Support contains 25 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 1432/1432 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 92 transition count 1431
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 91 transition count 1431
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 13 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 88 transition count 1428
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 88 transition count 1424
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 46 place count 84 transition count 1394
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 83 transition count 1393
Applied a total of 47 rules in 222 ms. Remains 83 /92 variables (removed 9) and now considering 1393/1432 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 222 ms. Remains : 83/92 places, 1393/1432 transitions.
Incomplete random walk after 10000 steps, including 55 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1393 rows 83 cols
[2023-03-12 17:40:44] [INFO ] Computed 15 place invariants in 9 ms
[2023-03-12 17:40:44] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:40:44] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 17:40:44] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-12 17:40:45] [INFO ] After 653ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 17:40:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:40:45] [INFO ] After 209ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 17:40:46] [INFO ] After 574ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-12 17:40:46] [INFO ] After 1396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 76 ms.
Support contains 21 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 1393/1393 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 80 transition count 1390
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 80 transition count 1389
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 18 place count 79 transition count 1379
Applied a total of 18 rules in 163 ms. Remains 79 /83 variables (removed 4) and now considering 1379/1393 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 79/83 places, 1379/1393 transitions.
Incomplete random walk after 10000 steps, including 26 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 351414 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 351414 steps, saw 55978 distinct states, run finished after 3003 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1379 rows 79 cols
[2023-03-12 17:40:49] [INFO ] Computed 15 place invariants in 20 ms
[2023-03-12 17:40:50] [INFO ] [Real]Absence check using 15 positive place invariants in 19 ms returned sat
[2023-03-12 17:40:50] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 17:40:50] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-12 17:40:50] [INFO ] After 546ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 17:40:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:40:51] [INFO ] After 187ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 17:40:51] [INFO ] After 479ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-12 17:40:51] [INFO ] After 1205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 55 ms.
Support contains 21 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 1379/1379 transitions.
Applied a total of 0 rules in 61 ms. Remains 79 /79 variables (removed 0) and now considering 1379/1379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 79/79 places, 1379/1379 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 1379/1379 transitions.
Applied a total of 0 rules in 60 ms. Remains 79 /79 variables (removed 0) and now considering 1379/1379 (removed 0) transitions.
[2023-03-12 17:40:51] [INFO ] Invariant cache hit.
[2023-03-12 17:40:52] [INFO ] Implicit Places using invariants in 741 ms returned []
[2023-03-12 17:40:52] [INFO ] Invariant cache hit.
[2023-03-12 17:40:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:40:52] [INFO ] Implicit Places using invariants and state equation in 490 ms returned [74, 78]
Discarding 2 places :
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 1245 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 77/79 places, 1378/1379 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 76 transition count 1377
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 76 transition count 1376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 75 transition count 1376
Applied a total of 4 rules in 146 ms. Remains 75 /77 variables (removed 2) and now considering 1376/1378 (removed 2) transitions.
// Phase 1: matrix 1376 rows 75 cols
[2023-03-12 17:40:53] [INFO ] Computed 13 place invariants in 38 ms
[2023-03-12 17:40:53] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-12 17:40:53] [INFO ] Invariant cache hit.
[2023-03-12 17:40:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:40:53] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 75/79 places, 1376/1379 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2331 ms. Remains : 75/79 places, 1376/1379 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 354304 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 354304 steps, saw 52147 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 17:40:57] [INFO ] Invariant cache hit.
[2023-03-12 17:40:57] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 17:40:57] [INFO ] After 335ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-12 17:40:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:40:57] [INFO ] After 71ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-12 17:40:58] [INFO ] After 169ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-12 17:40:58] [INFO ] After 617ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-12 17:40:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 17:40:58] [INFO ] After 680ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 17:40:59] [INFO ] After 158ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 17:40:59] [INFO ] After 381ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 191 ms.
[2023-03-12 17:40:59] [INFO ] After 1373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 66 ms.
Support contains 21 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 1376/1376 transitions.
Applied a total of 0 rules in 75 ms. Remains 75 /75 variables (removed 0) and now considering 1376/1376 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 75/75 places, 1376/1376 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 1376/1376 transitions.
Applied a total of 0 rules in 72 ms. Remains 75 /75 variables (removed 0) and now considering 1376/1376 (removed 0) transitions.
[2023-03-12 17:40:59] [INFO ] Invariant cache hit.
[2023-03-12 17:40:59] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-12 17:40:59] [INFO ] Invariant cache hit.
[2023-03-12 17:41:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:41:00] [INFO ] Implicit Places using invariants and state equation in 742 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
[2023-03-12 17:41:00] [INFO ] Redundant transitions in 183 ms returned []
[2023-03-12 17:41:00] [INFO ] Invariant cache hit.
[2023-03-12 17:41:01] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1917 ms. Remains : 75/75 places, 1376/1376 transitions.
Graph (complete) has 1053 edges and 75 vertex of which 74 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output 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 74 transition count 1375
Applied a total of 2 rules in 104 ms. Remains 74 /75 variables (removed 1) and now considering 1375/1376 (removed 1) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1375 rows 74 cols
[2023-03-12 17:41:01] [INFO ] Computed 13 place invariants in 30 ms
[2023-03-12 17:41:01] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-12 17:41:02] [INFO ] After 577ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-12 17:41:02] [INFO ] After 675ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-12 17:41:02] [INFO ] After 830ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-12 17:41:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-12 17:41:03] [INFO ] After 471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 17:41:03] [INFO ] After 842ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 228 ms.
[2023-03-12 17:41:03] [INFO ] After 1287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA AutonomousCar-PT-10b-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 52 stabilizing places and 53 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Graph (trivial) has 330 edges and 349 vertex of which 4 / 349 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 removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 126 rules applied. Total rules applied 127 place count 346 transition count 1647
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 183 rules applied. Total rules applied 310 place count 220 transition count 1590
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 344 place count 186 transition count 1590
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 344 place count 186 transition count 1583
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 358 place count 179 transition count 1583
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 360 place count 177 transition count 1581
Iterating global reduction 3 with 2 rules applied. Total rules applied 362 place count 177 transition count 1581
Performed 79 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 520 place count 98 transition count 1501
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 521 place count 98 transition count 1500
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 541 place count 78 transition count 1300
Iterating global reduction 4 with 20 rules applied. Total rules applied 561 place count 78 transition count 1300
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 571 place count 78 transition count 1290
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 575 place count 76 transition count 1288
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 576 place count 75 transition count 1287
Applied a total of 576 rules in 472 ms. Remains 75 /349 variables (removed 274) and now considering 1287/1776 (removed 489) transitions.
// Phase 1: matrix 1287 rows 75 cols
[2023-03-12 17:41:05] [INFO ] Computed 14 place invariants in 6 ms
[2023-03-12 17:41:05] [INFO ] Implicit Places using invariants in 746 ms returned []
[2023-03-12 17:41:05] [INFO ] Invariant cache hit.
[2023-03-12 17:41:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:41:07] [INFO ] Implicit Places using invariants and state equation in 1413 ms returned [70, 74]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2175 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/349 places, 1287/1776 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 72 transition count 1286
Applied a total of 2 rules in 147 ms. Remains 72 /73 variables (removed 1) and now considering 1286/1287 (removed 1) transitions.
// Phase 1: matrix 1286 rows 72 cols
[2023-03-12 17:41:07] [INFO ] Computed 12 place invariants in 24 ms
[2023-03-12 17:41:08] [INFO ] Implicit Places using invariants in 884 ms returned []
[2023-03-12 17:41:08] [INFO ] Invariant cache hit.
[2023-03-12 17:41:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:41:09] [INFO ] Implicit Places using invariants and state equation in 1325 ms returned []
Implicit Place search using SMT with State Equation took 2236 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/349 places, 1286/1776 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5043 ms. Remains : 72/349 places, 1286/1776 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s3 1) (EQ s46 1) (EQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 6 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-00 finished in 5361 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&(p1||G(p0))))||X(F(p2))))'
Support contains 6 out of 349 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 347 transition count 1774
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 347 transition count 1774
Applied a total of 4 rules in 46 ms. Remains 347 /349 variables (removed 2) and now considering 1774/1776 (removed 2) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2023-03-12 17:41:10] [INFO ] Computed 15 place invariants in 37 ms
[2023-03-12 17:41:10] [INFO ] Implicit Places using invariants in 561 ms returned []
[2023-03-12 17:41:10] [INFO ] Invariant cache hit.
[2023-03-12 17:41:11] [INFO ] Implicit Places using invariants and state equation in 1428 ms returned []
Implicit Place search using SMT with State Equation took 2023 ms to find 0 implicit places.
[2023-03-12 17:41:12] [INFO ] Invariant cache hit.
[2023-03-12 17:41:13] [INFO ] Dead Transitions using invariants and state equation in 1024 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 347/349 places, 1774/1776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3108 ms. Remains : 347/349 places, 1774/1776 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(AND (EQ s4 1) (EQ s11 1) (EQ s257 1) (EQ s313 1)), p0:(OR (EQ s4 0) (EQ s17 0) (EQ s182 0) (EQ s313 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 762 reset in 573 ms.
Product exploration explored 100000 steps with 328 reset in 383 ms.
Computed a total of 51 stabilizing places and 52 stable transitions
Computed a total of 51 stabilizing places and 52 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 386 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 77 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 325809 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 325809 steps, saw 59755 distinct states, run finished after 3002 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 17:41:18] [INFO ] Invariant cache hit.
[2023-03-12 17:41:18] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-12 17:41:18] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 17:41:18] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-12 17:41:19] [INFO ] After 732ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 17:41:20] [INFO ] Deduced a trap composed of 31 places in 1038 ms of which 1 ms to minimize.
[2023-03-12 17:41:21] [INFO ] Deduced a trap composed of 31 places in 975 ms of which 1 ms to minimize.
[2023-03-12 17:41:22] [INFO ] Deduced a trap composed of 31 places in 735 ms of which 1 ms to minimize.
[2023-03-12 17:41:23] [INFO ] Deduced a trap composed of 31 places in 993 ms of which 2 ms to minimize.
[2023-03-12 17:41:24] [INFO ] Deduced a trap composed of 31 places in 876 ms of which 1 ms to minimize.
[2023-03-12 17:41:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4929 ms
[2023-03-12 17:41:24] [INFO ] After 5941ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 151 ms.
[2023-03-12 17:41:24] [INFO ] After 6320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 80 ms.
Support contains 6 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 328 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1862 edges and 345 vertex of which 343 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 128 rules applied. Total rules applied 130 place count 343 transition count 1642
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 185 rules applied. Total rules applied 315 place count 217 transition count 1583
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 350 place count 182 transition count 1583
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 350 place count 182 transition count 1577
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 362 place count 176 transition count 1577
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 522 place count 96 transition count 1497
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 523 place count 96 transition count 1496
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 542 place count 77 transition count 1305
Iterating global reduction 4 with 19 rules applied. Total rules applied 561 place count 77 transition count 1305
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 569 place count 77 transition count 1297
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 571 place count 76 transition count 1296
Free-agglomeration rule applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 583 place count 76 transition count 1284
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 595 place count 64 transition count 1284
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 596 place count 64 transition count 1284
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 597 place count 63 transition count 1283
Applied a total of 597 rules in 419 ms. Remains 63 /347 variables (removed 284) and now considering 1283/1774 (removed 491) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 419 ms. Remains : 63/347 places, 1283/1774 transitions.
Incomplete random walk after 10000 steps, including 107 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 3) seen :2
Finished Best-First random walk after 1522 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=380 )
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F p2), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 7 factoid took 662 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 189 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 347 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 21 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
[2023-03-12 17:41:26] [INFO ] Invariant cache hit.
[2023-03-12 17:41:27] [INFO ] Implicit Places using invariants in 649 ms returned []
[2023-03-12 17:41:27] [INFO ] Invariant cache hit.
[2023-03-12 17:41:28] [INFO ] Implicit Places using invariants and state equation in 1165 ms returned []
Implicit Place search using SMT with State Equation took 1836 ms to find 0 implicit places.
[2023-03-12 17:41:28] [INFO ] Invariant cache hit.
[2023-03-12 17:41:29] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2574 ms. Remains : 347/347 places, 1774/1774 transitions.
Computed a total of 51 stabilizing places and 52 stable transitions
Computed a total of 51 stabilizing places and 52 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 243 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 76 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-12 17:41:29] [INFO ] Invariant cache hit.
[2023-03-12 17:41:30] [INFO ] [Real]Absence check using 15 positive place invariants in 45 ms returned sat
[2023-03-12 17:41:30] [INFO ] After 532ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 17:41:31] [INFO ] Deduced a trap composed of 31 places in 987 ms of which 1 ms to minimize.
[2023-03-12 17:41:32] [INFO ] Deduced a trap composed of 31 places in 757 ms of which 0 ms to minimize.
[2023-03-12 17:41:33] [INFO ] Deduced a trap composed of 31 places in 665 ms of which 1 ms to minimize.
[2023-03-12 17:41:33] [INFO ] Deduced a trap composed of 31 places in 654 ms of which 0 ms to minimize.
[2023-03-12 17:41:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3372 ms
[2023-03-12 17:41:34] [INFO ] After 3940ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:41:34] [INFO ] After 4089ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:41:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 25 ms returned sat
[2023-03-12 17:41:34] [INFO ] After 790ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:41:35] [INFO ] Deduced a trap composed of 31 places in 923 ms of which 1 ms to minimize.
[2023-03-12 17:41:36] [INFO ] Deduced a trap composed of 31 places in 739 ms of which 1 ms to minimize.
[2023-03-12 17:41:37] [INFO ] Deduced a trap composed of 31 places in 687 ms of which 0 ms to minimize.
[2023-03-12 17:41:38] [INFO ] Deduced a trap composed of 31 places in 1262 ms of which 0 ms to minimize.
[2023-03-12 17:41:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3877 ms
[2023-03-12 17:41:38] [INFO ] After 4739ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-12 17:41:38] [INFO ] After 4920ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 329 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1862 edges and 345 vertex of which 343 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 128 rules applied. Total rules applied 130 place count 343 transition count 1642
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 185 rules applied. Total rules applied 315 place count 217 transition count 1583
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 350 place count 182 transition count 1583
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 350 place count 182 transition count 1577
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 362 place count 176 transition count 1577
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 524 place count 95 transition count 1496
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 525 place count 95 transition count 1495
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 545 place count 75 transition count 1294
Iterating global reduction 4 with 20 rules applied. Total rules applied 565 place count 75 transition count 1294
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 574 place count 75 transition count 1285
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 576 place count 74 transition count 1284
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 587 place count 74 transition count 1273
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 598 place count 63 transition count 1273
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 599 place count 63 transition count 1273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 600 place count 62 transition count 1272
Applied a total of 600 rules in 473 ms. Remains 62 /347 variables (removed 285) and now considering 1272/1774 (removed 502) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 473 ms. Remains : 62/347 places, 1272/1774 transitions.
Incomplete random walk after 10000 steps, including 52 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Finished Best-First random walk after 1516 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=505 )
Knowledge obtained : [(AND (NOT p2) p0), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F p2), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 6 factoid took 454 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 196 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 195 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 708 reset in 441 ms.
Product exploration explored 100000 steps with 764 reset in 462 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 180 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 328 edges and 347 vertex of which 4 / 347 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.
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 125 rules applied. Total rules applied 126 place count 345 transition count 1772
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 149 place count 345 transition count 1749
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 149 place count 345 transition count 1749
Deduced a syphon composed of 150 places in 2 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 174 place count 345 transition count 1749
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 282 place count 237 transition count 1641
Deduced a syphon composed of 43 places in 2 ms
Iterating global reduction 2 with 108 rules applied. Total rules applied 390 place count 237 transition count 1641
Performed 96 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 139 places in 1 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 486 place count 237 transition count 1652
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 488 place count 237 transition count 1650
Discarding 82 places :
Symmetric choice reduction at 3 with 82 rule applications. Total rules 570 place count 155 transition count 1396
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 3 with 82 rules applied. Total rules applied 652 place count 155 transition count 1396
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 668 place count 155 transition count 1380
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 677 place count 146 transition count 1371
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 686 place count 146 transition count 1371
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 687 place count 146 transition count 1371
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 689 place count 144 transition count 1369
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 691 place count 144 transition count 1369
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 692 place count 144 transition count 1371
Deduced a syphon composed of 67 places in 0 ms
Applied a total of 692 rules in 326 ms. Remains 144 /347 variables (removed 203) and now considering 1371/1774 (removed 403) transitions.
[2023-03-12 17:41:42] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 1371 rows 144 cols
[2023-03-12 17:41:42] [INFO ] Computed 14 place invariants in 23 ms
[2023-03-12 17:41:43] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/347 places, 1371/1774 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1051 ms. Remains : 144/347 places, 1371/1774 transitions.
Support contains 6 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 9 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2023-03-12 17:41:43] [INFO ] Computed 15 place invariants in 9 ms
[2023-03-12 17:41:43] [INFO ] Implicit Places using invariants in 811 ms returned []
[2023-03-12 17:41:43] [INFO ] Invariant cache hit.
[2023-03-12 17:41:45] [INFO ] Implicit Places using invariants and state equation in 1718 ms returned []
Implicit Place search using SMT with State Equation took 2577 ms to find 0 implicit places.
[2023-03-12 17:41:45] [INFO ] Invariant cache hit.
[2023-03-12 17:41:46] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3470 ms. Remains : 347/347 places, 1774/1774 transitions.
Treatment of property AutonomousCar-PT-10b-LTLFireability-01 finished in 37133 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(G((F(p2)&&p1))))))'
Support contains 8 out of 349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Graph (trivial) has 327 edges and 349 vertex of which 4 / 349 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 removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 346 transition count 1651
Reduce places removed 122 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 176 rules applied. Total rules applied 299 place count 224 transition count 1597
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 33 rules applied. Total rules applied 332 place count 192 transition count 1596
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 333 place count 191 transition count 1596
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 333 place count 191 transition count 1588
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 349 place count 183 transition count 1588
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 351 place count 181 transition count 1586
Iterating global reduction 4 with 2 rules applied. Total rules applied 353 place count 181 transition count 1586
Performed 79 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 4 with 158 rules applied. Total rules applied 511 place count 102 transition count 1506
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 512 place count 102 transition count 1505
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 531 place count 83 transition count 1315
Iterating global reduction 5 with 19 rules applied. Total rules applied 550 place count 83 transition count 1315
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 559 place count 83 transition count 1306
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 563 place count 81 transition count 1304
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 564 place count 81 transition count 1304
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 566 place count 79 transition count 1302
Applied a total of 566 rules in 375 ms. Remains 79 /349 variables (removed 270) and now considering 1302/1776 (removed 474) transitions.
// Phase 1: matrix 1302 rows 79 cols
[2023-03-12 17:41:47] [INFO ] Computed 14 place invariants in 17 ms
[2023-03-12 17:41:48] [INFO ] Implicit Places using invariants in 862 ms returned []
[2023-03-12 17:41:48] [INFO ] Invariant cache hit.
[2023-03-12 17:41:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:41:49] [INFO ] Implicit Places using invariants and state equation in 1515 ms returned [74, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2394 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/349 places, 1302/1776 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 76 transition count 1301
Applied a total of 2 rules in 158 ms. Remains 76 /77 variables (removed 1) and now considering 1301/1302 (removed 1) transitions.
// Phase 1: matrix 1301 rows 76 cols
[2023-03-12 17:41:50] [INFO ] Computed 12 place invariants in 30 ms
[2023-03-12 17:41:50] [INFO ] Implicit Places using invariants in 879 ms returned []
[2023-03-12 17:41:50] [INFO ] Invariant cache hit.
[2023-03-12 17:41:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:41:52] [INFO ] Implicit Places using invariants and state equation in 1217 ms returned []
Implicit Place search using SMT with State Equation took 2108 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/349 places, 1301/1776 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5048 ms. Remains : 76/349 places, 1301/1776 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s5 0) (EQ s35 0) (EQ s70 0)), p1:(AND (EQ s1 1) (EQ s9 1) (EQ s29 1) (EQ s70 1) (EQ s47 1)), p2:(EQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-02 finished in 5318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0) U p1))||((F(p0) U p1)&&F(p2))))'
Support contains 16 out of 349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Graph (trivial) has 305 edges and 349 vertex of which 4 / 349 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 removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 126 place count 346 transition count 1648
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 1 with 180 rules applied. Total rules applied 306 place count 221 transition count 1593
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 34 rules applied. Total rules applied 340 place count 188 transition count 1592
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 343 place count 187 transition count 1590
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 344 place count 186 transition count 1590
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 344 place count 186 transition count 1585
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 354 place count 181 transition count 1585
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 356 place count 179 transition count 1583
Iterating global reduction 5 with 2 rules applied. Total rules applied 358 place count 179 transition count 1583
Performed 69 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 5 with 138 rules applied. Total rules applied 496 place count 110 transition count 1513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 497 place count 110 transition count 1512
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 513 place count 94 transition count 1356
Iterating global reduction 6 with 16 rules applied. Total rules applied 529 place count 94 transition count 1356
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 539 place count 94 transition count 1346
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 543 place count 92 transition count 1344
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 545 place count 90 transition count 1342
Applied a total of 545 rules in 274 ms. Remains 90 /349 variables (removed 259) and now considering 1342/1776 (removed 434) transitions.
// Phase 1: matrix 1342 rows 90 cols
[2023-03-12 17:41:52] [INFO ] Computed 14 place invariants in 26 ms
[2023-03-12 17:41:53] [INFO ] Implicit Places using invariants in 438 ms returned []
[2023-03-12 17:41:53] [INFO ] Invariant cache hit.
[2023-03-12 17:41:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:41:53] [INFO ] Implicit Places using invariants and state equation in 814 ms returned [85, 89]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1278 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/349 places, 1342/1776 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 87 transition count 1341
Applied a total of 2 rules in 97 ms. Remains 87 /88 variables (removed 1) and now considering 1341/1342 (removed 1) transitions.
// Phase 1: matrix 1341 rows 87 cols
[2023-03-12 17:41:54] [INFO ] Computed 12 place invariants in 18 ms
[2023-03-12 17:41:54] [INFO ] Implicit Places using invariants in 667 ms returned []
[2023-03-12 17:41:54] [INFO ] Invariant cache hit.
[2023-03-12 17:41:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:41:55] [INFO ] Implicit Places using invariants and state equation in 974 ms returned []
Implicit Place search using SMT with State Equation took 1642 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/349 places, 1341/1776 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3291 ms. Remains : 87/349 places, 1341/1776 transitions.
Stuttering acceptance computed with spot in 424 ms :[(NOT p1), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s5 1) (EQ s24 1) (EQ s82 1)), p0:(AND (EQ s16 1) (EQ s23 1) (EQ s32 1) (EQ s41 1) (EQ s47 1) (EQ s51 1) (EQ s58 1) (EQ s67 1) (EQ s7...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-03 finished in 3737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((G(p0) U p1)))&&(p2||X(X(p3))))))'
Support contains 18 out of 349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 348 transition count 1775
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 348 transition count 1775
Applied a total of 2 rules in 38 ms. Remains 348 /349 variables (removed 1) and now considering 1775/1776 (removed 1) transitions.
// Phase 1: matrix 1775 rows 348 cols
[2023-03-12 17:41:56] [INFO ] Computed 15 place invariants in 12 ms
[2023-03-12 17:41:56] [INFO ] Implicit Places using invariants in 654 ms returned []
[2023-03-12 17:41:56] [INFO ] Invariant cache hit.
[2023-03-12 17:41:57] [INFO ] Implicit Places using invariants and state equation in 1030 ms returned []
Implicit Place search using SMT with State Equation took 1710 ms to find 0 implicit places.
[2023-03-12 17:41:57] [INFO ] Invariant cache hit.
[2023-03-12 17:41:58] [INFO ] Dead Transitions using invariants and state equation in 831 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 348/349 places, 1775/1776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2582 ms. Remains : 348/349 places, 1775/1776 transitions.
Stuttering acceptance computed with spot in 442 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p3), true]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 5}], [{ cond=(OR p1 p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0, 1} source=7 dest: 7}]], initial=0, aps=[p2:(EQ s50 1), p1:(AND (EQ s4 1) (EQ s12 1) (EQ s199 1) (EQ s314 1)), p0:(AND (EQ s4 1) (EQ s6 1) (EQ s233 1) (EQ s314 1)), p3:(AND (EQ s68 1) (EQ s88 1) ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 128 steps with 0 reset in 4 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-04 finished in 3088 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (G((F(p0)||G(!p1)))||((F(p0)||G(!p1))&&(G(!p1)||(!p1&&F(p2))))))))'
Support contains 20 out of 349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 348 transition count 1775
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 348 transition count 1775
Applied a total of 2 rules in 50 ms. Remains 348 /349 variables (removed 1) and now considering 1775/1776 (removed 1) transitions.
// Phase 1: matrix 1775 rows 348 cols
[2023-03-12 17:41:59] [INFO ] Computed 15 place invariants in 23 ms
[2023-03-12 17:41:59] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-12 17:41:59] [INFO ] Invariant cache hit.
[2023-03-12 17:42:00] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1303 ms to find 0 implicit places.
[2023-03-12 17:42:00] [INFO ] Invariant cache hit.
[2023-03-12 17:42:01] [INFO ] Dead Transitions using invariants and state equation in 1135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 348/349 places, 1775/1776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2504 ms. Remains : 348/349 places, 1775/1776 transitions.
Stuttering acceptance computed with spot in 358 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s67 1) (EQ s87 1) (EQ s117 1) (EQ s142 1) (EQ s163 1) (EQ s188 1) (EQ s218 1) (EQ s238 1) (EQ s263 1) (EQ s293 1) (EQ s315 1)), p0:(NEQ s122 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 767 reset in 489 ms.
Product exploration explored 100000 steps with 188 reset in 260 ms.
Computed a total of 52 stabilizing places and 53 stable transitions
Computed a total of 52 stabilizing places and 53 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 936 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 76 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 17:42:04] [INFO ] Invariant cache hit.
[2023-03-12 17:42:04] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-12 17:42:04] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p2) (NOT p0) p1)))]
False Knowledge obtained : [(F p2), (F (AND (NOT p2) (NOT p0)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p2) (NOT p0) p1)))
Knowledge based reduction with 13 factoid took 827 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10b-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10b-LTLFireability-05 finished in 6107 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Graph (trivial) has 329 edges and 349 vertex of which 4 / 349 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 removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 126 place count 346 transition count 1648
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 182 rules applied. Total rules applied 308 place count 221 transition count 1591
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 342 place count 187 transition count 1591
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 342 place count 187 transition count 1584
Deduced a syphon composed of 7 places in 15 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 356 place count 180 transition count 1584
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 358 place count 178 transition count 1582
Iterating global reduction 3 with 2 rules applied. Total rules applied 360 place count 178 transition count 1582
Performed 79 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 518 place count 99 transition count 1502
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 519 place count 99 transition count 1501
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 539 place count 79 transition count 1301
Iterating global reduction 4 with 20 rules applied. Total rules applied 559 place count 79 transition count 1301
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 569 place count 79 transition count 1291
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 573 place count 77 transition count 1289
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 574 place count 76 transition count 1288
Applied a total of 574 rules in 468 ms. Remains 76 /349 variables (removed 273) and now considering 1288/1776 (removed 488) transitions.
// Phase 1: matrix 1288 rows 76 cols
[2023-03-12 17:42:05] [INFO ] Computed 14 place invariants in 7 ms
[2023-03-12 17:42:06] [INFO ] Implicit Places using invariants in 785 ms returned []
[2023-03-12 17:42:06] [INFO ] Invariant cache hit.
[2023-03-12 17:42:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:42:07] [INFO ] Implicit Places using invariants and state equation in 1267 ms returned [71, 75]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2058 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/349 places, 1288/1776 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 73 transition count 1287
Applied a total of 2 rules in 110 ms. Remains 73 /74 variables (removed 1) and now considering 1287/1288 (removed 1) transitions.
// Phase 1: matrix 1287 rows 73 cols
[2023-03-12 17:42:07] [INFO ] Computed 12 place invariants in 17 ms
[2023-03-12 17:42:08] [INFO ] Implicit Places using invariants in 958 ms returned []
[2023-03-12 17:42:08] [INFO ] Invariant cache hit.
[2023-03-12 17:42:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:42:10] [INFO ] Implicit Places using invariants and state equation in 1160 ms returned []
Implicit Place search using SMT with State Equation took 2133 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 73/349 places, 1287/1776 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4769 ms. Remains : 73/349 places, 1287/1776 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s2 1) (NEQ s3 1) (NEQ s38 1) (NEQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 625 reset in 246 ms.
Product exploration explored 100000 steps with 96 reset in 135 ms.
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 186 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 39 ms :[(NOT p0)]
Finished random walk after 535 steps, including 23 resets, run visited all 1 properties in 15 ms. (steps per millisecond=35 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 230 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 95 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 1287/1287 transitions.
Applied a total of 0 rules in 137 ms. Remains 73 /73 variables (removed 0) and now considering 1287/1287 (removed 0) transitions.
[2023-03-12 17:42:11] [INFO ] Invariant cache hit.
[2023-03-12 17:42:12] [INFO ] Implicit Places using invariants in 912 ms returned []
[2023-03-12 17:42:12] [INFO ] Invariant cache hit.
[2023-03-12 17:42:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:42:13] [INFO ] Implicit Places using invariants and state equation in 1405 ms returned []
Implicit Place search using SMT with State Equation took 2323 ms to find 0 implicit places.
[2023-03-12 17:42:13] [INFO ] Redundant transitions in 77 ms returned [1074]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1286 rows 73 cols
[2023-03-12 17:42:13] [INFO ] Computed 12 place invariants in 11 ms
[2023-03-12 17:42:14] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/73 places, 1286/1287 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 71 transition count 1284
Applied a total of 2 rules in 96 ms. Remains 71 /73 variables (removed 2) and now considering 1284/1286 (removed 2) transitions.
// Phase 1: matrix 1284 rows 71 cols
[2023-03-12 17:42:14] [INFO ] Computed 12 place invariants in 9 ms
[2023-03-12 17:42:15] [INFO ] Implicit Places using invariants in 822 ms returned []
[2023-03-12 17:42:15] [INFO ] Invariant cache hit.
[2023-03-12 17:42:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:42:16] [INFO ] Implicit Places using invariants and state equation in 1148 ms returned []
Implicit Place search using SMT with State Equation took 1986 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/73 places, 1284/1287 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5132 ms. Remains : 71/73 places, 1284/1287 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 163 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 60 ms :[(NOT p0)]
Finished random walk after 130 steps, including 6 resets, run visited all 1 properties in 3 ms. (steps per millisecond=43 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 218 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 67 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
Product exploration explored 100000 steps with 132 reset in 113 ms.
Product exploration explored 100000 steps with 167 reset in 125 ms.
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 1284/1284 transitions.
Applied a total of 0 rules in 81 ms. Remains 71 /71 variables (removed 0) and now considering 1284/1284 (removed 0) transitions.
[2023-03-12 17:42:17] [INFO ] Invariant cache hit.
[2023-03-12 17:42:18] [INFO ] Implicit Places using invariants in 818 ms returned []
[2023-03-12 17:42:18] [INFO ] Invariant cache hit.
[2023-03-12 17:42:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:42:19] [INFO ] Implicit Places using invariants and state equation in 1052 ms returned []
Implicit Place search using SMT with State Equation took 1884 ms to find 0 implicit places.
[2023-03-12 17:42:19] [INFO ] Redundant transitions in 124 ms returned []
[2023-03-12 17:42:19] [INFO ] Invariant cache hit.
[2023-03-12 17:42:20] [INFO ] Dead Transitions using invariants and state equation in 1161 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3263 ms. Remains : 71/71 places, 1284/1284 transitions.
Treatment of property AutonomousCar-PT-10b-LTLFireability-06 finished in 15447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 16 out of 349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Graph (trivial) has 302 edges and 349 vertex of which 4 / 349 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 removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 127 rules applied. Total rules applied 128 place count 346 transition count 1646
Reduce places removed 127 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 184 rules applied. Total rules applied 312 place count 219 transition count 1589
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 346 place count 185 transition count 1589
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 346 place count 185 transition count 1583
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 358 place count 179 transition count 1583
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 360 place count 177 transition count 1581
Iterating global reduction 3 with 2 rules applied. Total rules applied 362 place count 177 transition count 1581
Performed 65 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 492 place count 112 transition count 1515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 493 place count 112 transition count 1514
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 504 place count 101 transition count 1413
Iterating global reduction 4 with 11 rules applied. Total rules applied 515 place count 101 transition count 1413
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 525 place count 101 transition count 1403
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 529 place count 99 transition count 1401
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 531 place count 97 transition count 1399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 532 place count 96 transition count 1399
Applied a total of 532 rules in 287 ms. Remains 96 /349 variables (removed 253) and now considering 1399/1776 (removed 377) transitions.
// Phase 1: matrix 1399 rows 96 cols
[2023-03-12 17:42:21] [INFO ] Computed 13 place invariants in 23 ms
[2023-03-12 17:42:21] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-12 17:42:21] [INFO ] Invariant cache hit.
[2023-03-12 17:42:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:42:22] [INFO ] Implicit Places using invariants and state equation in 826 ms returned [91, 95]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1149 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/349 places, 1399/1776 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 93 transition count 1398
Applied a total of 2 rules in 86 ms. Remains 93 /94 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 93 cols
[2023-03-12 17:42:22] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-12 17:42:22] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-12 17:42:22] [INFO ] Invariant cache hit.
[2023-03-12 17:42:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:42:23] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 925 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/349 places, 1398/1776 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2447 ms. Remains : 93/349 places, 1398/1776 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s14 0) (EQ s25 0) (EQ s33 0) (EQ s37 0) (EQ s48 0) (EQ s52 0) (EQ s60 0) (EQ s71 0) (EQ s75 0) (EQ s82 0) (EQ s89 0)), p1:(OR (EQ s14 0) (EQ s2...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 292 reset in 198 ms.
Product exploration explored 100000 steps with 250 reset in 172 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 : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 554 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 351 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 17:42:24] [INFO ] Invariant cache hit.
[2023-03-12 17:42:24] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:42:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 17:42:25] [INFO ] After 340ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-12 17:42:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:42:25] [INFO ] After 31ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-12 17:42:25] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-12 17:42:25] [INFO ] After 529ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 16 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 1398/1398 transitions.
Graph (complete) has 1102 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 92 transition count 1395
Free-agglomeration rule applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 23 place count 92 transition count 1375
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 43 place count 72 transition count 1375
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 72 transition count 1376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 71 transition count 1376
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 55 place count 71 transition count 1376
Applied a total of 55 rules in 315 ms. Remains 71 /93 variables (removed 22) and now considering 1376/1398 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 316 ms. Remains : 71/93 places, 1376/1398 transitions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 764447 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :{}
Probabilistic random walk after 764447 steps, saw 109124 distinct states, run finished after 3001 ms. (steps per millisecond=254 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1376 rows 71 cols
[2023-03-12 17:42:28] [INFO ] Computed 11 place invariants in 13 ms
[2023-03-12 17:42:28] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:42:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-12 17:42:29] [INFO ] After 341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:42:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:42:29] [INFO ] After 32ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:42:29] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-12 17:42:29] [INFO ] After 558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 16 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 1376/1376 transitions.
Applied a total of 0 rules in 97 ms. Remains 71 /71 variables (removed 0) and now considering 1376/1376 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 71/71 places, 1376/1376 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 1376/1376 transitions.
Applied a total of 0 rules in 54 ms. Remains 71 /71 variables (removed 0) and now considering 1376/1376 (removed 0) transitions.
[2023-03-12 17:42:29] [INFO ] Invariant cache hit.
[2023-03-12 17:42:29] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-12 17:42:29] [INFO ] Invariant cache hit.
[2023-03-12 17:42:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:42:30] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
[2023-03-12 17:42:30] [INFO ] Redundant transitions in 137 ms returned []
[2023-03-12 17:42:30] [INFO ] Invariant cache hit.
[2023-03-12 17:42:31] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1879 ms. Remains : 71/71 places, 1376/1376 transitions.
Applied a total of 0 rules in 57 ms. Remains 71 /71 variables (removed 0) and now considering 1376/1376 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-12 17:42:31] [INFO ] Invariant cache hit.
[2023-03-12 17:42:31] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:42:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 17:42:32] [INFO ] After 408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:42:32] [INFO ] After 471ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-12 17:42:32] [INFO ] After 577ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 10 factoid took 693 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
Support contains 16 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 1398/1398 transitions.
Applied a total of 0 rules in 95 ms. Remains 93 /93 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
// Phase 1: matrix 1398 rows 93 cols
[2023-03-12 17:42:33] [INFO ] Computed 11 place invariants in 14 ms
[2023-03-12 17:42:33] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-12 17:42:33] [INFO ] Invariant cache hit.
[2023-03-12 17:42:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:42:34] [INFO ] Implicit Places using invariants and state equation in 700 ms returned []
Implicit Place search using SMT with State Equation took 1088 ms to find 0 implicit places.
[2023-03-12 17:42:34] [INFO ] Redundant transitions in 92 ms returned [1095]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1397 rows 93 cols
[2023-03-12 17:42:34] [INFO ] Computed 11 place invariants in 6 ms
[2023-03-12 17:42:34] [INFO ] Dead Transitions using invariants and state equation in 594 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/93 places, 1397/1398 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 91 transition count 1395
Applied a total of 2 rules in 68 ms. Remains 91 /93 variables (removed 2) and now considering 1395/1397 (removed 2) transitions.
// Phase 1: matrix 1395 rows 91 cols
[2023-03-12 17:42:34] [INFO ] Computed 11 place invariants in 32 ms
[2023-03-12 17:42:35] [INFO ] Implicit Places using invariants in 399 ms returned []
[2023-03-12 17:42:35] [INFO ] Invariant cache hit.
[2023-03-12 17:42:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:42:35] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 1036 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 91/93 places, 1395/1398 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2986 ms. Remains : 91/93 places, 1395/1398 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 : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 637 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 367 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 17:42:37] [INFO ] Invariant cache hit.
[2023-03-12 17:42:37] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:42:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 17:42:37] [INFO ] After 369ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-12 17:42:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:42:37] [INFO ] After 32ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-12 17:42:37] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-12 17:42:37] [INFO ] After 676ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 16 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 1395/1395 transitions.
Graph (complete) has 1096 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions 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 90 transition count 1393
Free-agglomeration rule applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 22 place count 90 transition count 1373
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 42 place count 70 transition count 1373
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 52 place count 70 transition count 1373
Applied a total of 52 rules in 300 ms. Remains 70 /91 variables (removed 21) and now considering 1373/1395 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 311 ms. Remains : 70/91 places, 1373/1395 transitions.
Finished random walk after 4260 steps, including 15 resets, run visited all 1 properties in 55 ms. (steps per millisecond=77 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 777 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 30 reset in 178 ms.
Product exploration explored 100000 steps with 1667 reset in 456 ms.
Support contains 16 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 1395/1395 transitions.
Applied a total of 0 rules in 60 ms. Remains 91 /91 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
[2023-03-12 17:42:40] [INFO ] Invariant cache hit.
[2023-03-12 17:42:40] [INFO ] Implicit Places using invariants in 372 ms returned []
[2023-03-12 17:42:40] [INFO ] Invariant cache hit.
[2023-03-12 17:42:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:42:41] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1294 ms to find 0 implicit places.
[2023-03-12 17:42:41] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-12 17:42:41] [INFO ] Invariant cache hit.
[2023-03-12 17:42:42] [INFO ] Dead Transitions using invariants and state equation in 694 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2125 ms. Remains : 91/91 places, 1395/1395 transitions.
Treatment of property AutonomousCar-PT-10b-LTLFireability-07 finished in 21579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((!p0 U G(p0)))&&F(p1))))'
Support contains 16 out of 349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 347 transition count 1774
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 347 transition count 1774
Applied a total of 4 rules in 36 ms. Remains 347 /349 variables (removed 2) and now considering 1774/1776 (removed 2) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2023-03-12 17:42:42] [INFO ] Computed 15 place invariants in 24 ms
[2023-03-12 17:42:42] [INFO ] Implicit Places using invariants in 424 ms returned []
[2023-03-12 17:42:42] [INFO ] Invariant cache hit.
[2023-03-12 17:42:43] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 1342 ms to find 0 implicit places.
[2023-03-12 17:42:43] [INFO ] Invariant cache hit.
[2023-03-12 17:42:44] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 347/349 places, 1774/1776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2132 ms. Remains : 347/349 places, 1774/1776 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s62 1) (EQ s92 1) (EQ s117 1) (EQ s142 1) (EQ s162 1) (EQ s192 1) (EQ s212 1) (EQ s242 1) (EQ s267 1) (EQ s292 1) (EQ s314 1)), p0:(AND (EQ s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 118 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-09 finished in 2401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 11 out of 349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 347 transition count 1774
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 347 transition count 1774
Applied a total of 4 rules in 38 ms. Remains 347 /349 variables (removed 2) and now considering 1774/1776 (removed 2) transitions.
[2023-03-12 17:42:44] [INFO ] Invariant cache hit.
[2023-03-12 17:42:45] [INFO ] Implicit Places using invariants in 628 ms returned []
[2023-03-12 17:42:45] [INFO ] Invariant cache hit.
[2023-03-12 17:42:46] [INFO ] Implicit Places using invariants and state equation in 986 ms returned []
Implicit Place search using SMT with State Equation took 1618 ms to find 0 implicit places.
[2023-03-12 17:42:46] [INFO ] Invariant cache hit.
[2023-03-12 17:42:47] [INFO ] Dead Transitions using invariants and state equation in 1079 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 347/349 places, 1774/1776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2735 ms. Remains : 347/349 places, 1774/1776 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s62 1) (EQ s92 1) (EQ s117 1) (EQ s137 1) (EQ s162 1) (EQ s187 1) (EQ s212 1) (EQ s237 1) (EQ s262 1) (EQ s292 1) (EQ s314 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-10 finished in 2932 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 347 transition count 1774
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 347 transition count 1774
Applied a total of 4 rules in 43 ms. Remains 347 /349 variables (removed 2) and now considering 1774/1776 (removed 2) transitions.
[2023-03-12 17:42:47] [INFO ] Invariant cache hit.
[2023-03-12 17:42:48] [INFO ] Implicit Places using invariants in 1002 ms returned []
[2023-03-12 17:42:48] [INFO ] Invariant cache hit.
[2023-03-12 17:42:50] [INFO ] Implicit Places using invariants and state equation in 1371 ms returned []
Implicit Place search using SMT with State Equation took 2375 ms to find 0 implicit places.
[2023-03-12 17:42:50] [INFO ] Invariant cache hit.
[2023-03-12 17:42:51] [INFO ] Dead Transitions using invariants and state equation in 957 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 347/349 places, 1774/1776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3379 ms. Remains : 347/349 places, 1774/1776 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s4 1) (NEQ s16 1) (NEQ s61 1) (NEQ s313 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 487 ms.
Product exploration explored 100000 steps with 50000 reset in 403 ms.
Computed a total of 51 stabilizing places and 52 stable transitions
Computed a total of 51 stabilizing places and 52 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10b-LTLFireability-13 finished in 4510 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 15 out of 349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 347 transition count 1774
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 347 transition count 1774
Applied a total of 4 rules in 16 ms. Remains 347 /349 variables (removed 2) and now considering 1774/1776 (removed 2) transitions.
[2023-03-12 17:42:52] [INFO ] Invariant cache hit.
[2023-03-12 17:42:52] [INFO ] Implicit Places using invariants in 498 ms returned []
[2023-03-12 17:42:52] [INFO ] Invariant cache hit.
[2023-03-12 17:42:53] [INFO ] Implicit Places using invariants and state equation in 961 ms returned []
Implicit Place search using SMT with State Equation took 1462 ms to find 0 implicit places.
[2023-03-12 17:42:53] [INFO ] Invariant cache hit.
[2023-03-12 17:42:54] [INFO ] Dead Transitions using invariants and state equation in 780 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 347/349 places, 1774/1776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2259 ms. Remains : 347/349 places, 1774/1776 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s67 1) (EQ s92 1) (EQ s112 1) (EQ s137 1) (EQ s167 1) (EQ s187 1) (EQ s217 1) (EQ s242 1) (EQ s262 1) (EQ s292 1) (EQ s314 1)), p1:(AND (EQ s4...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-14 finished in 2491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U G(p0)))'
Support contains 4 out of 349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 347 transition count 1774
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 347 transition count 1774
Applied a total of 4 rules in 16 ms. Remains 347 /349 variables (removed 2) and now considering 1774/1776 (removed 2) transitions.
[2023-03-12 17:42:54] [INFO ] Invariant cache hit.
[2023-03-12 17:42:55] [INFO ] Implicit Places using invariants in 979 ms returned []
[2023-03-12 17:42:55] [INFO ] Invariant cache hit.
[2023-03-12 17:42:57] [INFO ] Implicit Places using invariants and state equation in 1455 ms returned []
Implicit Place search using SMT with State Equation took 2447 ms to find 0 implicit places.
[2023-03-12 17:42:57] [INFO ] Invariant cache hit.
[2023-03-12 17:42:58] [INFO ] Dead Transitions using invariants and state equation in 891 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 347/349 places, 1774/1776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3367 ms. Remains : 347/349 places, 1774/1776 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s4 1) (EQ s6 1) (EQ s213 1) (EQ s313 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-15 finished in 3540 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&(p1||G(p0))))||X(F(p2))))'
Found a Shortening insensitive property : AutonomousCar-PT-10b-LTLFireability-01
Stuttering acceptance computed with spot in 186 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 349 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Graph (trivial) has 309 edges and 349 vertex of which 4 / 349 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 removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 127 rules applied. Total rules applied 128 place count 346 transition count 1646
Reduce places removed 127 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 184 rules applied. Total rules applied 312 place count 219 transition count 1589
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 346 place count 185 transition count 1589
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 346 place count 185 transition count 1584
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 356 place count 180 transition count 1584
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 358 place count 178 transition count 1582
Iterating global reduction 3 with 2 rules applied. Total rules applied 360 place count 178 transition count 1582
Performed 68 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 496 place count 110 transition count 1513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 497 place count 110 transition count 1512
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 510 place count 97 transition count 1387
Iterating global reduction 4 with 13 rules applied. Total rules applied 523 place count 97 transition count 1387
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 531 place count 97 transition count 1379
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 535 place count 95 transition count 1377
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 537 place count 95 transition count 1377
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 539 place count 93 transition count 1375
Applied a total of 539 rules in 336 ms. Remains 93 /349 variables (removed 256) and now considering 1375/1776 (removed 401) transitions.
// Phase 1: matrix 1375 rows 93 cols
[2023-03-12 17:42:58] [INFO ] Computed 14 place invariants in 6 ms
[2023-03-12 17:42:59] [INFO ] Implicit Places using invariants in 668 ms returned []
[2023-03-12 17:42:59] [INFO ] Invariant cache hit.
[2023-03-12 17:42:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:43:00] [INFO ] Implicit Places using invariants and state equation in 752 ms returned [88, 92]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1458 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 91/349 places, 1375/1776 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 90 transition count 1374
Applied a total of 2 rules in 57 ms. Remains 90 /91 variables (removed 1) and now considering 1374/1375 (removed 1) transitions.
// Phase 1: matrix 1374 rows 90 cols
[2023-03-12 17:43:00] [INFO ] Computed 12 place invariants in 22 ms
[2023-03-12 17:43:00] [INFO ] Implicit Places using invariants in 489 ms returned []
[2023-03-12 17:43:00] [INFO ] Invariant cache hit.
[2023-03-12 17:43:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:43:01] [INFO ] Implicit Places using invariants and state equation in 985 ms returned []
Implicit Place search using SMT with State Equation took 1522 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 90/349 places, 1374/1776 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3386 ms. Remains : 90/349 places, 1374/1776 transitions.
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(AND (EQ s1 1) (EQ s4 1) (EQ s69 1) (EQ s85 1)), p0:(OR (EQ s1 0) (EQ s10 0) (EQ s48 0) (EQ s85 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1159 reset in 366 ms.
Product exploration explored 100000 steps with 991 reset in 281 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 : [(AND (NOT p2) p0), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 597 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 357 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 414898 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :{}
Probabilistic random walk after 414898 steps, saw 66690 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 17:43:06] [INFO ] Invariant cache hit.
[2023-03-12 17:43:06] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-12 17:43:06] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 17:43:06] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 17:43:07] [INFO ] After 558ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 17:43:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:43:07] [INFO ] After 180ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 17:43:08] [INFO ] Deduced a trap composed of 7 places in 590 ms of which 1 ms to minimize.
[2023-03-12 17:43:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 662 ms
[2023-03-12 17:43:08] [INFO ] After 1075ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 130 ms.
[2023-03-12 17:43:08] [INFO ] After 1841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 1374/1374 transitions.
Graph (complete) has 1150 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 89 transition count 1371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 89 transition count 1370
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 88 transition count 1370
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 17 place count 82 transition count 1364
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 76 transition count 1298
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 76 transition count 1298
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 72 transition count 1294
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 49 place count 72 transition count 1282
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 61 place count 60 transition count 1282
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 60 transition count 1283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 59 transition count 1283
Applied a total of 63 rules in 344 ms. Remains 59 /90 variables (removed 31) and now considering 1283/1374 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 345 ms. Remains : 59/90 places, 1283/1374 transitions.
Incomplete random walk after 10000 steps, including 123 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Finished Best-First random walk after 2445 steps, including 1 resets, run visited all 3 properties in 5 ms. (steps per millisecond=489 )
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F p2), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 7 factoid took 591 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 239 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 90 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 1374/1374 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
[2023-03-12 17:43:10] [INFO ] Invariant cache hit.
[2023-03-12 17:43:10] [INFO ] Implicit Places using invariants in 541 ms returned []
[2023-03-12 17:43:10] [INFO ] Invariant cache hit.
[2023-03-12 17:43:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:43:11] [INFO ] Implicit Places using invariants and state equation in 828 ms returned []
Implicit Place search using SMT with State Equation took 1371 ms to find 0 implicit places.
[2023-03-12 17:43:11] [INFO ] Invariant cache hit.
[2023-03-12 17:43:12] [INFO ] Dead Transitions using invariants and state equation in 533 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1910 ms. Remains : 90/90 places, 1374/1374 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 246 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 356 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 427549 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 427549 steps, saw 68758 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 17:43:16] [INFO ] Invariant cache hit.
[2023-03-12 17:43:16] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-12 17:43:16] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 17:43:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 17:43:16] [INFO ] After 431ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 17:43:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:43:16] [INFO ] After 99ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 17:43:17] [INFO ] Deduced a trap composed of 7 places in 664 ms of which 1 ms to minimize.
[2023-03-12 17:43:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 741 ms
[2023-03-12 17:43:17] [INFO ] After 1078ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-12 17:43:17] [INFO ] After 1674ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 1374/1374 transitions.
Graph (complete) has 1150 edges and 90 vertex of which 89 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 removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 89 transition count 1371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 89 transition count 1370
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 88 transition count 1370
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 17 place count 82 transition count 1364
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 76 transition count 1298
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 76 transition count 1298
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 72 transition count 1294
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 49 place count 72 transition count 1282
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 61 place count 60 transition count 1282
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 60 transition count 1283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 59 transition count 1283
Applied a total of 63 rules in 235 ms. Remains 59 /90 variables (removed 31) and now considering 1283/1374 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 235 ms. Remains : 59/90 places, 1283/1374 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 3) seen :2
Finished Best-First random walk after 1826 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=456 )
Knowledge obtained : [(AND (NOT p2) p0), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F p2), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 6 factoid took 407 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 196 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 3167 reset in 719 ms.
Product exploration explored 100000 steps with 1280 reset in 361 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 1374/1374 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 90 transition count 1374
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 12 place count 84 transition count 1308
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 84 transition count 1308
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 18 rules in 94 ms. Remains 84 /90 variables (removed 6) and now considering 1308/1374 (removed 66) transitions.
[2023-03-12 17:43:20] [INFO ] Redundant transitions in 47 ms returned [1083]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1307 rows 84 cols
[2023-03-12 17:43:20] [INFO ] Computed 12 place invariants in 15 ms
[2023-03-12 17:43:21] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/90 places, 1307/1374 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 84 transition count 1309
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 1 rules in 75 ms. Remains 84 /84 variables (removed 0) and now considering 1309/1307 (removed -2) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/90 places, 1309/1374 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 853 ms. Remains : 84/90 places, 1309/1374 transitions.
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 1374/1374 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
// Phase 1: matrix 1374 rows 90 cols
[2023-03-12 17:43:21] [INFO ] Computed 12 place invariants in 14 ms
[2023-03-12 17:43:22] [INFO ] Implicit Places using invariants in 820 ms returned []
[2023-03-12 17:43:22] [INFO ] Invariant cache hit.
[2023-03-12 17:43:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:43:23] [INFO ] Implicit Places using invariants and state equation in 1479 ms returned []
Implicit Place search using SMT with State Equation took 2322 ms to find 0 implicit places.
[2023-03-12 17:43:23] [INFO ] Invariant cache hit.
[2023-03-12 17:43:24] [INFO ] Dead Transitions using invariants and state equation in 655 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2996 ms. Remains : 90/90 places, 1374/1374 transitions.
Treatment of property AutonomousCar-PT-10b-LTLFireability-01 finished in 26322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
[2023-03-12 17:43:24] [INFO ] Flatten gal took : 195 ms
[2023-03-12 17:43:24] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-12 17:43:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 349 places, 1776 transitions and 26464 arcs took 18 ms.
Total runtime 180393 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1953/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1953/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1953/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutonomousCar-PT-10b-LTLFireability-01
Could not compute solution for formula : AutonomousCar-PT-10b-LTLFireability-06
Could not compute solution for formula : AutonomousCar-PT-10b-LTLFireability-07

BK_STOP 1678643007748

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name AutonomousCar-PT-10b-LTLFireability-01
ltl formula formula --ltl=/tmp/1953/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 349 places, 1776 transitions and 26464 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.370 real 0.140 user 0.120 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1953/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1953/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1953/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1953/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name AutonomousCar-PT-10b-LTLFireability-06
ltl formula formula --ltl=/tmp/1953/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 349 places, 1776 transitions and 26464 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.320 real 0.120 user 0.140 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1953/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1953/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1953/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1953/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name AutonomousCar-PT-10b-LTLFireability-07
ltl formula formula --ltl=/tmp/1953/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 349 places, 1776 transitions and 26464 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.310 real 0.120 user 0.140 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1953/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1953/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1953/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1953/ltl_2_
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula

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-10b"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is AutonomousCar-PT-10b, 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 r009-oct2-167813598200684"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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