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.r007-oct2-167813595800660.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 lolaxred
Input is AutonomousCar-PT-09a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595800660
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 12:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 7.7K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K 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 781K 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-09a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678353041245

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 09:10:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 09:10:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 09:10:44] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2023-03-09 09:10:44] [INFO ] Transformed 89 places.
[2023-03-09 09:10:44] [INFO ] Transformed 1249 transitions.
[2023-03-09 09:10:44] [INFO ] Found NUPN structural information;
[2023-03-09 09:10:44] [INFO ] Parsed PT model containing 89 places and 1249 transitions and 15631 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 345 transitions
Reduce redundant transitions removed 345 transitions.
FORMULA AutonomousCar-PT-09a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 904/904 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 85 transition count 873
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 85 transition count 873
Applied a total of 8 rules in 33 ms. Remains 85 /89 variables (removed 4) and now considering 873/904 (removed 31) transitions.
// Phase 1: matrix 873 rows 85 cols
[2023-03-09 09:10:44] [INFO ] Computed 13 place invariants in 25 ms
[2023-03-09 09:10:44] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-03-09 09:10:44] [INFO ] Invariant cache hit.
[2023-03-09 09:10:45] [INFO ] State equation strengthened by 300 read => feed constraints.
[2023-03-09 09:10:45] [INFO ] Implicit Places using invariants and state equation in 450 ms returned [81, 83]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 727 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/89 places, 873/904 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 873/873 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 764 ms. Remains : 83/89 places, 873/904 transitions.
Support contains 48 out of 83 places after structural reductions.
[2023-03-09 09:10:45] [INFO ] Flatten gal took : 213 ms
[2023-03-09 09:10:45] [INFO ] Flatten gal took : 147 ms
[2023-03-09 09:10:46] [INFO ] Input system was already deterministic with 873 transitions.
Incomplete random walk after 10000 steps, including 490 resets, run finished after 620 ms. (steps per millisecond=16 ) properties (out of 34) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 873 rows 83 cols
[2023-03-09 09:10:46] [INFO ] Computed 11 place invariants in 7 ms
[2023-03-09 09:10:47] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-09 09:10:47] [INFO ] After 696ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-09 09:10:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-09 09:10:50] [INFO ] After 2174ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :17
[2023-03-09 09:10:50] [INFO ] State equation strengthened by 300 read => feed constraints.
[2023-03-09 09:10:52] [INFO ] After 1871ms SMT Verify possible using 300 Read/Feed constraints in natural domain returned unsat :2 sat :17
[2023-03-09 09:10:54] [INFO ] After 4561ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :17
Attempting to minimize the solution found.
Minimization took 1964 ms.
[2023-03-09 09:10:56] [INFO ] After 8953ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :17
Fused 19 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 415 ms.
Support contains 34 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 873/873 transitions.
Graph (complete) has 1001 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 82 transition count 865
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 78 transition count 863
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 76 transition count 863
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 16 place count 76 transition count 860
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 22 place count 73 transition count 860
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 26 place count 69 transition count 829
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 69 transition count 829
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 3 with 2 rules applied. Total rules applied 32 place count 68 transition count 828
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 39 place count 68 transition count 821
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 3 with 43 rules applied. Total rules applied 82 place count 61 transition count 785
Applied a total of 82 rules in 238 ms. Remains 61 /83 variables (removed 22) and now considering 785/873 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 238 ms. Remains : 61/83 places, 785/873 transitions.
Incomplete random walk after 10000 steps, including 111 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :2
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :1
Running SMT prover for 14 properties.
// Phase 1: matrix 785 rows 61 cols
[2023-03-09 09:10:57] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-09 09:10:58] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-09 09:10:58] [INFO ] After 577ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-09 09:10:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-09 09:11:00] [INFO ] After 1765ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-09 09:11:00] [INFO ] State equation strengthened by 235 read => feed constraints.
[2023-03-09 09:11:02] [INFO ] After 1527ms SMT Verify possible using 235 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-09 09:11:04] [INFO ] After 3496ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1622 ms.
[2023-03-09 09:11:05] [INFO ] After 7121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 1 properties in 534 ms.
Support contains 34 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 785/785 transitions.
Applied a total of 0 rules in 35 ms. Remains 61 /61 variables (removed 0) and now considering 785/785 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 61/61 places, 785/785 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 462 ms. (steps per millisecond=21 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-09 09:11:07] [INFO ] Invariant cache hit.
[2023-03-09 09:11:07] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 09:11:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 09:11:08] [INFO ] After 800ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 09:11:08] [INFO ] State equation strengthened by 235 read => feed constraints.
[2023-03-09 09:11:08] [INFO ] After 514ms SMT Verify possible using 235 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 09:11:09] [INFO ] After 1201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 536 ms.
[2023-03-09 09:11:09] [INFO ] After 2655ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 266 ms.
Support contains 20 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 785/785 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 60 transition count 775
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 775
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 60 transition count 773
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 24 place count 58 transition count 755
Applied a total of 24 rules in 69 ms. Remains 58 /61 variables (removed 3) and now considering 755/785 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 58/61 places, 755/785 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 478144 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :{}
Probabilistic random walk after 478144 steps, saw 72584 distinct states, run finished after 3004 ms. (steps per millisecond=159 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 755 rows 58 cols
[2023-03-09 09:11:13] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-09 09:11:13] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 09:11:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-09 09:11:14] [INFO ] After 742ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 09:11:14] [INFO ] State equation strengthened by 208 read => feed constraints.
[2023-03-09 09:11:15] [INFO ] After 498ms SMT Verify possible using 208 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 09:11:15] [INFO ] After 1166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 634 ms.
[2023-03-09 09:11:16] [INFO ] After 2635ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 292 ms.
Support contains 20 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 755/755 transitions.
Applied a total of 0 rules in 31 ms. Remains 58 /58 variables (removed 0) and now considering 755/755 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 58/58 places, 755/755 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 755/755 transitions.
Applied a total of 0 rules in 28 ms. Remains 58 /58 variables (removed 0) and now considering 755/755 (removed 0) transitions.
[2023-03-09 09:11:16] [INFO ] Invariant cache hit.
[2023-03-09 09:11:17] [INFO ] Implicit Places using invariants in 194 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 199 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 57/58 places, 755/755 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 56 transition count 754
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 56 transition count 754
Applied a total of 2 rules in 65 ms. Remains 56 /57 variables (removed 1) and now considering 754/755 (removed 1) transitions.
// Phase 1: matrix 754 rows 56 cols
[2023-03-09 09:11:17] [INFO ] Computed 12 place invariants in 15 ms
[2023-03-09 09:11:17] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-09 09:11:17] [INFO ] Invariant cache hit.
[2023-03-09 09:11:17] [INFO ] State equation strengthened by 208 read => feed constraints.
[2023-03-09 09:11:18] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 56/58 places, 754/755 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1150 ms. Remains : 56/58 places, 754/755 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 533150 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :{}
Probabilistic random walk after 533150 steps, saw 80942 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-09 09:11:21] [INFO ] Invariant cache hit.
[2023-03-09 09:11:21] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 09:11:22] [INFO ] [Nat]Absence check using 12 positive place invariants in 79 ms returned sat
[2023-03-09 09:11:22] [INFO ] After 628ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 09:11:22] [INFO ] State equation strengthened by 208 read => feed constraints.
[2023-03-09 09:11:23] [INFO ] After 705ms SMT Verify possible using 208 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 09:11:24] [INFO ] After 1494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 739 ms.
[2023-03-09 09:11:25] [INFO ] After 3327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 302 ms.
Support contains 20 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 754/754 transitions.
Applied a total of 0 rules in 37 ms. Remains 56 /56 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 56/56 places, 754/754 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 754/754 transitions.
Applied a total of 0 rules in 34 ms. Remains 56 /56 variables (removed 0) and now considering 754/754 (removed 0) transitions.
[2023-03-09 09:11:25] [INFO ] Invariant cache hit.
[2023-03-09 09:11:25] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-09 09:11:25] [INFO ] Invariant cache hit.
[2023-03-09 09:11:25] [INFO ] State equation strengthened by 208 read => feed constraints.
[2023-03-09 09:11:26] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
[2023-03-09 09:11:26] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-09 09:11:26] [INFO ] Invariant cache hit.
[2023-03-09 09:11:26] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1266 ms. Remains : 56/56 places, 754/754 transitions.
Applied a total of 0 rules in 31 ms. Remains 56 /56 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-03-09 09:11:26] [INFO ] Invariant cache hit.
[2023-03-09 09:11:26] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 09:11:26] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-09 09:11:27] [INFO ] After 671ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 09:11:28] [INFO ] After 1372ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 717 ms.
[2023-03-09 09:11:28] [INFO ] After 2145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA AutonomousCar-PT-09a-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA AutonomousCar-PT-09a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 2 stable transitions
FORMULA AutonomousCar-PT-09a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 873/873 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 78 transition count 823
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 78 transition count 823
Applied a total of 10 rules in 20 ms. Remains 78 /83 variables (removed 5) and now considering 823/873 (removed 50) transitions.
// Phase 1: matrix 823 rows 78 cols
[2023-03-09 09:11:29] [INFO ] Computed 11 place invariants in 10 ms
[2023-03-09 09:11:30] [INFO ] Implicit Places using invariants in 533 ms returned []
[2023-03-09 09:11:30] [INFO ] Invariant cache hit.
[2023-03-09 09:11:30] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-09 09:11:31] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1470 ms to find 0 implicit places.
[2023-03-09 09:11:31] [INFO ] Invariant cache hit.
[2023-03-09 09:11:31] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 78/83 places, 823/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1866 ms. Remains : 78/83 places, 823/873 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s10 1) (EQ s47 1) (EQ s73 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]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 6 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-00 finished in 2222 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' '!(((p0 U !p1)&&X((p2||X(X(F(p1)))))))'
Support contains 19 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 873/873 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 78 transition count 823
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 78 transition count 823
Applied a total of 10 rules in 11 ms. Remains 78 /83 variables (removed 5) and now considering 823/873 (removed 50) transitions.
// Phase 1: matrix 823 rows 78 cols
[2023-03-09 09:11:31] [INFO ] Computed 11 place invariants in 7 ms
[2023-03-09 09:11:31] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-09 09:11:31] [INFO ] Invariant cache hit.
[2023-03-09 09:11:32] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-09 09:11:32] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
[2023-03-09 09:11:32] [INFO ] Invariant cache hit.
[2023-03-09 09:11:32] [INFO ] Dead Transitions using invariants and state equation in 344 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 78/83 places, 823/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1039 ms. Remains : 78/83 places, 823/873 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p2) p1), true, p1, (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s18 1) (EQ s22 1) (EQ s30 1) (EQ s36 1) (EQ s40 1) (EQ s46 1) (EQ s55 1) (EQ s59 1) (EQ s67 1) (EQ s74 1)), p0:(AND (EQ s16 1) (EQ s24 1) (EQ ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-01 finished in 1362 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((X((G(p1)||X(G(p2))))||p0))))'
Support contains 6 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 873/873 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 78 transition count 823
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 78 transition count 823
Applied a total of 10 rules in 10 ms. Remains 78 /83 variables (removed 5) and now considering 823/873 (removed 50) transitions.
// Phase 1: matrix 823 rows 78 cols
[2023-03-09 09:11:33] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-09 09:11:33] [INFO ] Implicit Places using invariants in 466 ms returned []
[2023-03-09 09:11:33] [INFO ] Invariant cache hit.
[2023-03-09 09:11:33] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-09 09:11:34] [INFO ] Implicit Places using invariants and state equation in 752 ms returned []
Implicit Place search using SMT with State Equation took 1219 ms to find 0 implicit places.
[2023-03-09 09:11:34] [INFO ] Invariant cache hit.
[2023-03-09 09:11:34] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 78/83 places, 823/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1502 ms. Remains : 78/83 places, 823/873 transitions.
Stuttering acceptance computed with spot in 323 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(OR (EQ s1 0) (EQ s6 0) (EQ s23 0) (EQ s73 0)), p0:(OR (EQ s1 0) (EQ s6 0) (EQ s23 0) (EQ s73 0)), p2:(OR (EQ s1 0) (EQ s12 0) (EQ s21 0) (EQ s73 0))], 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, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 311 reset in 232 ms.
Product exploration explored 100000 steps with 78 reset in 105 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 283 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 363 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 489 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-09 09:11:36] [INFO ] Invariant cache hit.
[2023-03-09 09:11:36] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 09:11:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-09 09:11:37] [INFO ] After 458ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-09 09:11:37] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-09 09:11:37] [INFO ] After 395ms SMT Verify possible using 255 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-09 09:11:37] [INFO ] After 747ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 348 ms.
[2023-03-09 09:11:38] [INFO ] After 1629ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 156 ms.
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 823/823 transitions.
Graph (complete) has 946 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 77 transition count 808
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 26 place count 66 transition count 808
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 66 transition count 807
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 65 transition count 807
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 64 transition count 806
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 64 transition count 806
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 61 transition count 803
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 45 place count 61 transition count 794
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 135 place count 52 transition count 713
Applied a total of 135 rules in 106 ms. Remains 52 /78 variables (removed 26) and now considering 713/823 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 52/78 places, 713/823 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 751613 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :{}
Probabilistic random walk after 751613 steps, saw 91889 distinct states, run finished after 3001 ms. (steps per millisecond=250 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 713 rows 52 cols
[2023-03-09 09:11:41] [INFO ] Computed 13 place invariants in 4 ms
[2023-03-09 09:11:41] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 09:11:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-09 09:11:42] [INFO ] After 433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 09:11:42] [INFO ] State equation strengthened by 172 read => feed constraints.
[2023-03-09 09:11:42] [INFO ] After 301ms SMT Verify possible using 172 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 09:11:42] [INFO ] After 625ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 274 ms.
[2023-03-09 09:11:43] [INFO ] After 1372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 46 ms.
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 713/713 transitions.
Applied a total of 0 rules in 41 ms. Remains 52 /52 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 52/52 places, 713/713 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 713/713 transitions.
Applied a total of 0 rules in 35 ms. Remains 52 /52 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2023-03-09 09:11:43] [INFO ] Invariant cache hit.
[2023-03-09 09:11:43] [INFO ] Implicit Places using invariants in 472 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 475 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 51/52 places, 713/713 transitions.
Applied a total of 0 rules in 62 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 572 ms. Remains : 51/52 places, 713/713 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 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 42 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 659205 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :{}
Probabilistic random walk after 659205 steps, saw 80647 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 713 rows 51 cols
[2023-03-09 09:11:47] [INFO ] Computed 12 place invariants in 9 ms
[2023-03-09 09:11:47] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 09:11:47] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-09 09:11:47] [INFO ] After 383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 09:11:47] [INFO ] State equation strengthened by 172 read => feed constraints.
[2023-03-09 09:11:47] [INFO ] After 230ms SMT Verify possible using 172 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 09:11:48] [INFO ] After 609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 336 ms.
[2023-03-09 09:11:48] [INFO ] After 1372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 26 ms.
Support contains 6 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 35 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 51/51 places, 713/713 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 30 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2023-03-09 09:11:48] [INFO ] Invariant cache hit.
[2023-03-09 09:11:49] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-09 09:11:49] [INFO ] Invariant cache hit.
[2023-03-09 09:11:49] [INFO ] State equation strengthened by 172 read => feed constraints.
[2023-03-09 09:11:49] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
[2023-03-09 09:11:49] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-09 09:11:49] [INFO ] Invariant cache hit.
[2023-03-09 09:11:50] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1566 ms. Remains : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 33 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-09 09:11:50] [INFO ] Invariant cache hit.
[2023-03-09 09:11:50] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 09:11:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-09 09:11:50] [INFO ] After 350ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 09:11:51] [INFO ] After 633ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 233 ms.
[2023-03-09 09:11:51] [INFO ] After 911ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p1)), (X (X p0)), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT (AND p2 p1))), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 261 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 385 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 485 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 823/823 transitions.
Applied a total of 0 rules in 7 ms. Remains 78 /78 variables (removed 0) and now considering 823/823 (removed 0) transitions.
// Phase 1: matrix 823 rows 78 cols
[2023-03-09 09:11:52] [INFO ] Computed 11 place invariants in 9 ms
[2023-03-09 09:11:53] [INFO ] Implicit Places using invariants in 525 ms returned []
[2023-03-09 09:11:53] [INFO ] Invariant cache hit.
[2023-03-09 09:11:53] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-09 09:11:53] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 1152 ms to find 0 implicit places.
[2023-03-09 09:11:53] [INFO ] Invariant cache hit.
[2023-03-09 09:11:54] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1687 ms. Remains : 78/78 places, 823/823 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 311 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 386 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 481 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 09:11:55] [INFO ] Invariant cache hit.
[2023-03-09 09:11:55] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 09:11:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-09 09:11:55] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 09:11:55] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-09 09:11:56] [INFO ] After 259ms SMT Verify possible using 255 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 09:11:56] [INFO ] After 547ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 200 ms.
[2023-03-09 09:11:56] [INFO ] After 1201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 84 ms.
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 823/823 transitions.
Graph (complete) has 946 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 77 transition count 808
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 26 place count 66 transition count 808
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 66 transition count 807
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 65 transition count 807
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 64 transition count 806
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 64 transition count 806
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 2 with 6 rules applied. Total rules applied 36 place count 61 transition count 803
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 45 place count 61 transition count 794
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 135 place count 52 transition count 713
Applied a total of 135 rules in 94 ms. Remains 52 /78 variables (removed 26) and now considering 713/823 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 52/78 places, 713/823 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 856100 steps, run timeout after 3001 ms. (steps per millisecond=285 ) properties seen :{}
Probabilistic random walk after 856100 steps, saw 104285 distinct states, run finished after 3001 ms. (steps per millisecond=285 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 713 rows 52 cols
[2023-03-09 09:11:59] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 09:12:00] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 09:12:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 1 ms returned sat
[2023-03-09 09:12:00] [INFO ] After 295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 09:12:00] [INFO ] State equation strengthened by 172 read => feed constraints.
[2023-03-09 09:12:00] [INFO ] After 149ms SMT Verify possible using 172 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 09:12:00] [INFO ] After 419ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 169 ms.
[2023-03-09 09:12:00] [INFO ] After 916ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 50 ms.
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 713/713 transitions.
Applied a total of 0 rules in 49 ms. Remains 52 /52 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 52/52 places, 713/713 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 713/713 transitions.
Applied a total of 0 rules in 34 ms. Remains 52 /52 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2023-03-09 09:12:01] [INFO ] Invariant cache hit.
[2023-03-09 09:12:01] [INFO ] Implicit Places using invariants in 511 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 528 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 51/52 places, 713/713 transitions.
Applied a total of 0 rules in 55 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 630 ms. Remains : 51/52 places, 713/713 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 894083 steps, run timeout after 3001 ms. (steps per millisecond=297 ) properties seen :{}
Probabilistic random walk after 894083 steps, saw 108899 distinct states, run finished after 3001 ms. (steps per millisecond=297 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 713 rows 51 cols
[2023-03-09 09:12:04] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-09 09:12:04] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 09:12:04] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-09 09:12:05] [INFO ] After 323ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 09:12:05] [INFO ] State equation strengthened by 172 read => feed constraints.
[2023-03-09 09:12:05] [INFO ] After 255ms SMT Verify possible using 172 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 09:12:05] [INFO ] After 544ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 180 ms.
[2023-03-09 09:12:06] [INFO ] After 1093ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 18 ms.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 28 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 51/51 places, 713/713 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 26 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2023-03-09 09:12:06] [INFO ] Invariant cache hit.
[2023-03-09 09:12:06] [INFO ] Implicit Places using invariants in 480 ms returned []
[2023-03-09 09:12:06] [INFO ] Invariant cache hit.
[2023-03-09 09:12:06] [INFO ] State equation strengthened by 172 read => feed constraints.
[2023-03-09 09:12:07] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1406 ms to find 0 implicit places.
[2023-03-09 09:12:07] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-09 09:12:07] [INFO ] Invariant cache hit.
[2023-03-09 09:12:07] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1888 ms. Remains : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 31 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-09 09:12:08] [INFO ] Invariant cache hit.
[2023-03-09 09:12:08] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 09:12:08] [INFO ] [Nat]Absence check using 12 positive place invariants in 38 ms returned sat
[2023-03-09 09:12:08] [INFO ] After 285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 09:12:08] [INFO ] After 494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 195 ms.
[2023-03-09 09:12:08] [INFO ] After 787ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p2 p1))), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 365 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 429 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 394 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 446 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 262 reset in 148 ms.
Product exploration explored 100000 steps with 172 reset in 166 ms.
Applying partial POR strategy [true, false, true, true, false, false, false]
Stuttering acceptance computed with spot in 463 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 823/823 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 78 transition count 823
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 11 place count 78 transition count 825
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 78 transition count 825
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 78 transition count 825
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 77 transition count 824
Deduced a syphon composed of 13 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 77 transition count 824
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 77 transition count 827
Deduced a syphon composed of 14 places in 0 ms
Applied a total of 17 rules in 233 ms. Remains 77 /78 variables (removed 1) and now considering 827/823 (removed -4) transitions.
[2023-03-09 09:12:11] [INFO ] Redundant transitions in 67 ms returned []
// Phase 1: matrix 827 rows 77 cols
[2023-03-09 09:12:11] [INFO ] Computed 11 place invariants in 8 ms
[2023-03-09 09:12:12] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/78 places, 827/823 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 656 ms. Remains : 77/78 places, 827/823 transitions.
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 823/823 transitions.
Applied a total of 0 rules in 10 ms. Remains 78 /78 variables (removed 0) and now considering 823/823 (removed 0) transitions.
// Phase 1: matrix 823 rows 78 cols
[2023-03-09 09:12:12] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-09 09:12:12] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-09 09:12:12] [INFO ] Invariant cache hit.
[2023-03-09 09:12:12] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-09 09:12:13] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 1252 ms to find 0 implicit places.
[2023-03-09 09:12:13] [INFO ] Invariant cache hit.
[2023-03-09 09:12:13] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1629 ms. Remains : 78/78 places, 823/823 transitions.
Treatment of property AutonomousCar-PT-09a-LTLFireability-02 finished in 41030 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 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 873/873 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 78 transition count 823
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 78 transition count 823
Applied a total of 10 rules in 7 ms. Remains 78 /83 variables (removed 5) and now considering 823/873 (removed 50) transitions.
// Phase 1: matrix 823 rows 78 cols
[2023-03-09 09:12:14] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-09 09:12:14] [INFO ] Implicit Places using invariants in 570 ms returned []
[2023-03-09 09:12:14] [INFO ] Invariant cache hit.
[2023-03-09 09:12:14] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-09 09:12:16] [INFO ] Implicit Places using invariants and state equation in 1951 ms returned []
Implicit Place search using SMT with State Equation took 2539 ms to find 0 implicit places.
[2023-03-09 09:12:16] [INFO ] Invariant cache hit.
[2023-03-09 09:12:17] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 78/83 places, 823/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2977 ms. Remains : 78/83 places, 823/873 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-03 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:(OR (NEQ s1 1) (NEQ s7 1) (NEQ s65 1) (NEQ s73 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]]
Product exploration explored 100000 steps with 269 reset in 166 ms.
Product exploration explored 100000 steps with 795 reset in 186 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 218 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 480 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 83176 steps, run visited all 1 properties in 250 ms. (steps per millisecond=332 )
Probabilistic random walk after 83176 steps, saw 13579 distinct states, run finished after 250 ms. (steps per millisecond=332 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 235 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 823/823 transitions.
Applied a total of 0 rules in 8 ms. Remains 78 /78 variables (removed 0) and now considering 823/823 (removed 0) transitions.
[2023-03-09 09:12:18] [INFO ] Invariant cache hit.
[2023-03-09 09:12:19] [INFO ] Implicit Places using invariants in 466 ms returned []
[2023-03-09 09:12:19] [INFO ] Invariant cache hit.
[2023-03-09 09:12:19] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-09 09:12:20] [INFO ] Implicit Places using invariants and state equation in 1154 ms returned []
Implicit Place search using SMT with State Equation took 1629 ms to find 0 implicit places.
[2023-03-09 09:12:20] [INFO ] Invariant cache hit.
[2023-03-09 09:12:20] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2027 ms. Remains : 78/78 places, 823/823 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 206 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 477 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 83176 steps, run visited all 1 properties in 268 ms. (steps per millisecond=310 )
Probabilistic random walk after 83176 steps, saw 13579 distinct states, run finished after 268 ms. (steps per millisecond=310 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 209 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1508 reset in 332 ms.
Product exploration explored 100000 steps with 985 reset in 217 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 823/823 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 78 transition count 823
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 11 place count 78 transition count 825
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 78 transition count 825
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 78 transition count 825
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 77 transition count 824
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 77 transition count 824
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 77 transition count 827
Deduced a syphon composed of 14 places in 0 ms
Applied a total of 17 rules in 92 ms. Remains 77 /78 variables (removed 1) and now considering 827/823 (removed -4) transitions.
[2023-03-09 09:12:23] [INFO ] Redundant transitions in 60 ms returned []
// Phase 1: matrix 827 rows 77 cols
[2023-03-09 09:12:23] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-09 09:12:23] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/78 places, 827/823 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 546 ms. Remains : 77/78 places, 827/823 transitions.
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 823/823 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 823/823 (removed 0) transitions.
// Phase 1: matrix 823 rows 78 cols
[2023-03-09 09:12:23] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-09 09:12:23] [INFO ] Implicit Places using invariants in 329 ms returned []
[2023-03-09 09:12:23] [INFO ] Invariant cache hit.
[2023-03-09 09:12:24] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-09 09:12:24] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 982 ms to find 0 implicit places.
[2023-03-09 09:12:24] [INFO ] Invariant cache hit.
[2023-03-09 09:12:25] [INFO ] Dead Transitions using invariants and state equation in 591 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1578 ms. Remains : 78/78 places, 823/823 transitions.
Treatment of property AutonomousCar-PT-09a-LTLFireability-03 finished in 11194 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||G(p1)))))'
Support contains 6 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 873/873 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 78 transition count 823
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 78 transition count 823
Applied a total of 10 rules in 12 ms. Remains 78 /83 variables (removed 5) and now considering 823/873 (removed 50) transitions.
// Phase 1: matrix 823 rows 78 cols
[2023-03-09 09:12:25] [INFO ] Computed 11 place invariants in 8 ms
[2023-03-09 09:12:25] [INFO ] Implicit Places using invariants in 366 ms returned []
[2023-03-09 09:12:25] [INFO ] Invariant cache hit.
[2023-03-09 09:12:25] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-09 09:12:26] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 1159 ms to find 0 implicit places.
[2023-03-09 09:12:26] [INFO ] Invariant cache hit.
[2023-03-09 09:12:26] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 78/83 places, 823/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1545 ms. Remains : 78/83 places, 823/873 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (NEQ s1 1) (NEQ s6 1) (NEQ s43 1) (NEQ s73 1)), p0:(AND (EQ s1 1) (EQ s11 1) (EQ s53 1) (EQ s73 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 110 reset in 104 ms.
Product exploration explored 100000 steps with 672 reset in 172 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 484 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 489 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 30 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 998896 steps, run timeout after 3021 ms. (steps per millisecond=330 ) properties seen :{}
Probabilistic random walk after 998896 steps, saw 130101 distinct states, run finished after 3021 ms. (steps per millisecond=330 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 09:12:31] [INFO ] Invariant cache hit.
[2023-03-09 09:12:31] [INFO ] [Real]Absence check using 11 positive place invariants in 42 ms returned sat
[2023-03-09 09:12:31] [INFO ] After 361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:12:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-09 09:12:31] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:12:31] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-09 09:12:31] [INFO ] After 97ms SMT Verify possible using 255 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:12:32] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 136 ms.
[2023-03-09 09:12:32] [INFO ] After 642ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 37 ms.
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 823/823 transitions.
Graph (complete) has 946 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 77 transition count 809
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 24 place count 67 transition count 809
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24 place count 67 transition count 808
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 66 transition count 808
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 64 transition count 797
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 64 transition count 797
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 2 with 6 rules applied. Total rules applied 36 place count 61 transition count 794
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 45 place count 61 transition count 785
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 81 rules applied. Total rules applied 126 place count 52 transition count 713
Applied a total of 126 rules in 180 ms. Remains 52 /78 variables (removed 26) and now considering 713/823 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 52/78 places, 713/823 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1115153 steps, run visited all 1 properties in 2855 ms. (steps per millisecond=390 )
Probabilistic random walk after 1115153 steps, saw 138148 distinct states, run finished after 2855 ms. (steps per millisecond=390 ) properties seen :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 9 factoid took 496 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p1), (NOT p1)]
Support contains 4 out of 78 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 823/823 transitions.
Applied a total of 0 rules in 8 ms. Remains 78 /78 variables (removed 0) and now considering 823/823 (removed 0) transitions.
[2023-03-09 09:12:36] [INFO ] Invariant cache hit.
[2023-03-09 09:12:36] [INFO ] Implicit Places using invariants in 528 ms returned []
[2023-03-09 09:12:36] [INFO ] Invariant cache hit.
[2023-03-09 09:12:37] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-09 09:12:37] [INFO ] Implicit Places using invariants and state equation in 721 ms returned []
Implicit Place search using SMT with State Equation took 1251 ms to find 0 implicit places.
[2023-03-09 09:12:37] [INFO ] Invariant cache hit.
[2023-03-09 09:12:37] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1611 ms. Remains : 78/78 places, 823/823 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 492 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1050289 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :{}
Probabilistic random walk after 1050289 steps, saw 136679 distinct states, run finished after 3002 ms. (steps per millisecond=349 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 09:12:41] [INFO ] Invariant cache hit.
[2023-03-09 09:12:41] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-09 09:12:41] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:12:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-09 09:12:41] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:12:41] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-09 09:12:41] [INFO ] After 92ms SMT Verify possible using 255 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:12:42] [INFO ] After 294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-09 09:12:42] [INFO ] After 659ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 823/823 transitions.
Graph (complete) has 946 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 77 transition count 809
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 24 place count 67 transition count 809
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24 place count 67 transition count 808
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 66 transition count 808
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 64 transition count 797
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 64 transition count 797
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 2 with 6 rules applied. Total rules applied 36 place count 61 transition count 794
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 45 place count 61 transition count 785
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 81 rules applied. Total rules applied 126 place count 52 transition count 713
Applied a total of 126 rules in 116 ms. Remains 52 /78 variables (removed 26) and now considering 713/823 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 52/78 places, 713/823 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1115153 steps, run visited all 1 properties in 2870 ms. (steps per millisecond=388 )
Probabilistic random walk after 1115153 steps, saw 138148 distinct states, run finished after 2870 ms. (steps per millisecond=388 ) properties seen :1
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 297 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 232 reset in 140 ms.
Product exploration explored 100000 steps with 1315 reset in 280 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p1), (NOT p1)]
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 823/823 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 78 transition count 823
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 10 place count 78 transition count 825
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 78 transition count 825
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 77 transition count 815
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 77 transition count 815
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 77 transition count 815
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 76 transition count 814
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 76 transition count 814
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 76 transition count 817
Deduced a syphon composed of 13 places in 0 ms
Applied a total of 18 rules in 109 ms. Remains 76 /78 variables (removed 2) and now considering 817/823 (removed 6) transitions.
[2023-03-09 09:12:46] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 817 rows 76 cols
[2023-03-09 09:12:46] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-09 09:12:46] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/78 places, 817/823 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 436 ms. Remains : 76/78 places, 817/823 transitions.
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 823/823 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 77 transition count 813
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 77 transition count 813
Applied a total of 2 rules in 5 ms. Remains 77 /78 variables (removed 1) and now considering 813/823 (removed 10) transitions.
// Phase 1: matrix 813 rows 77 cols
[2023-03-09 09:12:46] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-09 09:12:47] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-09 09:12:47] [INFO ] Invariant cache hit.
[2023-03-09 09:12:47] [INFO ] State equation strengthened by 246 read => feed constraints.
[2023-03-09 09:12:47] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 1029 ms to find 0 implicit places.
[2023-03-09 09:12:47] [INFO ] Invariant cache hit.
[2023-03-09 09:12:48] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 77/78 places, 813/823 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1459 ms. Remains : 77/78 places, 813/823 transitions.
Treatment of property AutonomousCar-PT-09a-LTLFireability-07 finished in 23169 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((F((X(X(F(p2)))||p1))&&p0)))'
Support contains 19 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 873/873 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 77 transition count 813
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 77 transition count 813
Applied a total of 12 rules in 5 ms. Remains 77 /83 variables (removed 6) and now considering 813/873 (removed 60) transitions.
[2023-03-09 09:12:48] [INFO ] Invariant cache hit.
[2023-03-09 09:12:48] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-09 09:12:48] [INFO ] Invariant cache hit.
[2023-03-09 09:12:48] [INFO ] State equation strengthened by 246 read => feed constraints.
[2023-03-09 09:12:49] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
[2023-03-09 09:12:49] [INFO ] Invariant cache hit.
[2023-03-09 09:12:49] [INFO ] Dead Transitions using invariants and state equation in 326 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 77/83 places, 813/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1005 ms. Remains : 77/83 places, 813/873 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s1 0) (EQ s5 0) (EQ s61 0) (EQ s72 0) (AND (EQ s16 1) (EQ s24 1) (EQ s28 1) (EQ s34 1) (EQ s42 1) (EQ s48 1) (EQ s52 1) (EQ s60 1) (EQ s64 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, null][false, false, false]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-09 finished in 1116 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)&&F(G(p1)))))'
Support contains 14 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 873/873 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 83 transition count 864
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 74 transition count 864
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 74 transition count 862
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 72 transition count 862
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 67 transition count 812
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 67 transition count 812
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 2 with 2 rules applied. Total rules applied 34 place count 66 transition count 811
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 65 transition count 811
Applied a total of 36 rules in 114 ms. Remains 65 /83 variables (removed 18) and now considering 811/873 (removed 62) transitions.
// Phase 1: matrix 811 rows 65 cols
[2023-03-09 09:12:49] [INFO ] Computed 11 place invariants in 10 ms
[2023-03-09 09:12:49] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-09 09:12:49] [INFO ] Invariant cache hit.
[2023-03-09 09:12:50] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-09 09:12:50] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 1080 ms to find 0 implicit places.
[2023-03-09 09:12:50] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-09 09:12:50] [INFO ] Invariant cache hit.
[2023-03-09 09:12:51] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/83 places, 811/873 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1630 ms. Remains : 65/83 places, 811/873 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s1 1) (NEQ s6 1) (NEQ s48 1) (NEQ s61 1)), p1:(OR (NEQ s16 1) (NEQ s21 1) (NEQ s26 1) (NEQ s29 1) (NEQ s34 1) (NEQ s39 1) (NEQ s46 1) (NEQ s52...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2190 reset in 507 ms.
Stuttering criterion allowed to conclude after 29109 steps with 1733 reset in 297 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-10 finished in 2621 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((X(p1)&&(p2 U p3)&&p0))))'
Support contains 8 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 873/873 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 78 transition count 823
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 78 transition count 823
Applied a total of 10 rules in 9 ms. Remains 78 /83 variables (removed 5) and now considering 823/873 (removed 50) transitions.
// Phase 1: matrix 823 rows 78 cols
[2023-03-09 09:12:52] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-09 09:12:52] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-09 09:12:52] [INFO ] Invariant cache hit.
[2023-03-09 09:12:52] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-09 09:12:53] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 1010 ms to find 0 implicit places.
[2023-03-09 09:12:53] [INFO ] Invariant cache hit.
[2023-03-09 09:12:53] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 78/83 places, 823/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1659 ms. Remains : 78/83 places, 823/873 transitions.
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p0) (NOT p3) (NOT p1)), true, (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) p2)), (NOT p3)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p0 p3) (AND p0 p2)), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p3) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 p3) (AND p0 p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p0 p3 (NOT p1)) (AND p0 p2 (NOT p1))), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s8 1) (EQ s57 1) (EQ s73 1)), p3:(AND (EQ s1 1) (EQ s11 1) (EQ s17 1) (EQ s73 1)), p2:(AND (EQ s1 1) (EQ s8 1) (EQ s57 1) (EQ s73 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-11 finished in 2040 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)) U p1))'
Support contains 14 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 873/873 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 83 transition count 864
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 74 transition count 864
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 74 transition count 862
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 72 transition count 862
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 66 transition count 802
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 66 transition count 802
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 2 with 2 rules applied. Total rules applied 36 place count 65 transition count 801
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 64 transition count 801
Applied a total of 38 rules in 136 ms. Remains 64 /83 variables (removed 19) and now considering 801/873 (removed 72) transitions.
// Phase 1: matrix 801 rows 64 cols
[2023-03-09 09:12:54] [INFO ] Computed 11 place invariants in 11 ms
[2023-03-09 09:12:54] [INFO ] Implicit Places using invariants in 294 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 297 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/83 places, 801/873 transitions.
Applied a total of 0 rules in 65 ms. Remains 63 /63 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 498 ms. Remains : 63/83 places, 801/873 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), p0]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s13 1) (EQ s20 1) (EQ s23 1) (EQ s28 1) (EQ s35 1) (EQ s40 1) (EQ s43 1) (EQ s48 1) (EQ s55 1) (EQ s60 1)), p0:(AND (EQ s15 1) (EQ s18 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 46 reset in 144 ms.
Product exploration explored 100000 steps with 1931 reset in 350 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 : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 311 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), p0]
Incomplete random walk after 10000 steps, including 598 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :1
Finished Best-First random walk after 8546 steps, including 39 resets, run visited all 1 properties in 11 ms. (steps per millisecond=776 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 204 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), p0]
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), p0]
// Phase 1: matrix 801 rows 63 cols
[2023-03-09 09:12:56] [INFO ] Computed 10 place invariants in 5 ms
[2023-03-09 09:12:57] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-09 09:12:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:12:57] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2023-03-09 09:12:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:12:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-09 09:12:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:12:57] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2023-03-09 09:12:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:12:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-09 09:12:58] [INFO ] Computed and/alt/rep : 4/7/4 causal constraints (skipped 796 transitions) in 245 ms.
[2023-03-09 09:12:58] [INFO ] Added : 2 causal constraints over 1 iterations in 391 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 14 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 801/801 transitions.
Applied a total of 0 rules in 68 ms. Remains 63 /63 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-09 09:12:58] [INFO ] Invariant cache hit.
[2023-03-09 09:12:58] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-09 09:12:58] [INFO ] Invariant cache hit.
[2023-03-09 09:12:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:12:58] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2023-03-09 09:12:59] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-09 09:12:59] [INFO ] Invariant cache hit.
[2023-03-09 09:12:59] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1105 ms. Remains : 63/63 places, 801/801 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 (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 127 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), p0]
Incomplete random walk after 10000 steps, including 592 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 09:12:59] [INFO ] Invariant cache hit.
[2023-03-09 09:12:59] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-09 09:13:00] [INFO ] After 323ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:13:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-09 09:13:00] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:13:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:13:00] [INFO ] After 85ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:13:00] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-09 09:13:00] [INFO ] After 629ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 10 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 801/801 transitions.
Graph (complete) has 893 edges and 63 vertex of which 62 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 62 transition count 798
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 61 transition count 796
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 61 transition count 796
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 14 place count 61 transition count 787
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 104 place count 52 transition count 706
Applied a total of 104 rules in 91 ms. Remains 52 /63 variables (removed 11) and now considering 706/801 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 52/63 places, 706/801 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Finished Best-First random walk after 384 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=192 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 344 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), p0]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), p0]
[2023-03-09 09:13:01] [INFO ] Invariant cache hit.
[2023-03-09 09:13:02] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-09 09:13:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:13:02] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2023-03-09 09:13:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:13:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-09 09:13:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:13:02] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2023-03-09 09:13:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:13:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-09 09:13:03] [INFO ] Computed and/alt/rep : 4/7/4 causal constraints (skipped 796 transitions) in 196 ms.
[2023-03-09 09:13:03] [INFO ] Added : 2 causal constraints over 1 iterations in 314 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), p0]
Product exploration explored 100000 steps with 514 reset in 178 ms.
Product exploration explored 100000 steps with 239 reset in 91 ms.
Support contains 14 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 801/801 transitions.
Applied a total of 0 rules in 29 ms. Remains 63 /63 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-09 09:13:03] [INFO ] Invariant cache hit.
[2023-03-09 09:13:03] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-09 09:13:03] [INFO ] Invariant cache hit.
[2023-03-09 09:13:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:13:04] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
[2023-03-09 09:13:04] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-09 09:13:04] [INFO ] Invariant cache hit.
[2023-03-09 09:13:05] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1274 ms. Remains : 63/63 places, 801/801 transitions.
Treatment of property AutonomousCar-PT-09a-LTLFireability-12 finished in 10869 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)))'
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 873/873 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 81 transition count 861
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 70 transition count 861
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 23 place count 70 transition count 860
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 69 transition count 860
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 30 place count 64 transition count 810
Iterating global reduction 2 with 5 rules applied. Total rules applied 35 place count 64 transition count 810
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 2 with 4 rules applied. Total rules applied 39 place count 62 transition count 808
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 61 transition count 808
Applied a total of 41 rules in 73 ms. Remains 61 /83 variables (removed 22) and now considering 808/873 (removed 65) transitions.
// Phase 1: matrix 808 rows 61 cols
[2023-03-09 09:13:05] [INFO ] Computed 10 place invariants in 6 ms
[2023-03-09 09:13:05] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-09 09:13:05] [INFO ] Invariant cache hit.
[2023-03-09 09:13:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 09:13:06] [INFO ] Implicit Places using invariants and state equation in 846 ms returned []
Implicit Place search using SMT with State Equation took 1315 ms to find 0 implicit places.
[2023-03-09 09:13:06] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-09 09:13:06] [INFO ] Invariant cache hit.
[2023-03-09 09:13:06] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/83 places, 808/873 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1802 ms. Remains : 61/83 places, 808/873 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s48 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 805 reset in 133 ms.
Product exploration explored 100000 steps with 1340 reset in 163 ms.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Finished random walk after 30 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=30 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 808/808 transitions.
Applied a total of 0 rules in 78 ms. Remains 61 /61 variables (removed 0) and now considering 808/808 (removed 0) transitions.
[2023-03-09 09:13:08] [INFO ] Invariant cache hit.
[2023-03-09 09:13:08] [INFO ] Implicit Places using invariants in 486 ms returned []
[2023-03-09 09:13:08] [INFO ] Invariant cache hit.
[2023-03-09 09:13:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 09:13:09] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 1151 ms to find 0 implicit places.
[2023-03-09 09:13:09] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-09 09:13:09] [INFO ] Invariant cache hit.
[2023-03-09 09:13:09] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1624 ms. Remains : 61/61 places, 808/808 transitions.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 237 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7370 reset in 569 ms.
Product exploration explored 100000 steps with 1110 reset in 159 ms.
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 808/808 transitions.
Applied a total of 0 rules in 55 ms. Remains 61 /61 variables (removed 0) and now considering 808/808 (removed 0) transitions.
[2023-03-09 09:13:11] [INFO ] Invariant cache hit.
[2023-03-09 09:13:11] [INFO ] Implicit Places using invariants in 517 ms returned []
[2023-03-09 09:13:11] [INFO ] Invariant cache hit.
[2023-03-09 09:13:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 09:13:12] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1491 ms to find 0 implicit places.
[2023-03-09 09:13:12] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-09 09:13:12] [INFO ] Invariant cache hit.
[2023-03-09 09:13:13] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1881 ms. Remains : 61/61 places, 808/808 transitions.
Treatment of property AutonomousCar-PT-09a-LTLFireability-13 finished in 8078 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) U G(!((!p1 U p2)||p1))) U p0))'
Support contains 16 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 873/873 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 83 transition count 865
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 75 transition count 865
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 75 transition count 863
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 73 transition count 863
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 68 transition count 813
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 68 transition count 813
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 2 with 2 rules applied. Total rules applied 32 place count 67 transition count 812
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 66 transition count 812
Applied a total of 34 rules in 63 ms. Remains 66 /83 variables (removed 17) and now considering 812/873 (removed 61) transitions.
// Phase 1: matrix 812 rows 66 cols
[2023-03-09 09:13:13] [INFO ] Computed 11 place invariants in 7 ms
[2023-03-09 09:13:13] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-09 09:13:13] [INFO ] Invariant cache hit.
[2023-03-09 09:13:13] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-09 09:13:13] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
[2023-03-09 09:13:14] [INFO ] Redundant transitions in 41 ms returned []
[2023-03-09 09:13:14] [INFO ] Invariant cache hit.
[2023-03-09 09:13:14] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/83 places, 812/873 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1359 ms. Remains : 66/83 places, 812/873 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), true, (OR p2 p1)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR p1 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s5 1) (EQ s22 1) (EQ s62 1)), p1:(AND (EQ s14 1) (EQ s19 1) (EQ s27 1) (EQ s32 1) (EQ s37 1) (EQ s42 1) (EQ s47 1) (EQ s50 1) (EQ s5...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 2829 steps with 165 reset in 27 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-14 finished in 1496 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 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 873/873 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 81 transition count 862
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 71 transition count 861
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 70 transition count 861
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 23 place count 70 transition count 860
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 69 transition count 860
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 31 place count 63 transition count 800
Iterating global reduction 3 with 6 rules applied. Total rules applied 37 place count 63 transition count 800
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 3 with 4 rules applied. Total rules applied 41 place count 61 transition count 798
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 43 place count 60 transition count 798
Applied a total of 43 rules in 72 ms. Remains 60 /83 variables (removed 23) and now considering 798/873 (removed 75) transitions.
// Phase 1: matrix 798 rows 60 cols
[2023-03-09 09:13:14] [INFO ] Computed 10 place invariants in 7 ms
[2023-03-09 09:13:15] [INFO ] Implicit Places using invariants in 514 ms returned []
[2023-03-09 09:13:15] [INFO ] Invariant cache hit.
[2023-03-09 09:13:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 09:13:15] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 1205 ms to find 0 implicit places.
[2023-03-09 09:13:16] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-09 09:13:16] [INFO ] Invariant cache hit.
[2023-03-09 09:13:16] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/83 places, 798/873 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1707 ms. Remains : 60/83 places, 798/873 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s48 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 1980 reset in 173 ms.
Product exploration explored 100000 steps with 1 reset in 49 ms.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 204 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 56 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 175 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 87 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 798/798 transitions.
Applied a total of 0 rules in 60 ms. Remains 60 /60 variables (removed 0) and now considering 798/798 (removed 0) transitions.
[2023-03-09 09:13:17] [INFO ] Invariant cache hit.
[2023-03-09 09:13:17] [INFO ] Implicit Places using invariants in 524 ms returned []
[2023-03-09 09:13:17] [INFO ] Invariant cache hit.
[2023-03-09 09:13:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 09:13:18] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 1235 ms to find 0 implicit places.
[2023-03-09 09:13:18] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-09 09:13:18] [INFO ] Invariant cache hit.
[2023-03-09 09:13:18] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1681 ms. Remains : 60/60 places, 798/798 transitions.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 93 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 27 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 171 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Product exploration explored 100000 steps with 750 reset in 142 ms.
Product exploration explored 100000 steps with 1371 reset in 153 ms.
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 798/798 transitions.
Applied a total of 0 rules in 59 ms. Remains 60 /60 variables (removed 0) and now considering 798/798 (removed 0) transitions.
[2023-03-09 09:13:19] [INFO ] Invariant cache hit.
[2023-03-09 09:13:20] [INFO ] Implicit Places using invariants in 485 ms returned []
[2023-03-09 09:13:20] [INFO ] Invariant cache hit.
[2023-03-09 09:13:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 09:13:21] [INFO ] Implicit Places using invariants and state equation in 738 ms returned []
Implicit Place search using SMT with State Equation took 1238 ms to find 0 implicit places.
[2023-03-09 09:13:21] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-09 09:13:21] [INFO ] Invariant cache hit.
[2023-03-09 09:13:21] [INFO ] Dead Transitions using invariants and state equation in 352 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1707 ms. Remains : 60/60 places, 798/798 transitions.
Treatment of property AutonomousCar-PT-09a-LTLFireability-15 finished in 6914 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((X((G(p1)||X(G(p2))))||p0))))'
Found a Lengthening insensitive property : AutonomousCar-PT-09a-LTLFireability-02
Stuttering acceptance computed with spot in 401 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Support contains 6 out of 83 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 83/83 places, 873/873 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 83 transition count 862
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 72 transition count 862
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 22 place count 72 transition count 861
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 71 transition count 861
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 66 transition count 811
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 66 transition count 811
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 2 with 4 rules applied. Total rules applied 38 place count 64 transition count 809
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 63 transition count 809
Applied a total of 40 rules in 84 ms. Remains 63 /83 variables (removed 20) and now considering 809/873 (removed 64) transitions.
// Phase 1: matrix 809 rows 63 cols
[2023-03-09 09:13:22] [INFO ] Computed 11 place invariants in 21 ms
[2023-03-09 09:13:22] [INFO ] Implicit Places using invariants in 569 ms returned []
[2023-03-09 09:13:22] [INFO ] Invariant cache hit.
[2023-03-09 09:13:23] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-09 09:13:23] [INFO ] Implicit Places using invariants and state equation in 874 ms returned []
Implicit Place search using SMT with State Equation took 1467 ms to find 0 implicit places.
[2023-03-09 09:13:23] [INFO ] Invariant cache hit.
[2023-03-09 09:13:24] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 63/83 places, 809/873 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2068 ms. Remains : 63/83 places, 809/873 transitions.
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(OR (EQ s1 0) (EQ s5 0) (EQ s20 0) (EQ s59 0)), p0:(OR (EQ s1 0) (EQ s5 0) (EQ s20 0) (EQ s59 0)), p2:(OR (EQ s1 0) (EQ s11 0) (EQ s18 0) (EQ s59 0))], 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, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 90 reset in 69 ms.
Product exploration explored 100000 steps with 38 reset in 73 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 232 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 640 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-09 09:13:25] [INFO ] Invariant cache hit.
[2023-03-09 09:13:25] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 09:13:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-09 09:13:25] [INFO ] After 455ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-09 09:13:25] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-09 09:13:26] [INFO ] After 265ms SMT Verify possible using 257 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-09 09:13:26] [INFO ] After 671ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 263 ms.
[2023-03-09 09:13:26] [INFO ] After 1454ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 87 ms.
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 809/809 transitions.
Graph (complete) has 935 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions 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 62 transition count 806
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 12 place count 62 transition count 797
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 102 place count 53 transition count 716
Applied a total of 102 rules in 69 ms. Remains 53 /63 variables (removed 10) and now considering 716/809 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 53/63 places, 716/809 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 710422 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :{}
Probabilistic random walk after 710422 steps, saw 90026 distinct states, run finished after 3001 ms. (steps per millisecond=236 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 716 rows 53 cols
[2023-03-09 09:13:30] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-09 09:13:30] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 09:13:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-09 09:13:30] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 09:13:30] [INFO ] After 413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 09:13:30] [INFO ] State equation strengthened by 175 read => feed constraints.
[2023-03-09 09:13:31] [INFO ] After 339ms SMT Verify possible using 175 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 09:13:31] [INFO ] After 674ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 289 ms.
[2023-03-09 09:13:31] [INFO ] After 1500ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 123 ms.
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 716/716 transitions.
Applied a total of 0 rules in 40 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 53/53 places, 716/716 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 716/716 transitions.
Applied a total of 0 rules in 30 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2023-03-09 09:13:32] [INFO ] Invariant cache hit.
[2023-03-09 09:13:32] [INFO ] Implicit Places using invariants in 543 ms returned []
[2023-03-09 09:13:32] [INFO ] Invariant cache hit.
[2023-03-09 09:13:32] [INFO ] State equation strengthened by 175 read => feed constraints.
[2023-03-09 09:13:33] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 1229 ms to find 0 implicit places.
[2023-03-09 09:13:33] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-09 09:13:33] [INFO ] Invariant cache hit.
[2023-03-09 09:13:33] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1838 ms. Remains : 53/53 places, 716/716 transitions.
Applied a total of 0 rules in 36 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-09 09:13:33] [INFO ] Invariant cache hit.
[2023-03-09 09:13:33] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 09:13:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2023-03-09 09:13:34] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-09 09:13:34] [INFO ] After 520ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 09:13:34] [INFO ] After 804ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 336 ms.
[2023-03-09 09:13:35] [INFO ] After 1278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p1)), (X (X p0)), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT (AND p2 p1))), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 323 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 373 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 414 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 809/809 transitions.
Applied a total of 0 rules in 7 ms. Remains 63 /63 variables (removed 0) and now considering 809/809 (removed 0) transitions.
// Phase 1: matrix 809 rows 63 cols
[2023-03-09 09:13:36] [INFO ] Computed 11 place invariants in 10 ms
[2023-03-09 09:13:36] [INFO ] Implicit Places using invariants in 456 ms returned []
[2023-03-09 09:13:36] [INFO ] Invariant cache hit.
[2023-03-09 09:13:37] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-09 09:13:37] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 1195 ms to find 0 implicit places.
[2023-03-09 09:13:37] [INFO ] Invariant cache hit.
[2023-03-09 09:13:37] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1505 ms. Remains : 63/63 places, 809/809 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 377 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 632 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 09:13:38] [INFO ] Invariant cache hit.
[2023-03-09 09:13:38] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 09:13:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-09 09:13:39] [INFO ] After 472ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 09:13:39] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-09 09:13:39] [INFO ] After 173ms SMT Verify possible using 257 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 09:13:39] [INFO ] After 525ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 231 ms.
[2023-03-09 09:13:40] [INFO ] After 1290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 58 ms.
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 809/809 transitions.
Graph (complete) has 935 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions 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 62 transition count 806
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 12 place count 62 transition count 797
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 102 place count 53 transition count 716
Applied a total of 102 rules in 74 ms. Remains 53 /63 variables (removed 10) and now considering 716/809 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 53/63 places, 716/809 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 765083 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :{}
Probabilistic random walk after 765083 steps, saw 96172 distinct states, run finished after 3001 ms. (steps per millisecond=254 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 716 rows 53 cols
[2023-03-09 09:13:43] [INFO ] Computed 12 place invariants in 8 ms
[2023-03-09 09:13:43] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 09:13:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-09 09:13:43] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 14 ms returned sat
[2023-03-09 09:13:43] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 09:13:43] [INFO ] State equation strengthened by 175 read => feed constraints.
[2023-03-09 09:13:43] [INFO ] After 128ms SMT Verify possible using 175 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 09:13:44] [INFO ] After 278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 228 ms.
[2023-03-09 09:13:44] [INFO ] After 835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 71 ms.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 716/716 transitions.
Applied a total of 0 rules in 33 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 53/53 places, 716/716 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 716/716 transitions.
Applied a total of 0 rules in 33 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2023-03-09 09:13:44] [INFO ] Invariant cache hit.
[2023-03-09 09:13:44] [INFO ] Implicit Places using invariants in 472 ms returned []
[2023-03-09 09:13:44] [INFO ] Invariant cache hit.
[2023-03-09 09:13:45] [INFO ] State equation strengthened by 175 read => feed constraints.
[2023-03-09 09:13:45] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1232 ms to find 0 implicit places.
[2023-03-09 09:13:45] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-09 09:13:45] [INFO ] Invariant cache hit.
[2023-03-09 09:13:46] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1710 ms. Remains : 53/53 places, 716/716 transitions.
Applied a total of 0 rules in 28 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-09 09:13:46] [INFO ] Invariant cache hit.
[2023-03-09 09:13:46] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 09:13:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 48 ms returned sat
[2023-03-09 09:13:46] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 09:13:46] [INFO ] After 315ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 09:13:46] [INFO ] After 481ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-09 09:13:47] [INFO ] After 820ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p2 p1))), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 336 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 407 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 462 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 424 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 130 reset in 128 ms.
Product exploration explored 100000 steps with 595 reset in 183 ms.
Applying partial POR strategy [true, false, true, true, false, false, false]
Stuttering acceptance computed with spot in 400 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 809/809 transitions.
Applied a total of 0 rules in 60 ms. Remains 63 /63 variables (removed 0) and now considering 809/809 (removed 0) transitions.
[2023-03-09 09:13:49] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 809 rows 63 cols
[2023-03-09 09:13:49] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-09 09:13:50] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 525 ms. Remains : 63/63 places, 809/809 transitions.
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 809/809 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 809/809 (removed 0) transitions.
[2023-03-09 09:13:50] [INFO ] Invariant cache hit.
[2023-03-09 09:13:50] [INFO ] Implicit Places using invariants in 577 ms returned []
[2023-03-09 09:13:50] [INFO ] Invariant cache hit.
[2023-03-09 09:13:50] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-09 09:13:51] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 1487 ms to find 0 implicit places.
[2023-03-09 09:13:51] [INFO ] Invariant cache hit.
[2023-03-09 09:13:52] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1927 ms. Remains : 63/63 places, 809/809 transitions.
Treatment of property AutonomousCar-PT-09a-LTLFireability-02 finished in 30520 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)))'
Found a Lengthening insensitive property : AutonomousCar-PT-09a-LTLFireability-03
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 83/83 places, 873/873 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 83 transition count 862
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 72 transition count 862
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 22 place count 72 transition count 861
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 71 transition count 861
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 66 transition count 811
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 66 transition count 811
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 2 with 4 rules applied. Total rules applied 38 place count 64 transition count 809
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 63 transition count 809
Applied a total of 40 rules in 35 ms. Remains 63 /83 variables (removed 20) and now considering 809/873 (removed 64) transitions.
// Phase 1: matrix 809 rows 63 cols
[2023-03-09 09:13:52] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-09 09:13:52] [INFO ] Implicit Places using invariants in 479 ms returned []
[2023-03-09 09:13:52] [INFO ] Invariant cache hit.
[2023-03-09 09:13:53] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-09 09:13:53] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1345 ms to find 0 implicit places.
[2023-03-09 09:13:53] [INFO ] Invariant cache hit.
[2023-03-09 09:13:54] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 63/83 places, 809/873 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1700 ms. Remains : 63/83 places, 809/873 transitions.
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-03 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:(OR (NEQ s1 1) (NEQ s6 1) (NEQ s55 1) (NEQ s59 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 541 reset in 131 ms.
Product exploration explored 100000 steps with 44 reset in 71 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 240 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 623 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17039 steps, run visited all 1 properties in 65 ms. (steps per millisecond=262 )
Probabilistic random walk after 17039 steps, saw 4144 distinct states, run finished after 65 ms. (steps per millisecond=262 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 349 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 809/809 transitions.
Applied a total of 0 rules in 7 ms. Remains 63 /63 variables (removed 0) and now considering 809/809 (removed 0) transitions.
[2023-03-09 09:13:55] [INFO ] Invariant cache hit.
[2023-03-09 09:13:56] [INFO ] Implicit Places using invariants in 488 ms returned []
[2023-03-09 09:13:56] [INFO ] Invariant cache hit.
[2023-03-09 09:13:56] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-09 09:13:56] [INFO ] Implicit Places using invariants and state equation in 827 ms returned []
Implicit Place search using SMT with State Equation took 1329 ms to find 0 implicit places.
[2023-03-09 09:13:56] [INFO ] Invariant cache hit.
[2023-03-09 09:13:57] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1638 ms. Remains : 63/63 places, 809/809 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 648 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17039 steps, run visited all 1 properties in 62 ms. (steps per millisecond=274 )
Probabilistic random walk after 17039 steps, saw 4144 distinct states, run finished after 62 ms. (steps per millisecond=274 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 238 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 971 reset in 193 ms.
Product exploration explored 100000 steps with 32 reset in 70 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 809/809 transitions.
Applied a total of 0 rules in 99 ms. Remains 63 /63 variables (removed 0) and now considering 809/809 (removed 0) transitions.
[2023-03-09 09:13:59] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-09 09:13:59] [INFO ] Invariant cache hit.
[2023-03-09 09:13:59] [INFO ] Dead Transitions using invariants and state equation in 359 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 507 ms. Remains : 63/63 places, 809/809 transitions.
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 809/809 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 809/809 (removed 0) transitions.
[2023-03-09 09:13:59] [INFO ] Invariant cache hit.
[2023-03-09 09:13:59] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-09 09:13:59] [INFO ] Invariant cache hit.
[2023-03-09 09:14:00] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-09 09:14:00] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1185 ms to find 0 implicit places.
[2023-03-09 09:14:00] [INFO ] Invariant cache hit.
[2023-03-09 09:14:01] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1585 ms. Remains : 63/63 places, 809/809 transitions.
Treatment of property AutonomousCar-PT-09a-LTLFireability-03 finished in 8998 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||G(p1)))))'
Found a Lengthening insensitive property : AutonomousCar-PT-09a-LTLFireability-07
Stuttering acceptance computed with spot in 194 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 83 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 83/83 places, 873/873 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 83 transition count 863
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 73 transition count 863
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 73 transition count 862
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 72 transition count 862
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 67 transition count 812
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 67 transition count 812
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 2 with 4 rules applied. Total rules applied 36 place count 65 transition count 810
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 64 transition count 810
Applied a total of 38 rules in 87 ms. Remains 64 /83 variables (removed 19) and now considering 810/873 (removed 63) transitions.
// Phase 1: matrix 810 rows 64 cols
[2023-03-09 09:14:01] [INFO ] Computed 11 place invariants in 9 ms
[2023-03-09 09:14:02] [INFO ] Implicit Places using invariants in 645 ms returned []
[2023-03-09 09:14:02] [INFO ] Invariant cache hit.
[2023-03-09 09:14:02] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-09 09:14:03] [INFO ] Implicit Places using invariants and state equation in 899 ms returned []
Implicit Place search using SMT with State Equation took 1546 ms to find 0 implicit places.
[2023-03-09 09:14:03] [INFO ] Invariant cache hit.
[2023-03-09 09:14:03] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 64/83 places, 810/873 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2230 ms. Remains : 64/83 places, 810/873 transitions.
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (NEQ s1 1) (NEQ s5 1) (NEQ s37 1) (NEQ s60 1)), p0:(AND (EQ s1 1) (EQ s10 1) (EQ s46 1) (EQ s60 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 240 reset in 88 ms.
Product exploration explored 100000 steps with 329 reset in 112 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 553 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 642 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1175814 steps, run timeout after 3001 ms. (steps per millisecond=391 ) properties seen :{}
Probabilistic random walk after 1175814 steps, saw 135894 distinct states, run finished after 3001 ms. (steps per millisecond=391 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 09:14:07] [INFO ] Invariant cache hit.
[2023-03-09 09:14:07] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-09 09:14:08] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:14:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-09 09:14:08] [INFO ] After 295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:14:08] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-09 09:14:08] [INFO ] After 93ms SMT Verify possible using 257 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:14:08] [INFO ] After 265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-09 09:14:08] [INFO ] After 714ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 36 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 810/810 transitions.
Graph (complete) has 936 edges and 64 vertex of which 63 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
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 63 transition count 807
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 62 transition count 797
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 62 transition count 797
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 14 place count 62 transition count 788
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 95 place count 53 transition count 716
Applied a total of 95 rules in 101 ms. Remains 53 /64 variables (removed 11) and now considering 716/810 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 53/64 places, 716/810 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1120773 steps, run visited all 1 properties in 2999 ms. (steps per millisecond=373 )
Probabilistic random walk after 1120773 steps, saw 142470 distinct states, run finished after 2999 ms. (steps per millisecond=373 ) properties seen :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 9 factoid took 303 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p1), (NOT p1)]
Support contains 4 out of 64 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 810/810 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 810/810 (removed 0) transitions.
[2023-03-09 09:14:12] [INFO ] Invariant cache hit.
[2023-03-09 09:14:13] [INFO ] Implicit Places using invariants in 588 ms returned []
[2023-03-09 09:14:13] [INFO ] Invariant cache hit.
[2023-03-09 09:14:13] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-09 09:14:13] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 1386 ms to find 0 implicit places.
[2023-03-09 09:14:13] [INFO ] Invariant cache hit.
[2023-03-09 09:14:14] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1724 ms. Remains : 64/64 places, 810/810 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 635 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1143851 steps, run timeout after 3001 ms. (steps per millisecond=381 ) properties seen :{}
Probabilistic random walk after 1143851 steps, saw 131321 distinct states, run finished after 3001 ms. (steps per millisecond=381 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 09:14:17] [INFO ] Invariant cache hit.
[2023-03-09 09:14:17] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-09 09:14:17] [INFO ] After 378ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:14:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-09 09:14:18] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:14:18] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-09 09:14:18] [INFO ] After 119ms SMT Verify possible using 257 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:14:18] [INFO ] After 260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-09 09:14:18] [INFO ] After 721ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 810/810 transitions.
Graph (complete) has 936 edges and 64 vertex of which 63 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 63 transition count 807
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 62 transition count 797
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 62 transition count 797
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 14 place count 62 transition count 788
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 95 place count 53 transition count 716
Applied a total of 95 rules in 88 ms. Remains 53 /64 variables (removed 11) and now considering 716/810 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 53/64 places, 716/810 transitions.
Incomplete random walk after 10000 steps, including 77 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1120773 steps, run visited all 1 properties in 2838 ms. (steps per millisecond=394 )
Probabilistic random walk after 1120773 steps, saw 142470 distinct states, run finished after 2838 ms. (steps per millisecond=394 ) properties seen :1
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 271 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 151 reset in 103 ms.
Product exploration explored 100000 steps with 357 reset in 114 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (NOT p1)]
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 810/810 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 63 transition count 800
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 800
Applied a total of 2 rules in 85 ms. Remains 63 /64 variables (removed 1) and now considering 800/810 (removed 10) transitions.
[2023-03-09 09:14:22] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 800 rows 63 cols
[2023-03-09 09:14:22] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-09 09:14:23] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/64 places, 800/810 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 625 ms. Remains : 63/64 places, 800/810 transitions.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 810/810 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 63 transition count 800
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 800
Applied a total of 2 rules in 5 ms. Remains 63 /64 variables (removed 1) and now considering 800/810 (removed 10) transitions.
[2023-03-09 09:14:23] [INFO ] Invariant cache hit.
[2023-03-09 09:14:23] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-03-09 09:14:23] [INFO ] Invariant cache hit.
[2023-03-09 09:14:24] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-09 09:14:24] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
[2023-03-09 09:14:24] [INFO ] Invariant cache hit.
[2023-03-09 09:14:24] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/64 places, 800/810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1499 ms. Remains : 63/64 places, 800/810 transitions.
Treatment of property AutonomousCar-PT-09a-LTLFireability-07 finished in 23931 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)) U p1))'
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)))'
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)))'
[2023-03-09 09:14:25] [INFO ] Flatten gal took : 121 ms
[2023-03-09 09:14:25] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-09 09:14:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 83 places, 873 transitions and 12766 arcs took 12 ms.
Total runtime 221521 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutonomousCar-PT-09a
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/380
LTLFireability

FORMULA AutonomousCar-PT-09a-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-09a-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-09a-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678353466831

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/380/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/380/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/380/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:427
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 AutonomousCar-PT-09a-LTLFireability-02
lola: time limit : 599 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/599 5/32 AutonomousCar-PT-09a-LTLFireability-02 741119 m, 148223 m/sec, 4714705 t fired, .

Time elapsed: 5 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/599 10/32 AutonomousCar-PT-09a-LTLFireability-02 1408729 m, 133522 m/sec, 9622524 t fired, .

Time elapsed: 10 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/599 15/32 AutonomousCar-PT-09a-LTLFireability-02 2146187 m, 147491 m/sec, 14455729 t fired, .

Time elapsed: 15 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/599 19/32 AutonomousCar-PT-09a-LTLFireability-02 2858601 m, 142482 m/sec, 19306535 t fired, .

Time elapsed: 20 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 24/599 24/32 AutonomousCar-PT-09a-LTLFireability-02 3483798 m, 125039 m/sec, 24172624 t fired, .

Time elapsed: 25 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 29/599 29/32 AutonomousCar-PT-09a-LTLFireability-02 4257207 m, 154681 m/sec, 28983660 t fired, .

Time elapsed: 30 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 1 (type EXCL) for AutonomousCar-PT-09a-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 7 (type EXCL) for 6 AutonomousCar-PT-09a-LTLFireability-07
lola: time limit : 713 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/713 6/32 AutonomousCar-PT-09a-LTLFireability-07 770991 m, 154198 m/sec, 4919345 t fired, .

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/713 10/32 AutonomousCar-PT-09a-LTLFireability-07 1453349 m, 136471 m/sec, 9942176 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/713 15/32 AutonomousCar-PT-09a-LTLFireability-07 2206607 m, 150651 m/sec, 14841689 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/713 20/32 AutonomousCar-PT-09a-LTLFireability-07 2915937 m, 141866 m/sec, 19757731 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/713 24/32 AutonomousCar-PT-09a-LTLFireability-07 3568052 m, 130423 m/sec, 24644083 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 30/713 29/32 AutonomousCar-PT-09a-LTLFireability-07 4339249 m, 154239 m/sec, 29533694 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 7 (type EXCL) for AutonomousCar-PT-09a-LTLFireability-07 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 4 (type EXCL) for 3 AutonomousCar-PT-09a-LTLFireability-03
lola: time limit : 882 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/882 6/32 AutonomousCar-PT-09a-LTLFireability-03 766829 m, 153365 m/sec, 4888599 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/882 10/32 AutonomousCar-PT-09a-LTLFireability-03 1439999 m, 134634 m/sec, 9839497 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/882 15/32 AutonomousCar-PT-09a-LTLFireability-03 2180504 m, 148101 m/sec, 14687900 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/882 20/32 AutonomousCar-PT-09a-LTLFireability-03 2888488 m, 141596 m/sec, 19536179 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/882 24/32 AutonomousCar-PT-09a-LTLFireability-03 3516785 m, 125659 m/sec, 24342748 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/882 29/32 AutonomousCar-PT-09a-LTLFireability-03 4282269 m, 153096 m/sec, 29143049 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 4 (type EXCL) for AutonomousCar-PT-09a-LTLFireability-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-09a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 16 (type EXCL) for 15 AutonomousCar-PT-09a-LTLFireability-15
lola: time limit : 1165 sec
lola: memory limit: 32 pages
lola: FINISHED task # 16 (type EXCL) for AutonomousCar-PT-09a-LTLFireability-15
lola: result : false
lola: markings : 6257
lola: fired transitions : 7974
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 13 (type EXCL) for 12 AutonomousCar-PT-09a-LTLFireability-13
lola: time limit : 1747 sec
lola: memory limit: 32 pages
lola: FINISHED task # 13 (type EXCL) for AutonomousCar-PT-09a-LTLFireability-13
lola: result : false
lola: markings : 6258
lola: fired transitions : 7975
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 AutonomousCar-PT-09a-LTLFireability-12
lola: time limit : 3493 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-09a-LTLFireability-13: LTL false LTL model checker
AutonomousCar-PT-09a-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 3/3493 1/32 AutonomousCar-PT-09a-LTLFireability-12 57301 m, 11460 m/sec, 197500 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-09a-LTLFireability-13: LTL false LTL model checker
AutonomousCar-PT-09a-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 8/3493 2/32 AutonomousCar-PT-09a-LTLFireability-12 162470 m, 21033 m/sec, 730158 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-09a-LTLFireability-13: LTL false LTL model checker
AutonomousCar-PT-09a-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 14/3493 2/32 AutonomousCar-PT-09a-LTLFireability-12 220904 m, 11686 m/sec, 912621 t fired, .

Time elapsed: 121 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-09a-LTLFireability-13: LTL false LTL model checker
AutonomousCar-PT-09a-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 19/3493 3/32 AutonomousCar-PT-09a-LTLFireability-12 333824 m, 22584 m/sec, 1490582 t fired, .

Time elapsed: 126 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-09a-LTLFireability-13: LTL false LTL model checker
AutonomousCar-PT-09a-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 24/3493 3/32 AutonomousCar-PT-09a-LTLFireability-12 382918 m, 9818 m/sec, 1625574 t fired, .

Time elapsed: 131 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-09a-LTLFireability-13: LTL false LTL model checker
AutonomousCar-PT-09a-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 29/3493 4/32 AutonomousCar-PT-09a-LTLFireability-12 500088 m, 23434 m/sec, 2209474 t fired, .

Time elapsed: 136 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-09a-LTLFireability-13: LTL false LTL model checker
AutonomousCar-PT-09a-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 34/3493 4/32 AutonomousCar-PT-09a-LTLFireability-12 551456 m, 10273 m/sec, 2377714 t fired, .

Time elapsed: 141 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-09a-LTLFireability-13: LTL false LTL model checker
AutonomousCar-PT-09a-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 39/3493 5/32 AutonomousCar-PT-09a-LTLFireability-12 665101 m, 22729 m/sec, 2921470 t fired, .

Time elapsed: 146 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-09a-LTLFireability-13: LTL false LTL model checker
AutonomousCar-PT-09a-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 44/3493 5/32 AutonomousCar-PT-09a-LTLFireability-12 722312 m, 11442 m/sec, 3139094 t fired, .

Time elapsed: 151 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-09a-LTLFireability-13: LTL false LTL model checker
AutonomousCar-PT-09a-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 49/3493 6/32 AutonomousCar-PT-09a-LTLFireability-12 831446 m, 21826 m/sec, 3644698 t fired, .

Time elapsed: 156 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-09a-LTLFireability-13: LTL false LTL model checker
AutonomousCar-PT-09a-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 54/3493 6/32 AutonomousCar-PT-09a-LTLFireability-12 893259 m, 12362 m/sec, 3901379 t fired, .

Time elapsed: 161 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-09a-LTLFireability-13: LTL false LTL model checker
AutonomousCar-PT-09a-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 59/3493 7/32 AutonomousCar-PT-09a-LTLFireability-12 996202 m, 20588 m/sec, 4361246 t fired, .

Time elapsed: 166 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-09a-LTLFireability-13: LTL false LTL model checker
AutonomousCar-PT-09a-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 64/3493 7/32 AutonomousCar-PT-09a-LTLFireability-12 1063704 m, 13500 m/sec, 4663045 t fired, .

Time elapsed: 171 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-09a-LTLFireability-13: LTL false LTL model checker
AutonomousCar-PT-09a-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 69/3493 8/32 AutonomousCar-PT-09a-LTLFireability-12 1160434 m, 19346 m/sec, 5073749 t fired, .

Time elapsed: 176 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-09a-LTLFireability-13: LTL false LTL model checker
AutonomousCar-PT-09a-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 74/3493 9/32 AutonomousCar-PT-09a-LTLFireability-12 1234758 m, 14864 m/sec, 5426167 t fired, .

Time elapsed: 181 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-09a-LTLFireability-13: LTL false LTL model checker
AutonomousCar-PT-09a-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 79/3493 9/32 AutonomousCar-PT-09a-LTLFireability-12 1324601 m, 17968 m/sec, 5791590 t fired, .

Time elapsed: 186 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-09a-LTLFireability-13: LTL false LTL model checker
AutonomousCar-PT-09a-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 84/3493 10/32 AutonomousCar-PT-09a-LTLFireability-12 1406042 m, 16288 m/sec, 6190072 t fired, .

Time elapsed: 191 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-09a-LTLFireability-13: LTL false LTL model checker
AutonomousCar-PT-09a-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 89/3493 10/32 AutonomousCar-PT-09a-LTLFireability-12 1489828 m, 16757 m/sec, 6511061 t fired, .

Time elapsed: 196 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-09a-LTLFireability-13: LTL false LTL model checker
AutonomousCar-PT-09a-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-09a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 94/3493 11/32 AutonomousCar-PT-09a-LTLFireability-12 1577915 m, 17617 m/sec, 6952344 t fired, .

Time elapsed: 201 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: FINISHED task # 10 (type EXCL) for AutonomousCar-PT-09a-LTLFireability-12
lola: result : false
lola: markings : 1584983
lola: fired transitions : 6972750
lola: time used : 94.000000
lola: memory pages used : 11
lola: Portfolio finished: no open tasks 6

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-09a-LTLFireability-02: LTL unknown AGGR
AutonomousCar-PT-09a-LTLFireability-03: LTL unknown AGGR
AutonomousCar-PT-09a-LTLFireability-07: LTL unknown AGGR
AutonomousCar-PT-09a-LTLFireability-12: LTL false LTL model checker
AutonomousCar-PT-09a-LTLFireability-13: LTL false LTL model checker
AutonomousCar-PT-09a-LTLFireability-15: LTL false LTL model checker


Time elapsed: 201 secs. Pages in use: 32

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-09a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is AutonomousCar-PT-09a, 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 r007-oct2-167813595800660"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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