Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463873100524.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutonomousCar-PT-08a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463873100524
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 860K
-rw-r--r-- 1 mcc users 6.2K Jun 7 15:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 7 15:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 7 15:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 7 15:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 3 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 3 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 3 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 3 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 9.4K Jun 7 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Jun 7 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Jun 7 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Jun 7 15:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 3 16:02 instance
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 iscolored
-rw-r--r-- 1 mcc users 448K Jun 3 16:02 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-08a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654910590643

Running Version 202205111006
[2022-06-11 01:23:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 01:23:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 01:23:13] [INFO ] Load time of PNML (sax parser for PT used): 243 ms
[2022-06-11 01:23:13] [INFO ] Transformed 81 places.
[2022-06-11 01:23:13] [INFO ] Transformed 849 transitions.
[2022-06-11 01:23:13] [INFO ] Found NUPN structural information;
[2022-06-11 01:23:13] [INFO ] Parsed PT model containing 81 places and 849 transitions in 420 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 275 transitions
Reduce redundant transitions removed 275 transitions.
FORMULA AutonomousCar-PT-08a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 574/574 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 77 transition count 546
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 77 transition count 546
Applied a total of 8 rules in 36 ms. Remains 77 /81 variables (removed 4) and now considering 546/574 (removed 28) transitions.
// Phase 1: matrix 546 rows 77 cols
[2022-06-11 01:23:13] [INFO ] Computed 12 place invariants in 26 ms
[2022-06-11 01:23:13] [INFO ] Implicit Places using invariants in 226 ms returned []
// Phase 1: matrix 546 rows 77 cols
[2022-06-11 01:23:13] [INFO ] Computed 12 place invariants in 8 ms
[2022-06-11 01:23:13] [INFO ] State equation strengthened by 235 read => feed constraints.
[2022-06-11 01:23:14] [INFO ] Implicit Places using invariants and state equation in 392 ms returned [73, 75]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 668 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/81 places, 546/574 transitions.
Applied a total of 0 rules in 9 ms. Remains 75 /75 variables (removed 0) and now considering 546/546 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 75/81 places, 546/574 transitions.
Support contains 49 out of 75 places after structural reductions.
[2022-06-11 01:23:14] [INFO ] Flatten gal took : 343 ms
[2022-06-11 01:23:15] [INFO ] Flatten gal took : 216 ms
[2022-06-11 01:23:15] [INFO ] Input system was already deterministic with 546 transitions.
Incomplete random walk after 10000 steps, including 519 resets, run finished after 1245 ms. (steps per millisecond=8 ) properties (out of 35) seen :13
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) 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 22) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 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 5 resets, run finished after 9 ms. (steps per millisecond=111 ) 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 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 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 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 5 resets, run finished after 8 ms. (steps per millisecond=125 ) 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 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 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 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 4 resets, run finished after 7 ms. (steps per millisecond=143 ) 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 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 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 546 rows 75 cols
[2022-06-11 01:23:16] [INFO ] Computed 10 place invariants in 5 ms
[2022-06-11 01:23:17] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-06-11 01:23:18] [INFO ] After 1126ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:19
[2022-06-11 01:23:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-06-11 01:23:20] [INFO ] After 1438ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :19
[2022-06-11 01:23:20] [INFO ] State equation strengthened by 235 read => feed constraints.
[2022-06-11 01:23:21] [INFO ] After 1293ms SMT Verify possible using 235 Read/Feed constraints in natural domain returned unsat :2 sat :19
[2022-06-11 01:23:22] [INFO ] After 2773ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :19
Attempting to minimize the solution found.
Minimization took 1243 ms.
[2022-06-11 01:23:24] [INFO ] After 5651ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :19
Fused 21 Parikh solutions to 19 different solutions.
Parikh walk visited 1 properties in 477 ms.
Support contains 37 out of 75 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 75/75 places, 546/546 transitions.
Graph (complete) has 812 edges and 75 vertex of which 74 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.21 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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 74 transition count 541
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 73 transition count 539
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 71 transition count 539
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 71 transition count 536
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 16 place count 68 transition count 536
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 19 place count 65 transition count 517
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 65 transition count 517
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 27 place count 65 transition count 512
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 40 place count 60 transition count 504
Applied a total of 40 rules in 175 ms. Remains 60 /75 variables (removed 15) and now considering 504/546 (removed 42) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/75 places, 504/546 transitions.
Incomplete random walk after 10000 steps, including 485 resets, run finished after 592 ms. (steps per millisecond=16 ) properties (out of 18) seen :3
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 504 rows 60 cols
[2022-06-11 01:23:25] [INFO ] Computed 12 place invariants in 8 ms
[2022-06-11 01:23:25] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2022-06-11 01:23:26] [INFO ] After 542ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-06-11 01:23:26] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2022-06-11 01:23:27] [INFO ] After 811ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-06-11 01:23:27] [INFO ] State equation strengthened by 209 read => feed constraints.
[2022-06-11 01:23:28] [INFO ] After 1069ms SMT Verify possible using 209 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2022-06-11 01:23:29] [INFO ] After 2182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 701 ms.
[2022-06-11 01:23:30] [INFO ] After 3807ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 631 ms.
Support contains 26 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 504/504 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 60 transition count 503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 59 transition count 503
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 58 transition count 494
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 58 transition count 494
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 6 place count 57 transition count 493
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 57 transition count 492
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 16 place count 56 transition count 484
Applied a total of 16 rules in 71 ms. Remains 56 /60 variables (removed 4) and now considering 484/504 (removed 20) transitions.
Finished structural reductions, in 1 iterations. Remains : 56/60 places, 484/504 transitions.
Incomplete random walk after 10000 steps, including 198 resets, run finished after 509 ms. (steps per millisecond=19 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 484 rows 56 cols
[2022-06-11 01:23:31] [INFO ] Computed 12 place invariants in 5 ms
[2022-06-11 01:23:31] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2022-06-11 01:23:31] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-11 01:23:31] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-06-11 01:23:32] [INFO ] After 477ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-11 01:23:32] [INFO ] State equation strengthened by 193 read => feed constraints.
[2022-06-11 01:23:32] [INFO ] After 352ms SMT Verify possible using 193 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-06-11 01:23:32] [INFO ] After 713ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 311 ms.
[2022-06-11 01:23:33] [INFO ] After 1558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 228 ms.
Support contains 11 out of 56 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 56/56 places, 484/484 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 56 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 55 transition count 483
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 6 place count 53 transition count 481
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 53 transition count 480
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 16 place count 52 transition count 472
Applied a total of 16 rules in 81 ms. Remains 52 /56 variables (removed 4) and now considering 472/484 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 52/56 places, 472/484 transitions.
Incomplete random walk after 10000 steps, including 91 resets, run finished after 468 ms. (steps per millisecond=21 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 472 rows 52 cols
[2022-06-11 01:23:34] [INFO ] Computed 12 place invariants in 6 ms
[2022-06-11 01:23:34] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2022-06-11 01:23:34] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-11 01:23:34] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2022-06-11 01:23:34] [INFO ] After 446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-11 01:23:34] [INFO ] State equation strengthened by 185 read => feed constraints.
[2022-06-11 01:23:35] [INFO ] After 303ms SMT Verify possible using 185 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-11 01:23:35] [INFO ] After 629ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 290 ms.
[2022-06-11 01:23:35] [INFO ] After 1425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 47 ms.
Support contains 9 out of 52 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 52/52 places, 472/472 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 52 transition count 471
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 51 transition count 463
Applied a total of 10 rules in 59 ms. Remains 51 /52 variables (removed 1) and now considering 463/472 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 51/52 places, 463/472 transitions.
Incomplete random walk after 10000 steps, including 63 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 551535 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :{1=1, 3=1}
Probabilistic random walk after 551535 steps, saw 75963 distinct states, run finished after 3006 ms. (steps per millisecond=183 ) properties seen :2
Running SMT prover for 3 properties.
// Phase 1: matrix 463 rows 51 cols
[2022-06-11 01:23:39] [INFO ] Computed 12 place invariants in 8 ms
[2022-06-11 01:23:39] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2022-06-11 01:23:39] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-11 01:23:39] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2022-06-11 01:23:39] [INFO ] After 310ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-11 01:23:39] [INFO ] State equation strengthened by 177 read => feed constraints.
[2022-06-11 01:23:40] [INFO ] After 186ms SMT Verify possible using 177 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-11 01:23:40] [INFO ] After 361ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 151 ms.
[2022-06-11 01:23:40] [INFO ] After 875ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 53 ms.
Support contains 7 out of 51 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 51/51 places, 463/463 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 51 transition count 461
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 20 place count 49 transition count 445
Applied a total of 20 rules in 58 ms. Remains 49 /51 variables (removed 2) and now considering 445/463 (removed 18) transitions.
Finished structural reductions, in 1 iterations. Remains : 49/51 places, 445/463 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 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 40 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 589999 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :{}
Probabilistic random walk after 589999 steps, saw 78936 distinct states, run finished after 3002 ms. (steps per millisecond=196 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 445 rows 49 cols
[2022-06-11 01:23:43] [INFO ] Computed 12 place invariants in 4 ms
[2022-06-11 01:23:44] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2022-06-11 01:23:44] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-11 01:23:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2022-06-11 01:23:44] [INFO ] After 422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-11 01:23:44] [INFO ] State equation strengthened by 161 read => feed constraints.
[2022-06-11 01:23:44] [INFO ] After 183ms SMT Verify possible using 161 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-11 01:23:44] [INFO ] After 380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 170 ms.
[2022-06-11 01:23:45] [INFO ] After 1033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 25 ms.
Support contains 7 out of 49 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 49/49 places, 445/445 transitions.
Applied a total of 0 rules in 23 ms. Remains 49 /49 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 49/49 places, 445/445 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 49/49 places, 445/445 transitions.
Applied a total of 0 rules in 22 ms. Remains 49 /49 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 49 cols
[2022-06-11 01:23:45] [INFO ] Computed 12 place invariants in 9 ms
[2022-06-11 01:23:45] [INFO ] Implicit Places using invariants in 193 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 195 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 48/49 places, 445/445 transitions.
Applied a total of 0 rules in 22 ms. Remains 48 /48 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 48/49 places, 445/445 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 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 17 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1081605 steps, run timeout after 3001 ms. (steps per millisecond=360 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 1081605 steps, saw 140241 distinct states, run finished after 3001 ms. (steps per millisecond=360 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 445 rows 48 cols
[2022-06-11 01:23:48] [INFO ] Computed 11 place invariants in 4 ms
[2022-06-11 01:23:48] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 01:23:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-06-11 01:23:48] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 01:23:48] [INFO ] State equation strengthened by 161 read => feed constraints.
[2022-06-11 01:23:49] [INFO ] After 76ms SMT Verify possible using 161 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 01:23:49] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2022-06-11 01:23:49] [INFO ] After 422ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 48/48 places, 445/445 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 47 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 47 transition count 436
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 47 transition count 435
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 12 place count 46 transition count 427
Applied a total of 12 rules in 48 ms. Remains 46 /48 variables (removed 2) and now considering 427/445 (removed 18) transitions.
Finished structural reductions, in 1 iterations. Remains : 46/48 places, 427/445 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1781467 steps, run timeout after 3001 ms. (steps per millisecond=593 ) properties seen :{}
Probabilistic random walk after 1781467 steps, saw 220592 distinct states, run finished after 3001 ms. (steps per millisecond=593 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 427 rows 46 cols
[2022-06-11 01:23:52] [INFO ] Computed 11 place invariants in 5 ms
[2022-06-11 01:23:52] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 01:23:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-11 01:23:52] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 01:23:52] [INFO ] State equation strengthened by 145 read => feed constraints.
[2022-06-11 01:23:52] [INFO ] After 101ms SMT Verify possible using 145 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 01:23:52] [INFO ] After 184ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2022-06-11 01:23:52] [INFO ] After 583ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 46/46 places, 427/427 transitions.
Applied a total of 0 rules in 24 ms. Remains 46 /46 variables (removed 0) and now considering 427/427 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 46/46 places, 427/427 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 46/46 places, 427/427 transitions.
Applied a total of 0 rules in 20 ms. Remains 46 /46 variables (removed 0) and now considering 427/427 (removed 0) transitions.
// Phase 1: matrix 427 rows 46 cols
[2022-06-11 01:23:52] [INFO ] Computed 11 place invariants in 3 ms
[2022-06-11 01:23:53] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 427 rows 46 cols
[2022-06-11 01:23:53] [INFO ] Computed 11 place invariants in 3 ms
[2022-06-11 01:23:53] [INFO ] State equation strengthened by 145 read => feed constraints.
[2022-06-11 01:23:53] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2022-06-11 01:23:53] [INFO ] Redundant transitions in 38 ms returned []
// Phase 1: matrix 427 rows 46 cols
[2022-06-11 01:23:53] [INFO ] Computed 11 place invariants in 3 ms
[2022-06-11 01:23:54] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/46 places, 427/427 transitions.
Applied a total of 0 rules in 29 ms. Remains 46 /46 variables (removed 0) and now considering 427/427 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 427 rows 46 cols
[2022-06-11 01:23:54] [INFO ] Computed 11 place invariants in 5 ms
[2022-06-11 01:23:54] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 01:23:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-11 01:23:54] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 01:23:54] [INFO ] After 297ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2022-06-11 01:23:54] [INFO ] After 388ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 01:23:54] [INFO ] Flatten gal took : 90 ms
[2022-06-11 01:23:54] [INFO ] Flatten gal took : 82 ms
[2022-06-11 01:23:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3487803170670794816.gal : 41 ms
[2022-06-11 01:23:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14927571171261680889.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms7329920498872097743;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3487803170670794816.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14927571171261680889.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality14927571171261680889.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 22
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :22 after 90
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :90 after 21442
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :21442 after 89554
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :89554 after 154462
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :154462 after 253954
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.47149e+06,0.765425,18068,2,343,13,44772,7,0,615,37936,0
Total reachable state count : 1471489

Verifying 1 reachability properties.
Reachability property AtomicPropp27 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp27,16384,0.766898,18068,2,174,13,44772,7,0,622,37936,0
FORMULA AutonomousCar-PT-08a-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 3 stabilizing places and 2 stable transitions
FORMULA AutonomousCar-PT-08a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p0)||p1)) U X(!(p2 U p3))))'
Support contains 9 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 546/546 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 73 transition count 528
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 73 transition count 528
Applied a total of 4 rules in 6 ms. Remains 73 /75 variables (removed 2) and now considering 528/546 (removed 18) transitions.
// Phase 1: matrix 528 rows 73 cols
[2022-06-11 01:23:56] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 01:23:56] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 528 rows 73 cols
[2022-06-11 01:23:56] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 01:23:56] [INFO ] State equation strengthened by 219 read => feed constraints.
[2022-06-11 01:23:56] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
// Phase 1: matrix 528 rows 73 cols
[2022-06-11 01:23:56] [INFO ] Computed 10 place invariants in 5 ms
[2022-06-11 01:23:57] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 73/75 places, 528/546 transitions.
Finished structural reductions, in 1 iterations. Remains : 73/75 places, 528/546 transitions.
Stuttering acceptance computed with spot in 465 ms :[p3, p3, (NOT p0), (AND (NOT p0) p3), true, p3]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 1}, { cond=p3, acceptance={0} source=1 dest: 1}, { cond=(AND p3 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p3 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p3, acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s11 1) (EQ s40 1) (EQ s68 1)), p3:(AND (EQ s1 1) (EQ s11 1) (EQ s45 1) (EQ s68 1)), p1:(AND (EQ s1 1) (EQ s7 1) (EQ s58 1) (EQ s68 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3321 ms.
Product exploration explored 100000 steps with 50000 reset in 3059 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 (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT p3)), (X (NOT (AND p3 (NOT p1)))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (NOT (AND p2 (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0))
Knowledge based reduction with 12 factoid took 402 ms. Reduced automaton from 6 states, 11 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-08a-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-08a-LTLFireability-00 finished in 8571 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&X(F(p1))))))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 546/546 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 70 transition count 501
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 70 transition count 501
Applied a total of 10 rules in 5 ms. Remains 70 /75 variables (removed 5) and now considering 501/546 (removed 45) transitions.
// Phase 1: matrix 501 rows 70 cols
[2022-06-11 01:24:04] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 01:24:04] [INFO ] Implicit Places using invariants in 176 ms returned []
// Phase 1: matrix 501 rows 70 cols
[2022-06-11 01:24:04] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:24:05] [INFO ] State equation strengthened by 195 read => feed constraints.
[2022-06-11 01:24:05] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
// Phase 1: matrix 501 rows 70 cols
[2022-06-11 01:24:05] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 01:24:05] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/75 places, 501/546 transitions.
Finished structural reductions, in 1 iterations. Remains : 70/75 places, 501/546 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p0:(AND (EQ s1 1) (EQ s6 1) (EQ s22 1) (EQ s65 1)), p1:(AND (EQ s1 1) (EQ s11 1) (EQ s18 1) (EQ s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-01 finished in 1234 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(G((X(!X(p0)) U (F(p1) U p2)))))||p2)))'
Support contains 4 out of 75 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 546/546 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 75 transition count 538
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 18 place count 67 transition count 536
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 65 transition count 536
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 20 place count 65 transition count 535
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 22 place count 64 transition count 535
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 26 place count 60 transition count 499
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 60 transition count 499
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 34 place count 58 transition count 497
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 36 place count 57 transition count 497
Applied a total of 36 rules in 120 ms. Remains 57 /75 variables (removed 18) and now considering 497/546 (removed 49) transitions.
// Phase 1: matrix 497 rows 57 cols
[2022-06-11 01:24:06] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 01:24:06] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 497 rows 57 cols
[2022-06-11 01:24:06] [INFO ] Computed 10 place invariants in 4 ms
[2022-06-11 01:24:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-06-11 01:24:06] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2022-06-11 01:24:06] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 497 rows 57 cols
[2022-06-11 01:24:06] [INFO ] Computed 10 place invariants in 4 ms
[2022-06-11 01:24:07] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/75 places, 497/546 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/75 places, 497/546 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p2)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s6 1) (EQ s25 1) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-02 finished in 1179 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(X(!p0))||p0) U (F(G(X(p0)))&&F(p1)))))'
Support contains 13 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 546/546 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 75 transition count 539
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 68 transition count 538
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 67 transition count 538
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 16 place count 67 transition count 536
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 20 place count 65 transition count 536
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 25 place count 60 transition count 491
Iterating global reduction 3 with 5 rules applied. Total rules applied 30 place count 60 transition count 491
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 59 transition count 490
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 3 with 2 rules applied. Total rules applied 34 place count 58 transition count 490
Applied a total of 34 rules in 78 ms. Remains 58 /75 variables (removed 17) and now considering 490/546 (removed 56) transitions.
// Phase 1: matrix 490 rows 58 cols
[2022-06-11 01:24:07] [INFO ] Computed 10 place invariants in 4 ms
[2022-06-11 01:24:07] [INFO ] Implicit Places using invariants in 154 ms returned []
// Phase 1: matrix 490 rows 58 cols
[2022-06-11 01:24:07] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 01:24:07] [INFO ] State equation strengthened by 197 read => feed constraints.
[2022-06-11 01:24:07] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
[2022-06-11 01:24:07] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 490 rows 58 cols
[2022-06-11 01:24:07] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:24:08] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/75 places, 490/546 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/75 places, 490/546 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s15 1) (EQ s18 1) (EQ s25 1) (EQ s30 1) (EQ s33 1) (EQ s40 1) (EQ s45 1) (EQ s48 1) (EQ s55 1)), p0:(AND (EQ s1 1) (EQ s9 1) (EQ s44 1) (EQ s5...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-04 finished in 1427 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X(G(p0))))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 546/546 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 71 transition count 510
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 71 transition count 510
Applied a total of 8 rules in 8 ms. Remains 71 /75 variables (removed 4) and now considering 510/546 (removed 36) transitions.
// Phase 1: matrix 510 rows 71 cols
[2022-06-11 01:24:08] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:24:08] [INFO ] Implicit Places using invariants in 238 ms returned []
// Phase 1: matrix 510 rows 71 cols
[2022-06-11 01:24:08] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:24:09] [INFO ] State equation strengthened by 203 read => feed constraints.
[2022-06-11 01:24:09] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
// Phase 1: matrix 510 rows 71 cols
[2022-06-11 01:24:09] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 01:24:09] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 71/75 places, 510/546 transitions.
Finished structural reductions, in 1 iterations. Remains : 71/75 places, 510/546 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s1 0) (EQ s5 0) (EQ s16 0) (EQ s66 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 118 reset in 146 ms.
Product exploration explored 100000 steps with 4 reset in 131 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 522 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1118042 steps, run timeout after 3001 ms. (steps per millisecond=372 ) properties seen :{}
Probabilistic random walk after 1118042 steps, saw 149215 distinct states, run finished after 3001 ms. (steps per millisecond=372 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 510 rows 71 cols
[2022-06-11 01:24:13] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:24:13] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 01:24:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-11 01:24:13] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 01:24:13] [INFO ] State equation strengthened by 203 read => feed constraints.
[2022-06-11 01:24:13] [INFO ] After 81ms SMT Verify possible using 203 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 01:24:13] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2022-06-11 01:24:13] [INFO ] After 495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 71/71 places, 510/510 transitions.
Graph (complete) has 772 edges and 71 vertex of which 70 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 70 transition count 496
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 24 place count 60 transition count 496
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 60 transition count 495
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 59 transition count 495
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 58 transition count 494
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 58 transition count 494
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 34 place count 55 transition count 491
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 42 place count 55 transition count 483
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 114 place count 47 transition count 419
Applied a total of 114 rules in 85 ms. Remains 47 /71 variables (removed 24) and now considering 419/510 (removed 91) transitions.
Finished structural reductions, in 1 iterations. Remains : 47/71 places, 419/510 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 581446 steps, run visited all 1 properties in 1626 ms. (steps per millisecond=357 )
Probabilistic random walk after 581446 steps, saw 75044 distinct states, run finished after 1626 ms. (steps per millisecond=357 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 510/510 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 510/510 (removed 0) transitions.
// Phase 1: matrix 510 rows 71 cols
[2022-06-11 01:24:16] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 01:24:16] [INFO ] Implicit Places using invariants in 225 ms returned []
// Phase 1: matrix 510 rows 71 cols
[2022-06-11 01:24:16] [INFO ] Computed 10 place invariants in 4 ms
[2022-06-11 01:24:16] [INFO ] State equation strengthened by 203 read => feed constraints.
[2022-06-11 01:24:17] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
// Phase 1: matrix 510 rows 71 cols
[2022-06-11 01:24:17] [INFO ] Computed 10 place invariants in 4 ms
[2022-06-11 01:24:17] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 71/71 places, 510/510 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 520 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1127999 steps, run timeout after 3001 ms. (steps per millisecond=375 ) properties seen :{}
Probabilistic random walk after 1127999 steps, saw 150297 distinct states, run finished after 3001 ms. (steps per millisecond=375 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 510 rows 71 cols
[2022-06-11 01:24:21] [INFO ] Computed 10 place invariants in 5 ms
[2022-06-11 01:24:21] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 01:24:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-11 01:24:21] [INFO ] After 210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 01:24:21] [INFO ] State equation strengthened by 203 read => feed constraints.
[2022-06-11 01:24:21] [INFO ] After 81ms SMT Verify possible using 203 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 01:24:21] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2022-06-11 01:24:21] [INFO ] After 464ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 71/71 places, 510/510 transitions.
Graph (complete) has 772 edges and 71 vertex of which 70 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 70 transition count 496
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 24 place count 60 transition count 496
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 60 transition count 495
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 59 transition count 495
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 58 transition count 494
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 58 transition count 494
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 34 place count 55 transition count 491
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 42 place count 55 transition count 483
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 114 place count 47 transition count 419
Applied a total of 114 rules in 68 ms. Remains 47 /71 variables (removed 24) and now considering 419/510 (removed 91) transitions.
Finished structural reductions, in 1 iterations. Remains : 47/71 places, 419/510 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 581446 steps, run visited all 1 properties in 1313 ms. (steps per millisecond=442 )
Probabilistic random walk after 581446 steps, saw 75044 distinct states, run finished after 1313 ms. (steps per millisecond=442 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 163 reset in 107 ms.
Product exploration explored 100000 steps with 201 reset in 143 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 510/510 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 71 transition count 510
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 71 transition count 512
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 71 transition count 512
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 13 place count 71 transition count 512
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 70 transition count 511
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 70 transition count 511
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 13 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 70 transition count 514
Deduced a syphon composed of 13 places in 0 ms
Applied a total of 16 rules in 71 ms. Remains 70 /71 variables (removed 1) and now considering 514/510 (removed -4) transitions.
[2022-06-11 01:24:24] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 514 rows 70 cols
[2022-06-11 01:24:24] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 01:24:24] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/71 places, 514/510 transitions.
Finished structural reductions, in 1 iterations. Remains : 70/71 places, 514/510 transitions.
Product exploration explored 100000 steps with 250 reset in 169 ms.
Product exploration explored 100000 steps with 797 reset in 245 ms.
Built C files in :
/tmp/ltsmin8716522544556848721
[2022-06-11 01:24:25] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8716522544556848721
Running compilation step : cd /tmp/ltsmin8716522544556848721;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2133 ms.
Running link step : cd /tmp/ltsmin8716522544556848721;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin8716522544556848721;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15768715701379062375.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 510/510 transitions.
Applied a total of 0 rules in 4 ms. Remains 71 /71 variables (removed 0) and now considering 510/510 (removed 0) transitions.
// Phase 1: matrix 510 rows 71 cols
[2022-06-11 01:24:40] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:24:40] [INFO ] Implicit Places using invariants in 232 ms returned []
// Phase 1: matrix 510 rows 71 cols
[2022-06-11 01:24:40] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 01:24:40] [INFO ] State equation strengthened by 203 read => feed constraints.
[2022-06-11 01:24:41] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
// Phase 1: matrix 510 rows 71 cols
[2022-06-11 01:24:41] [INFO ] Computed 10 place invariants in 4 ms
[2022-06-11 01:24:41] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 71/71 places, 510/510 transitions.
Built C files in :
/tmp/ltsmin7330422152204839709
[2022-06-11 01:24:41] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7330422152204839709
Running compilation step : cd /tmp/ltsmin7330422152204839709;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2175 ms.
Running link step : cd /tmp/ltsmin7330422152204839709;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7330422152204839709;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11405176277026321651.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 01:24:57] [INFO ] Flatten gal took : 76 ms
[2022-06-11 01:24:57] [INFO ] Flatten gal took : 95 ms
[2022-06-11 01:24:57] [INFO ] Time to serialize gal into /tmp/LTL16403576185646563088.gal : 15 ms
[2022-06-11 01:24:57] [INFO ] Time to serialize properties into /tmp/LTL6272866503389800538.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16403576185646563088.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6272866503389800538.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1640357...267
Read 1 LTL properties
Checking formula 0 : !((G(X(X(X(G("(((p1==0)||(p5==0))||((p16==0)||(p73==0)))")))))))
Formula 0 simplified : !GXXXG"(((p1==0)||(p5==0))||((p16==0)||(p73==0)))"
Detected timeout of ITS tools.
[2022-06-11 01:25:12] [INFO ] Flatten gal took : 66 ms
[2022-06-11 01:25:12] [INFO ] Applying decomposition
[2022-06-11 01:25:12] [INFO ] Flatten gal took : 58 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10064602646623707710.txt' '-o' '/tmp/graph10064602646623707710.bin' '-w' '/tmp/graph10064602646623707710.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10064602646623707710.bin' '-l' '-1' '-v' '-w' '/tmp/graph10064602646623707710.weights' '-q' '0' '-e' '0.001'
[2022-06-11 01:25:12] [INFO ] Decomposing Gal with order
[2022-06-11 01:25:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 01:25:13] [INFO ] Removed a total of 2855 redundant transitions.
[2022-06-11 01:25:13] [INFO ] Flatten gal took : 318 ms
[2022-06-11 01:25:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 54 ms.
[2022-06-11 01:25:13] [INFO ] Time to serialize gal into /tmp/LTL13853166107531647958.gal : 9 ms
[2022-06-11 01:25:13] [INFO ] Time to serialize properties into /tmp/LTL266835217970357246.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13853166107531647958.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL266835217970357246.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1385316...245
Read 1 LTL properties
Checking formula 0 : !((G(X(X(X(G("(((u0.p1==0)||(u0.p5==0))||((i5.u2.p16==0)||(u0.p73==0)))")))))))
Formula 0 simplified : !GXXXG"(((u0.p1==0)||(u0.p5==0))||((i5.u2.p16==0)||(u0.p73==0)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin815592790616143295
[2022-06-11 01:25:28] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin815592790616143295
Running compilation step : cd /tmp/ltsmin815592790616143295;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1907 ms.
Running link step : cd /tmp/ltsmin815592790616143295;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin815592790616143295;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(X(X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutonomousCar-PT-08a-LTLFireability-06 finished in 94853 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||(G(p3)&&p2)||p0)))'
Support contains 15 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 546/546 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 72 transition count 519
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 72 transition count 519
Applied a total of 6 rules in 7 ms. Remains 72 /75 variables (removed 3) and now considering 519/546 (removed 27) transitions.
// Phase 1: matrix 519 rows 72 cols
[2022-06-11 01:25:43] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:25:43] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 519 rows 72 cols
[2022-06-11 01:25:43] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:25:43] [INFO ] State equation strengthened by 211 read => feed constraints.
[2022-06-11 01:25:43] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
// Phase 1: matrix 519 rows 72 cols
[2022-06-11 01:25:43] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 01:25:44] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 72/75 places, 519/546 transitions.
Finished structural reductions, in 1 iterations. Remains : 72/75 places, 519/546 transitions.
Stuttering acceptance computed with spot in 295 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), true, (NOT p3)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p3 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=p3, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s7 0) (EQ s39 0) (EQ s67 0)), p2:(AND (EQ s1 1) (EQ s6 1) (EQ s20 1) (EQ s67 1)), p3:(OR (EQ s17 0) (EQ s21 0) (EQ s28 0) (EQ s36 0) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 4934 steps with 255 reset in 42 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-07 finished in 1211 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(F(p0)))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 546/546 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 75 transition count 537
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 66 transition count 537
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 18 place count 66 transition count 536
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 20 place count 65 transition count 536
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 60 transition count 491
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 60 transition count 491
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 34 place count 58 transition count 489
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 57 transition count 489
Applied a total of 36 rules in 69 ms. Remains 57 /75 variables (removed 18) and now considering 489/546 (removed 57) transitions.
// Phase 1: matrix 489 rows 57 cols
[2022-06-11 01:25:44] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:25:44] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 489 rows 57 cols
[2022-06-11 01:25:44] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:25:44] [INFO ] State equation strengthened by 197 read => feed constraints.
[2022-06-11 01:25:45] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
[2022-06-11 01:25:45] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 489 rows 57 cols
[2022-06-11 01:25:45] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 01:25:45] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/75 places, 489/546 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/75 places, 489/546 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-08 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:(AND (EQ s1 1) (EQ s6 1) (EQ s41 1) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-08 finished in 1127 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p0)) U p1)))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 546/546 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 75 transition count 537
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 66 transition count 536
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 65 transition count 536
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 20 place count 65 transition count 535
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 22 place count 64 transition count 535
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 26 place count 60 transition count 499
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 60 transition count 499
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 34 place count 58 transition count 497
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 36 place count 57 transition count 497
Applied a total of 36 rules in 64 ms. Remains 57 /75 variables (removed 18) and now considering 497/546 (removed 49) transitions.
// Phase 1: matrix 497 rows 57 cols
[2022-06-11 01:25:45] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:25:45] [INFO ] Implicit Places using invariants in 180 ms returned []
// Phase 1: matrix 497 rows 57 cols
[2022-06-11 01:25:45] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:25:46] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-06-11 01:25:46] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2022-06-11 01:25:46] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 497 rows 57 cols
[2022-06-11 01:25:46] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:25:46] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/75 places, 497/546 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/75 places, 497/546 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s8 1) (EQ s37 1) (EQ s53 1)), p0:(AND (EQ s1 1) (EQ s5 1) (EQ s40 1) (EQ s53 1))], 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]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-09 finished in 1078 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||X(F((G(X(p0))&&p1)))))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 546/546 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 70 transition count 501
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 70 transition count 501
Applied a total of 10 rules in 5 ms. Remains 70 /75 variables (removed 5) and now considering 501/546 (removed 45) transitions.
// Phase 1: matrix 501 rows 70 cols
[2022-06-11 01:25:46] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:25:46] [INFO ] Implicit Places using invariants in 181 ms returned []
// Phase 1: matrix 501 rows 70 cols
[2022-06-11 01:25:46] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:25:47] [INFO ] State equation strengthened by 195 read => feed constraints.
[2022-06-11 01:25:47] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
// Phase 1: matrix 501 rows 70 cols
[2022-06-11 01:25:47] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:25:47] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/75 places, 501/546 transitions.
Finished structural reductions, in 1 iterations. Remains : 70/75 places, 501/546 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s6 0) (EQ s48 0) (EQ s65 0)), p1:(AND (OR (EQ s1 0) (EQ s11 0) (EQ s42 0) (EQ s65 0)) (OR (EQ s1 0) (EQ s6 0) (EQ s48 0) (EQ s65 0)))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 581 reset in 173 ms.
Product exploration explored 100000 steps with 1198 reset in 263 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 p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 288 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 499 resets, run finished after 516 ms. (steps per millisecond=19 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 501 rows 70 cols
[2022-06-11 01:25:49] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 01:25:49] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-06-11 01:25:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-11 01:25:49] [INFO ] After 282ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-06-11 01:25:49] [INFO ] State equation strengthened by 195 read => feed constraints.
[2022-06-11 01:25:49] [INFO ] After 130ms SMT Verify possible using 195 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2022-06-11 01:25:50] [INFO ] After 269ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 110 ms.
[2022-06-11 01:25:50] [INFO ] After 703ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 34 ms.
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 70/70 places, 501/501 transitions.
Graph (complete) has 762 edges and 70 vertex of which 69 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 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 69 transition count 488
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 22 place count 60 transition count 488
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 60 transition count 487
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 59 transition count 487
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 58 transition count 486
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 58 transition count 486
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 32 place count 55 transition count 483
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 55 transition count 475
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 104 place count 47 transition count 419
Applied a total of 104 rules in 67 ms. Remains 47 /70 variables (removed 23) and now considering 419/501 (removed 82) transitions.
Finished structural reductions, in 1 iterations. Remains : 47/70 places, 419/501 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Finished probabilistic random walk after 73691 steps, run visited all 2 properties in 340 ms. (steps per millisecond=216 )
Probabilistic random walk after 73691 steps, saw 11478 distinct states, run finished after 340 ms. (steps per millisecond=216 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 402 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Support contains 6 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 501/501 transitions.
Applied a total of 0 rules in 3 ms. Remains 70 /70 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 70 cols
[2022-06-11 01:25:51] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:25:51] [INFO ] Implicit Places using invariants in 181 ms returned []
// Phase 1: matrix 501 rows 70 cols
[2022-06-11 01:25:51] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:25:51] [INFO ] State equation strengthened by 195 read => feed constraints.
[2022-06-11 01:25:52] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
// Phase 1: matrix 501 rows 70 cols
[2022-06-11 01:25:52] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 01:25:52] [INFO ] Dead Transitions using invariants and state equation in 429 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 70/70 places, 501/501 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 p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 513 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Finished Best-First random walk after 6199 steps, including 20 resets, run visited all 2 properties in 10 ms. (steps per millisecond=619 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 202 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 209 reset in 107 ms.
Product exploration explored 100000 steps with 1 reset in 84 ms.
Built C files in :
/tmp/ltsmin4304503253619027925
[2022-06-11 01:25:53] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4304503253619027925
Running compilation step : cd /tmp/ltsmin4304503253619027925;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1985 ms.
Running link step : cd /tmp/ltsmin4304503253619027925;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4304503253619027925;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15073121622587753568.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 501/501 transitions.
Applied a total of 0 rules in 2 ms. Remains 70 /70 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 70 cols
[2022-06-11 01:26:08] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:26:09] [INFO ] Implicit Places using invariants in 196 ms returned []
// Phase 1: matrix 501 rows 70 cols
[2022-06-11 01:26:09] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:26:09] [INFO ] State equation strengthened by 195 read => feed constraints.
[2022-06-11 01:26:09] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
// Phase 1: matrix 501 rows 70 cols
[2022-06-11 01:26:09] [INFO ] Computed 10 place invariants in 6 ms
[2022-06-11 01:26:09] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 70/70 places, 501/501 transitions.
Built C files in :
/tmp/ltsmin4048005770449962751
[2022-06-11 01:26:10] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4048005770449962751
Running compilation step : cd /tmp/ltsmin4048005770449962751;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2243 ms.
Running link step : cd /tmp/ltsmin4048005770449962751;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4048005770449962751;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2007638178162652041.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 01:26:25] [INFO ] Flatten gal took : 56 ms
[2022-06-11 01:26:25] [INFO ] Flatten gal took : 57 ms
[2022-06-11 01:26:25] [INFO ] Time to serialize gal into /tmp/LTL9860346313948067092.gal : 10 ms
[2022-06-11 01:26:25] [INFO ] Time to serialize properties into /tmp/LTL1660803096657942895.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9860346313948067092.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1660803096657942895.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9860346...266
Read 1 LTL properties
Checking formula 0 : !(((X(G("(((p1==0)||(p6==0))||((p54==0)||(p73==0)))")))||(X(F(((G(X("(((p1==0)||(p6==0))||((p54==0)||(p73==0)))")))&&("(((p1==0)||(p11...239
Formula 0 simplified : !(XG"(((p1==0)||(p6==0))||((p54==0)||(p73==0)))" | XF("(((p1==0)||(p6==0))||((p54==0)||(p73==0)))" & "(((p1==0)||(p11==0))||((p47==0...220
Detected timeout of ITS tools.
[2022-06-11 01:26:40] [INFO ] Flatten gal took : 49 ms
[2022-06-11 01:26:40] [INFO ] Applying decomposition
[2022-06-11 01:26:40] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7320355254303906735.txt' '-o' '/tmp/graph7320355254303906735.bin' '-w' '/tmp/graph7320355254303906735.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7320355254303906735.bin' '-l' '-1' '-v' '-w' '/tmp/graph7320355254303906735.weights' '-q' '0' '-e' '0.001'
[2022-06-11 01:26:40] [INFO ] Decomposing Gal with order
[2022-06-11 01:26:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 01:26:40] [INFO ] Removed a total of 2840 redundant transitions.
[2022-06-11 01:26:40] [INFO ] Flatten gal took : 130 ms
[2022-06-11 01:26:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 35 ms.
[2022-06-11 01:26:40] [INFO ] Time to serialize gal into /tmp/LTL17216438667352217421.gal : 4 ms
[2022-06-11 01:26:40] [INFO ] Time to serialize properties into /tmp/LTL335377991190382682.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17216438667352217421.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL335377991190382682.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1721643...245
Read 1 LTL properties
Checking formula 0 : !(((X(G("(((u25.p1==0)||(u25.p6==0))||((i8.u19.p54==0)||(u25.p73==0)))")))||(X(F(((G(X("(((u25.p1==0)||(u25.p6==0))||((i8.u19.p54==0)|...315
Formula 0 simplified : !(XG"(((u25.p1==0)||(u25.p6==0))||((i8.u19.p54==0)||(u25.p73==0)))" | XF("(((u25.p1==0)||(u25.p6==0))||((i8.u19.p54==0)||(u25.p73==0...296
Reverse transition relation is NOT exact ! Due to transitions t279, t280, t281, t282, t283, t284, t285, t286, t287, t288, t289, t290, t291, t292, t293, t29...1939
Computing Next relation with stutter on 117826 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6406640090802820956
[2022-06-11 01:26:55] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6406640090802820956
Running compilation step : cd /tmp/ltsmin6406640090802820956;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1921 ms.
Running link step : cd /tmp/ltsmin6406640090802820956;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6406640090802820956;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X([]((LTLAPp0==true)))||X(<>(([](X((LTLAPp0==true)))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutonomousCar-PT-08a-LTLFireability-10 finished in 84282 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(F((G(X(p0))&&X(p1)))))||p0)))'
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 546/546 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 75 transition count 538
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 67 transition count 538
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 67 transition count 537
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 18 place count 66 transition count 537
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 61 transition count 492
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 61 transition count 492
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 32 place count 59 transition count 490
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 58 transition count 490
Applied a total of 34 rules in 58 ms. Remains 58 /75 variables (removed 17) and now considering 490/546 (removed 56) transitions.
// Phase 1: matrix 490 rows 58 cols
[2022-06-11 01:27:11] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 01:27:11] [INFO ] Implicit Places using invariants in 190 ms returned []
// Phase 1: matrix 490 rows 58 cols
[2022-06-11 01:27:11] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:27:11] [INFO ] State equation strengthened by 197 read => feed constraints.
[2022-06-11 01:27:11] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2022-06-11 01:27:11] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 490 rows 58 cols
[2022-06-11 01:27:11] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:27:12] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/75 places, 490/546 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/75 places, 490/546 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s43 1), p1:(AND (EQ s1 1) (EQ s8 1) (EQ s11 1) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-14 finished in 1158 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((F(G((p0 U p1)))&&X(p2))))))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 546/546 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 75 transition count 539
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 68 transition count 537
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 66 transition count 537
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 18 place count 66 transition count 536
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 20 place count 65 transition count 536
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 25 place count 60 transition count 491
Iterating global reduction 3 with 5 rules applied. Total rules applied 30 place count 60 transition count 491
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 34 place count 58 transition count 489
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 36 place count 57 transition count 489
Applied a total of 36 rules in 58 ms. Remains 57 /75 variables (removed 18) and now considering 489/546 (removed 57) transitions.
// Phase 1: matrix 489 rows 57 cols
[2022-06-11 01:27:12] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:27:12] [INFO ] Implicit Places using invariants in 189 ms returned []
// Phase 1: matrix 489 rows 57 cols
[2022-06-11 01:27:12] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:27:12] [INFO ] State equation strengthened by 197 read => feed constraints.
[2022-06-11 01:27:12] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
[2022-06-11 01:27:12] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 489 rows 57 cols
[2022-06-11 01:27:12] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 01:27:13] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/75 places, 489/546 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/75 places, 489/546 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=0 dest: 2}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s29 1), p1:(EQ s50 1), p0:(AND (EQ s1 1) (EQ s10 1) (EQ s31 1) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-15 finished in 1102 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X(G(p0))))))'
Found a SL insensitive property : AutonomousCar-PT-08a-LTLFireability-06
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 75/75 places, 546/546 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 75 transition count 536
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 65 transition count 536
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 65 transition count 535
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 22 place count 64 transition count 535
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 26 place count 60 transition count 499
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 60 transition count 499
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 34 place count 58 transition count 497
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 57 transition count 497
Applied a total of 36 rules in 38 ms. Remains 57 /75 variables (removed 18) and now considering 497/546 (removed 49) transitions.
// Phase 1: matrix 497 rows 57 cols
[2022-06-11 01:27:13] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:27:13] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 497 rows 57 cols
[2022-06-11 01:27:13] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 01:27:13] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-06-11 01:27:14] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
// Phase 1: matrix 497 rows 57 cols
[2022-06-11 01:27:14] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 01:27:14] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 57/75 places, 497/546 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/75 places, 497/546 transitions.
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s1 0) (EQ s4 0) (EQ s14 0) (EQ s53 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 309 reset in 113 ms.
Product exploration explored 100000 steps with 1069 reset in 235 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 672 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1215857 steps, run timeout after 3001 ms. (steps per millisecond=405 ) properties seen :{}
Probabilistic random walk after 1215857 steps, saw 148474 distinct states, run finished after 3001 ms. (steps per millisecond=405 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 497 rows 57 cols
[2022-06-11 01:27:18] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:27:18] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 01:27:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-11 01:27:18] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 01:27:18] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-06-11 01:27:18] [INFO ] After 79ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 01:27:18] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2022-06-11 01:27:18] [INFO ] After 457ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 57/57 places, 497/497 transitions.
Graph (complete) has 762 edges and 57 vertex of which 56 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 56 transition count 494
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 11 place count 56 transition count 486
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 83 place count 48 transition count 422
Applied a total of 83 rules in 49 ms. Remains 48 /57 variables (removed 9) and now considering 422/497 (removed 75) transitions.
Finished structural reductions, in 1 iterations. Remains : 48/57 places, 422/497 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1098516 steps, run visited all 1 properties in 2471 ms. (steps per millisecond=444 )
Probabilistic random walk after 1098516 steps, saw 141025 distinct states, run finished after 2472 ms. (steps per millisecond=444 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 267 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 497/497 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 57 cols
[2022-06-11 01:27:21] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:27:21] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 497 rows 57 cols
[2022-06-11 01:27:21] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:27:22] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-06-11 01:27:22] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
// Phase 1: matrix 497 rows 57 cols
[2022-06-11 01:27:22] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:27:22] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 497/497 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 678 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1246647 steps, run timeout after 3001 ms. (steps per millisecond=415 ) properties seen :{}
Probabilistic random walk after 1246647 steps, saw 152318 distinct states, run finished after 3001 ms. (steps per millisecond=415 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 497 rows 57 cols
[2022-06-11 01:27:26] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:27:26] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 01:27:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-11 01:27:26] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 01:27:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-06-11 01:27:26] [INFO ] After 77ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 01:27:26] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2022-06-11 01:27:26] [INFO ] After 432ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 57/57 places, 497/497 transitions.
Graph (complete) has 762 edges and 57 vertex of which 56 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 56 transition count 494
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 11 place count 56 transition count 486
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 83 place count 48 transition count 422
Applied a total of 83 rules in 49 ms. Remains 48 /57 variables (removed 9) and now considering 422/497 (removed 75) transitions.
Finished structural reductions, in 1 iterations. Remains : 48/57 places, 422/497 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1098516 steps, run visited all 1 properties in 2474 ms. (steps per millisecond=444 )
Probabilistic random walk after 1098516 steps, saw 141025 distinct states, run finished after 2474 ms. (steps per millisecond=444 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 395 reset in 125 ms.
Product exploration explored 100000 steps with 48 reset in 89 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 497/497 transitions.
Applied a total of 0 rules in 33 ms. Remains 57 /57 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2022-06-11 01:27:30] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 497 rows 57 cols
[2022-06-11 01:27:30] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 01:27:30] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 497/497 transitions.
Product exploration explored 100000 steps with 132 reset in 97 ms.
Product exploration explored 100000 steps with 218 reset in 117 ms.
Built C files in :
/tmp/ltsmin15318683368342855814
[2022-06-11 01:27:30] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15318683368342855814
Running compilation step : cd /tmp/ltsmin15318683368342855814;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2002 ms.
Running link step : cd /tmp/ltsmin15318683368342855814;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin15318683368342855814;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1211940452004202476.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 497/497 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 57 cols
[2022-06-11 01:27:45] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:27:46] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 497 rows 57 cols
[2022-06-11 01:27:46] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:27:46] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-06-11 01:27:46] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
// Phase 1: matrix 497 rows 57 cols
[2022-06-11 01:27:46] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:27:46] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 497/497 transitions.
Built C files in :
/tmp/ltsmin18110071390957462503
[2022-06-11 01:27:46] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18110071390957462503
Running compilation step : cd /tmp/ltsmin18110071390957462503;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1904 ms.
Running link step : cd /tmp/ltsmin18110071390957462503;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin18110071390957462503;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5912268463599263038.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 01:28:02] [INFO ] Flatten gal took : 63 ms
[2022-06-11 01:28:02] [INFO ] Flatten gal took : 59 ms
[2022-06-11 01:28:02] [INFO ] Time to serialize gal into /tmp/LTL15989346109064268395.gal : 10 ms
[2022-06-11 01:28:02] [INFO ] Time to serialize properties into /tmp/LTL12530605650352355319.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15989346109064268395.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12530605650352355319.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1598934...268
Read 1 LTL properties
Checking formula 0 : !((G(X(X(X(G("(((p1==0)||(p5==0))||((p16==0)||(p73==0)))")))))))
Formula 0 simplified : !GXXXG"(((p1==0)||(p5==0))||((p16==0)||(p73==0)))"
Detected timeout of ITS tools.
[2022-06-11 01:28:17] [INFO ] Flatten gal took : 54 ms
[2022-06-11 01:28:17] [INFO ] Applying decomposition
[2022-06-11 01:28:17] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12457755574975110531.txt' '-o' '/tmp/graph12457755574975110531.bin' '-w' '/tmp/graph12457755574975110531.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12457755574975110531.bin' '-l' '-1' '-v' '-w' '/tmp/graph12457755574975110531.weights' '-q' '0' '-e' '0.001'
[2022-06-11 01:28:17] [INFO ] Decomposing Gal with order
[2022-06-11 01:28:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 01:28:17] [INFO ] Removed a total of 2656 redundant transitions.
[2022-06-11 01:28:17] [INFO ] Flatten gal took : 104 ms
[2022-06-11 01:28:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 18 ms.
[2022-06-11 01:28:17] [INFO ] Time to serialize gal into /tmp/LTL15196765470871139192.gal : 2 ms
[2022-06-11 01:28:17] [INFO ] Time to serialize properties into /tmp/LTL12455029169938340578.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15196765470871139192.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12455029169938340578.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1519676...247
Read 1 LTL properties
Checking formula 0 : !((G(X(X(X(G("(((i9.u16.p1==0)||(i9.u16.p5==0))||((u0.p16==0)||(i9.u16.p73==0)))")))))))
Formula 0 simplified : !GXXXG"(((i9.u16.p1==0)||(i9.u16.p5==0))||((u0.p16==0)||(i9.u16.p73==0)))"
Reverse transition relation is NOT exact ! Due to transitions t287, t289, t291, t293, t303, t305, t307, t309, t319, t321, t323, t325, t335, t337, t339, t34...779
Computing Next relation with stutter on 117826 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
454 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.57606,145716,1,0,237938,2248,4702,752748,402,20371,401060
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property AutonomousCar-PT-08a-LTLFireability-06 finished in 69638 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-06 FALSE TECHNIQUES SL_INSENSITIVE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||X(F((G(X(p0))&&p1)))))'
Found a SL insensitive property : AutonomousCar-PT-08a-LTLFireability-10
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 75/75 places, 546/546 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 75 transition count 538
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 67 transition count 538
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 67 transition count 537
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 18 place count 66 transition count 537
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 61 transition count 492
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 61 transition count 492
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 32 place count 59 transition count 490
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 58 transition count 490
Applied a total of 34 rules in 32 ms. Remains 58 /75 variables (removed 17) and now considering 490/546 (removed 56) transitions.
// Phase 1: matrix 490 rows 58 cols
[2022-06-11 01:28:23] [INFO ] Computed 10 place invariants in 4 ms
[2022-06-11 01:28:23] [INFO ] Implicit Places using invariants in 179 ms returned []
// Phase 1: matrix 490 rows 58 cols
[2022-06-11 01:28:23] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:28:23] [INFO ] State equation strengthened by 197 read => feed constraints.
[2022-06-11 01:28:23] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
// Phase 1: matrix 490 rows 58 cols
[2022-06-11 01:28:23] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:28:24] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 58/75 places, 490/546 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/75 places, 490/546 transitions.
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s5 0) (EQ s42 0) (EQ s54 0)), p1:(AND (OR (EQ s1 0) (EQ s10 0) (EQ s36 0) (EQ s54 0)) (OR (EQ s1 0) (EQ s5 0) (EQ s42 0) (EQ s54 0)))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 87 reset in 105 ms.
Product exploration explored 100000 steps with 374 reset in 144 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 p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 273 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 629 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1092429 steps, run timeout after 3001 ms. (steps per millisecond=364 ) properties seen :{0=1, 2=1, 3=1}
Probabilistic random walk after 1092429 steps, saw 132999 distinct states, run finished after 3001 ms. (steps per millisecond=364 ) properties seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 490 rows 58 cols
[2022-06-11 01:28:28] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 01:28:28] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 364 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 490/490 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 490/490 (removed 0) transitions.
// Phase 1: matrix 490 rows 58 cols
[2022-06-11 01:28:28] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:28:29] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 490 rows 58 cols
[2022-06-11 01:28:29] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:28:29] [INFO ] State equation strengthened by 197 read => feed constraints.
[2022-06-11 01:28:29] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
// Phase 1: matrix 490 rows 58 cols
[2022-06-11 01:28:29] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:28:29] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 490/490 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 p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 662 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 490 rows 58 cols
[2022-06-11 01:28:30] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 01:28:30] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 01:28:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-11 01:28:30] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 01:28:30] [INFO ] State equation strengthened by 197 read => feed constraints.
[2022-06-11 01:28:30] [INFO ] After 72ms SMT Verify possible using 197 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 01:28:30] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2022-06-11 01:28:31] [INFO ] After 420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 58/58 places, 490/490 transitions.
Graph (complete) has 754 edges and 58 vertex of which 57 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 57 transition count 486
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 56 transition count 486
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 13 place count 56 transition count 478
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 77 place count 48 transition count 422
Applied a total of 77 rules in 51 ms. Remains 48 /58 variables (removed 10) and now considering 422/490 (removed 68) transitions.
Finished structural reductions, in 1 iterations. Remains : 48/58 places, 422/490 transitions.
Incomplete random walk after 10000 steps, including 107 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1112429 steps, run visited all 1 properties in 2511 ms. (steps per millisecond=443 )
Probabilistic random walk after 1112429 steps, saw 143564 distinct states, run finished after 2511 ms. (steps per millisecond=443 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 193 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 85 reset in 86 ms.
Product exploration explored 100000 steps with 814 reset in 192 ms.
Built C files in :
/tmp/ltsmin14257487297922723373
[2022-06-11 01:28:34] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14257487297922723373
Running compilation step : cd /tmp/ltsmin14257487297922723373;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1924 ms.
Running link step : cd /tmp/ltsmin14257487297922723373;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14257487297922723373;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2976339443241963144.hoa' '--buchi-type=spotba'
LTSmin run took 4425 ms.
Treatment of property AutonomousCar-PT-08a-LTLFireability-10 finished in 18145 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-10 FALSE TECHNIQUES SL_INSENSITIVE
[2022-06-11 01:28:41] [INFO ] Flatten gal took : 46 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 328491 ms.

BK_STOP 1654910921308

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-08a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-08a, 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 r294-smll-165463873100524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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