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-165463873100539.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-09a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463873100539
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K Jun 7 15:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Jun 7 15:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 7 15:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 7 15:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 3 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 3 16:20 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 11K Jun 7 15:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Jun 7 15:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 7 15:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Jun 7 15:50 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 781K 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-09a-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1654918735836

Running Version 202205111006
[2022-06-11 03:38:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 03:38:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 03:38:59] [INFO ] Load time of PNML (sax parser for PT used): 484 ms
[2022-06-11 03:38:59] [INFO ] Transformed 89 places.
[2022-06-11 03:38:59] [INFO ] Transformed 1249 transitions.
[2022-06-11 03:38:59] [INFO ] Found NUPN structural information;
[2022-06-11 03:38:59] [INFO ] Parsed PT model containing 89 places and 1249 transitions in 756 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 81 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 345 transitions
Reduce redundant transitions removed 345 transitions.
FORMULA AutonomousCar-PT-09a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 904/904 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 86 transition count 874
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 86 transition count 874
Applied a total of 6 rules in 54 ms. Remains 86 /89 variables (removed 3) and now considering 874/904 (removed 30) transitions.
[2022-06-11 03:38:59] [INFO ] Flow matrix only has 873 transitions (discarded 1 similar events)
// Phase 1: matrix 873 rows 86 cols
[2022-06-11 03:38:59] [INFO ] Computed 14 place invariants in 31 ms
[2022-06-11 03:39:00] [INFO ] Implicit Places using invariants in 1354 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1408 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 85/89 places, 874/904 transitions.
Applied a total of 0 rules in 17 ms. Remains 85 /85 variables (removed 0) and now considering 874/874 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 85/89 places, 874/904 transitions.
Support contains 38 out of 85 places after structural reductions.
[2022-06-11 03:39:01] [INFO ] Flatten gal took : 575 ms
[2022-06-11 03:39:02] [INFO ] Flatten gal took : 278 ms
[2022-06-11 03:39:02] [INFO ] Input system was already deterministic with 874 transitions.
Support contains 37 out of 85 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 492 resets, run finished after 945 ms. (steps per millisecond=10 ) properties (out of 24) seen :18
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :3
Running SMT prover for 3 properties.
[2022-06-11 03:39:03] [INFO ] Flow matrix only has 873 transitions (discarded 1 similar events)
// Phase 1: matrix 873 rows 85 cols
[2022-06-11 03:39:03] [INFO ] Computed 13 place invariants in 11 ms
[2022-06-11 03:39:04] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-11 03:39:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-06-11 03:39:04] [INFO ] After 522ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2022-06-11 03:39:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 03:39:04] [INFO ] After 70ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2022-06-11 03:39:04] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 162 ms.
[2022-06-11 03:39:04] [INFO ] After 957ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 874/874 transitions.
Graph (complete) has 980 edges and 85 vertex of which 83 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.28 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 12 rules applied. Total rules applied 13 place count 83 transition count 860
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 23 place count 73 transition count 860
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 23 place count 73 transition count 859
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 25 place count 72 transition count 859
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 31 place count 66 transition count 799
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 66 transition count 799
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 41 place count 64 transition count 797
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 50 place count 64 transition count 788
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 140 place count 55 transition count 707
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 141 place count 55 transition count 707
Applied a total of 141 rules in 391 ms. Remains 55 /85 variables (removed 30) and now considering 707/874 (removed 167) transitions.
Finished structural reductions, in 1 iterations. Remains : 55/85 places, 707/874 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Finished Best-First random walk after 778 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=194 )
FORMULA AutonomousCar-PT-09a-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutonomousCar-PT-09a-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutonomousCar-PT-09a-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Computed a total of 2 stabilizing places and 2 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p0 U X(p1)))||(p2 U p1))))'
Support contains 6 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 874/874 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 78 transition count 813
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 78 transition count 813
Applied a total of 14 rules in 13 ms. Remains 78 /85 variables (removed 7) and now considering 813/874 (removed 61) transitions.
// Phase 1: matrix 813 rows 78 cols
[2022-06-11 03:39:05] [INFO ] Computed 12 place invariants in 8 ms
[2022-06-11 03:39:06] [INFO ] Implicit Places using invariants in 375 ms returned []
// Phase 1: matrix 813 rows 78 cols
[2022-06-11 03:39:06] [INFO ] Computed 12 place invariants in 8 ms
[2022-06-11 03:39:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 03:39:07] [INFO ] Implicit Places using invariants and state equation in 741 ms returned [74, 76]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1125 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/85 places, 813/874 transitions.
Applied a total of 0 rules in 6 ms. Remains 76 /76 variables (removed 0) and now considering 813/813 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 76/85 places, 813/874 transitions.
Stuttering acceptance computed with spot in 578 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : AutonomousCar-PT-09a-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=2 dest: 1}, { cond=(OR p1 p2), acceptance={} source=2 dest: 2}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s65 0) (EQ s34 1)), p1:(OR (EQ s73 0) (EQ s36 1)), p2:(OR (EQ s17 0) (EQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 141 reset in 351 ms.
Product exploration explored 100000 steps with 39 reset in 179 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (OR p1 p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (OR p1 p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 1853 ms. Reduced automaton from 7 states, 19 edges and 3 AP to 7 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 361 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 485 resets, run finished after 729 ms. (steps per millisecond=13 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 41 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 40 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 813 rows 76 cols
[2022-06-11 03:39:11] [INFO ] Computed 10 place invariants in 8 ms
[2022-06-11 03:39:11] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-11 03:39:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-11 03:39:12] [INFO ] After 916ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-06-11 03:39:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 03:39:13] [INFO ] After 932ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2022-06-11 03:39:15] [INFO ] After 2105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 946 ms.
[2022-06-11 03:39:16] [INFO ] After 4139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 618 ms.
Support contains 6 out of 76 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 76/76 places, 813/813 transitions.
Graph (complete) has 904 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 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 11 rules applied. Total rules applied 12 place count 75 transition count 801
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 21 place count 67 transition count 800
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 66 transition count 800
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 22 place count 66 transition count 799
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 24 place count 65 transition count 799
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 3 with 4 rules applied. Total rules applied 28 place count 63 transition count 797
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 36 place count 63 transition count 789
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 71 rules applied. Total rules applied 107 place count 55 transition count 726
Applied a total of 107 rules in 277 ms. Remains 55 /76 variables (removed 21) and now considering 726/813 (removed 87) transitions.
Finished structural reductions, in 1 iterations. Remains : 55/76 places, 726/813 transitions.
Incomplete random walk after 10000 steps, including 10 resets, run finished after 521 ms. (steps per millisecond=19 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :1
Finished Best-First random walk after 2011 steps, including 5 resets, run visited all 1 properties in 5 ms. (steps per millisecond=402 )
Knowledge obtained : [(AND p0 p1 p2), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (OR p1 p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (OR p1 p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(F (NOT (OR (AND p0 p1) (AND p0 p2)))), (F (NOT (OR p1 p2))), (F (AND (NOT p1) p2)), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 26 factoid took 1938 ms. Reduced automaton from 7 states, 19 edges and 3 AP to 7 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 446 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 6 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 813/813 transitions.
Applied a total of 0 rules in 9 ms. Remains 76 /76 variables (removed 0) and now considering 813/813 (removed 0) transitions.
// Phase 1: matrix 813 rows 76 cols
[2022-06-11 03:39:20] [INFO ] Computed 10 place invariants in 6 ms
[2022-06-11 03:39:20] [INFO ] Implicit Places using invariants in 443 ms returned []
// Phase 1: matrix 813 rows 76 cols
[2022-06-11 03:39:20] [INFO ] Computed 10 place invariants in 9 ms
[2022-06-11 03:39:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 03:39:21] [INFO ] Implicit Places using invariants and state equation in 701 ms returned []
Implicit Place search using SMT with State Equation took 1156 ms to find 0 implicit places.
// Phase 1: matrix 813 rows 76 cols
[2022-06-11 03:39:21] [INFO ] Computed 10 place invariants in 5 ms
[2022-06-11 03:39:21] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 76/76 places, 813/813 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (OR p1 p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (OR p1 p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 1466 ms. Reduced automaton from 7 states, 19 edges and 3 AP to 7 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 257 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 464 resets, run finished after 695 ms. (steps per millisecond=14 ) properties (out of 12) seen :6
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :3
Running SMT prover for 3 properties.
// Phase 1: matrix 813 rows 76 cols
[2022-06-11 03:39:24] [INFO ] Computed 10 place invariants in 6 ms
[2022-06-11 03:39:24] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-11 03:39:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-11 03:39:25] [INFO ] After 533ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-11 03:39:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 03:39:25] [INFO ] After 249ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-11 03:39:26] [INFO ] After 585ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 234 ms.
[2022-06-11 03:39:26] [INFO ] After 1416ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 95 ms.
Support contains 6 out of 76 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 76/76 places, 813/813 transitions.
Graph (complete) has 904 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 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 11 rules applied. Total rules applied 12 place count 75 transition count 801
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 21 place count 67 transition count 800
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 66 transition count 800
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 22 place count 66 transition count 799
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 24 place count 65 transition count 799
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 3 with 4 rules applied. Total rules applied 28 place count 63 transition count 797
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 36 place count 63 transition count 789
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 71 rules applied. Total rules applied 107 place count 55 transition count 726
Applied a total of 107 rules in 149 ms. Remains 55 /76 variables (removed 21) and now considering 726/813 (removed 87) transitions.
Finished structural reductions, in 1 iterations. Remains : 55/76 places, 726/813 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :2
Finished Best-First random walk after 1110 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=370 )
Knowledge obtained : [(AND p0 p1 p2), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (OR p1 p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (OR p1 p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(F (NOT (OR (AND p0 p1) (AND p0 p2)))), (F (NOT (OR p1 p2))), (F (AND (NOT p1) p2)), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 26 factoid took 2037 ms. Reduced automaton from 7 states, 19 edges and 3 AP to 7 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 302 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 297 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 357 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 623 reset in 442 ms.
Product exploration explored 100000 steps with 683 reset in 361 ms.
Applying partial POR strategy [false, true, false, true, false, false, true]
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 6 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 813/813 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 76 transition count 813
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 76 transition count 813
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 75 transition count 812
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 75 transition count 812
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 11 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 75 transition count 814
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 14 rules in 165 ms. Remains 75 /76 variables (removed 1) and now considering 814/813 (removed -1) transitions.
[2022-06-11 03:39:31] [INFO ] Redundant transitions in 90 ms returned []
// Phase 1: matrix 814 rows 75 cols
[2022-06-11 03:39:31] [INFO ] Computed 10 place invariants in 5 ms
[2022-06-11 03:39:32] [INFO ] Dead Transitions using invariants and state equation in 614 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/76 places, 814/813 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/76 places, 814/813 transitions.
Product exploration explored 100000 steps with 427 reset in 202 ms.
Product exploration explored 100000 steps with 1661 reset in 461 ms.
Built C files in :
/tmp/ltsmin2555528439077700083
[2022-06-11 03:39:32] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2555528439077700083
Running compilation step : cd /tmp/ltsmin2555528439077700083;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2555528439077700083;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2555528439077700083;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 6 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 813/813 transitions.
Applied a total of 0 rules in 5 ms. Remains 76 /76 variables (removed 0) and now considering 813/813 (removed 0) transitions.
// Phase 1: matrix 813 rows 76 cols
[2022-06-11 03:39:36] [INFO ] Computed 10 place invariants in 6 ms
[2022-06-11 03:39:36] [INFO ] Implicit Places using invariants in 351 ms returned []
// Phase 1: matrix 813 rows 76 cols
[2022-06-11 03:39:36] [INFO ] Computed 10 place invariants in 6 ms
[2022-06-11 03:39:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 03:39:36] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
// Phase 1: matrix 813 rows 76 cols
[2022-06-11 03:39:36] [INFO ] Computed 10 place invariants in 5 ms
[2022-06-11 03:39:37] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 76/76 places, 813/813 transitions.
Built C files in :
/tmp/ltsmin7490501815686379221
[2022-06-11 03:39:37] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7490501815686379221
Running compilation step : cd /tmp/ltsmin7490501815686379221;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7490501815686379221;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7490501815686379221;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-11 03:39:40] [INFO ] Flatten gal took : 130 ms
[2022-06-11 03:39:41] [INFO ] Flatten gal took : 110 ms
[2022-06-11 03:39:41] [INFO ] Time to serialize gal into /tmp/LTL263131328805468043.gal : 24 ms
[2022-06-11 03:39:41] [INFO ] Time to serialize properties into /tmp/LTL8320783999004973340.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/LTL263131328805468043.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8320783999004973340.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/LTL2631313...265
Read 1 LTL properties
Checking formula 0 : !((G((G(("((p75==0)||(p39==1))")U(X("((p83==0)||(p41==1))"))))||(("((p19==0)||(p88==1))")U("((p83==0)||(p41==1))")))))
Formula 0 simplified : !G(G("((p75==0)||(p39==1))" U X"((p83==0)||(p41==1))") | ("((p19==0)||(p88==1))" U "((p83==0)||(p41==1))"))
Detected timeout of ITS tools.
[2022-06-11 03:39:56] [INFO ] Flatten gal took : 100 ms
[2022-06-11 03:39:56] [INFO ] Applying decomposition
[2022-06-11 03:39:56] [INFO ] Flatten gal took : 98 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/graph7161258154135422768.txt' '-o' '/tmp/graph7161258154135422768.bin' '-w' '/tmp/graph7161258154135422768.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7161258154135422768.bin' '-l' '-1' '-v' '-w' '/tmp/graph7161258154135422768.weights' '-q' '0' '-e' '0.001'
[2022-06-11 03:39:56] [INFO ] Decomposing Gal with order
[2022-06-11 03:39:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 03:39:57] [INFO ] Removed a total of 6064 redundant transitions.
[2022-06-11 03:39:57] [INFO ] Flatten gal took : 698 ms
[2022-06-11 03:39:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 65 ms.
[2022-06-11 03:39:57] [INFO ] Time to serialize gal into /tmp/LTL9040819990906160704.gal : 11 ms
[2022-06-11 03:39:57] [INFO ] Time to serialize properties into /tmp/LTL5166236891846816634.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/LTL9040819990906160704.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5166236891846816634.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/LTL9040819...245
Read 1 LTL properties
Checking formula 0 : !((G((G(("((u17.p75==0)||(u7.p39==1))")U(X("((i10.u21.p83==0)||(u9.p41==1))"))))||(("((u1.p19==0)||(i10.u18.p88==1))")U("((i10.u21.p83...179
Formula 0 simplified : !G(G("((u17.p75==0)||(u7.p39==1))" U X"((i10.u21.p83==0)||(u9.p41==1))") | ("((u1.p19==0)||(i10.u18.p88==1))" U "((i10.u21.p83==0)||...170
Reverse transition relation is NOT exact ! Due to transitions t349, t350, t351, t352, t357, t358, t359, t360, t365, t366, t367, t368, t373, t374, t375, t37...1941
Computing Next relation with stutter on 393130 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10024615047200111893
[2022-06-11 03:40:13] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10024615047200111893
Running compilation step : cd /tmp/ltsmin10024615047200111893;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10024615047200111893;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10024615047200111893;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property AutonomousCar-PT-09a-LTLCardinality-00 finished in 70247 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U !F(p1))||(G(p2)&&p0))))'
Support contains 5 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 874/874 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 85 transition count 865
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 76 transition count 865
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 24 place count 70 transition count 805
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 70 transition count 805
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 69 transition count 804
Applied a total of 32 rules in 197 ms. Remains 69 /85 variables (removed 16) and now considering 804/874 (removed 70) transitions.
[2022-06-11 03:40:16] [INFO ] Flow matrix only has 803 transitions (discarded 1 similar events)
// Phase 1: matrix 803 rows 69 cols
[2022-06-11 03:40:16] [INFO ] Computed 13 place invariants in 8 ms
[2022-06-11 03:40:16] [INFO ] Implicit Places using invariants in 458 ms returned []
[2022-06-11 03:40:16] [INFO ] Flow matrix only has 803 transitions (discarded 1 similar events)
// Phase 1: matrix 803 rows 69 cols
[2022-06-11 03:40:16] [INFO ] Computed 13 place invariants in 5 ms
[2022-06-11 03:40:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 03:40:17] [INFO ] Implicit Places using invariants and state equation in 656 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1117 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/85 places, 804/874 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 68 transition count 803
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 67 transition count 803
Applied a total of 2 rules in 129 ms. Remains 67 /68 variables (removed 1) and now considering 803/804 (removed 1) transitions.
[2022-06-11 03:40:17] [INFO ] Flow matrix only has 802 transitions (discarded 1 similar events)
// Phase 1: matrix 802 rows 67 cols
[2022-06-11 03:40:17] [INFO ] Computed 12 place invariants in 5 ms
[2022-06-11 03:40:17] [INFO ] Implicit Places using invariants in 434 ms returned []
[2022-06-11 03:40:17] [INFO ] Flow matrix only has 802 transitions (discarded 1 similar events)
// Phase 1: matrix 802 rows 67 cols
[2022-06-11 03:40:17] [INFO ] Computed 12 place invariants in 8 ms
[2022-06-11 03:40:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 03:40:18] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 1027 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/85 places, 803/874 transitions.
Finished structural reductions, in 2 iterations. Remains : 67/85 places, 803/874 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-09a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={1} source=0 dest: 0}, { cond=(OR (AND p1 (NOT p0)) (AND p1 (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0 p2), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (EQ s58 0) (EQ s65 1)) (EQ s1 1)), p0:(EQ s1 1), p2:(OR (EQ s52 0) (EQ s21 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 851 reset in 405 ms.
Product exploration explored 100000 steps with 415 reset in 342 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND p1 p0 p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X (NOT (OR (AND p1 (NOT p0)) (AND p1 (NOT p2))))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 (NOT p2))))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 658 ms. Reduced automaton from 2 states, 8 edges and 3 AP to 2 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 76 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 634 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-11 03:40:20] [INFO ] Flow matrix only has 802 transitions (discarded 1 similar events)
// Phase 1: matrix 802 rows 67 cols
[2022-06-11 03:40:20] [INFO ] Computed 12 place invariants in 6 ms
[2022-06-11 03:40:20] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 03:40:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-06-11 03:40:20] [INFO ] After 298ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND p1 p0 p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X (NOT (OR (AND p1 (NOT p0)) (AND p1 (NOT p2))))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 (NOT p2)))))), (G (NOT (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND p0 p1 p2)), (F (NOT (AND (NOT p1) p2))), (F (AND p1 (NOT p2))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))))), (F (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))), (F (AND p1 p2))]
Knowledge based reduction with 18 factoid took 1099 ms. Reduced automaton from 2 states, 8 edges and 3 AP to 2 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 90 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 95 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 803/803 transitions.
Applied a total of 0 rules in 99 ms. Remains 67 /67 variables (removed 0) and now considering 803/803 (removed 0) transitions.
[2022-06-11 03:40:22] [INFO ] Flow matrix only has 802 transitions (discarded 1 similar events)
// Phase 1: matrix 802 rows 67 cols
[2022-06-11 03:40:22] [INFO ] Computed 12 place invariants in 8 ms
[2022-06-11 03:40:22] [INFO ] Implicit Places using invariants in 374 ms returned []
[2022-06-11 03:40:22] [INFO ] Flow matrix only has 802 transitions (discarded 1 similar events)
// Phase 1: matrix 802 rows 67 cols
[2022-06-11 03:40:22] [INFO ] Computed 12 place invariants in 5 ms
[2022-06-11 03:40:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 03:40:23] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1210 ms to find 0 implicit places.
[2022-06-11 03:40:23] [INFO ] Redundant transitions in 22 ms returned []
[2022-06-11 03:40:23] [INFO ] Flow matrix only has 802 transitions (discarded 1 similar events)
// Phase 1: matrix 802 rows 67 cols
[2022-06-11 03:40:23] [INFO ] Computed 12 place invariants in 5 ms
[2022-06-11 03:40:24] [INFO ] Dead Transitions using invariants and state equation in 821 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/67 places, 803/803 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND p0 p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (AND p1 p2)), (X (X (AND p0 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (AND p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 727 ms. Reduced automaton from 2 states, 7 edges and 3 AP to 2 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 103 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Finished random walk after 1789 steps, including 110 resets, run visited all 7 properties in 51 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND p0 p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (AND p1 p2)), (X (X (AND p0 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (AND p1 p2)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2)), (F (NOT (AND (NOT p1) p2))), (F p1), (F (AND p0 p2)), (F (OR (AND (NOT p0) p1) (AND p1 (NOT p2))))]
Knowledge based reduction with 15 factoid took 1245 ms. Reduced automaton from 2 states, 7 edges and 3 AP to 2 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 99 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 94 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 1970 reset in 879 ms.
Product exploration explored 100000 steps with 278 reset in 489 ms.
Built C files in :
/tmp/ltsmin3226255747624953712
[2022-06-11 03:40:28] [INFO ] Computing symmetric may disable matrix : 803 transitions.
[2022-06-11 03:40:28] [INFO ] Computation of Complete disable matrix. took 111 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 03:40:28] [INFO ] Computing symmetric may enable matrix : 803 transitions.
[2022-06-11 03:40:28] [INFO ] Computation of Complete enable matrix. took 54 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 03:40:28] [INFO ] Computing Do-Not-Accords matrix : 803 transitions.
[2022-06-11 03:40:28] [INFO ] Computation of Completed DNA matrix. took 54 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 03:40:28] [INFO ] Built C files in 441ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3226255747624953712
Running compilation step : cd /tmp/ltsmin3226255747624953712;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3226255747624953712;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3226255747624953712;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 803/803 transitions.
Applied a total of 0 rules in 67 ms. Remains 67 /67 variables (removed 0) and now considering 803/803 (removed 0) transitions.
[2022-06-11 03:40:31] [INFO ] Flow matrix only has 802 transitions (discarded 1 similar events)
// Phase 1: matrix 802 rows 67 cols
[2022-06-11 03:40:31] [INFO ] Computed 12 place invariants in 6 ms
[2022-06-11 03:40:31] [INFO ] Implicit Places using invariants in 359 ms returned []
[2022-06-11 03:40:31] [INFO ] Flow matrix only has 802 transitions (discarded 1 similar events)
// Phase 1: matrix 802 rows 67 cols
[2022-06-11 03:40:31] [INFO ] Computed 12 place invariants in 5 ms
[2022-06-11 03:40:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 03:40:32] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 913 ms to find 0 implicit places.
[2022-06-11 03:40:32] [INFO ] Redundant transitions in 12 ms returned []
[2022-06-11 03:40:32] [INFO ] Flow matrix only has 802 transitions (discarded 1 similar events)
// Phase 1: matrix 802 rows 67 cols
[2022-06-11 03:40:32] [INFO ] Computed 12 place invariants in 5 ms
[2022-06-11 03:40:33] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/67 places, 803/803 transitions.
Built C files in :
/tmp/ltsmin10751175948979886813
[2022-06-11 03:40:33] [INFO ] Computing symmetric may disable matrix : 803 transitions.
[2022-06-11 03:40:33] [INFO ] Computation of Complete disable matrix. took 95 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 03:40:33] [INFO ] Computing symmetric may enable matrix : 803 transitions.
[2022-06-11 03:40:33] [INFO ] Computation of Complete enable matrix. took 48 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 03:40:33] [INFO ] Computing Do-Not-Accords matrix : 803 transitions.
[2022-06-11 03:40:33] [INFO ] Computation of Completed DNA matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 03:40:33] [INFO ] Built C files in 366ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10751175948979886813
Running compilation step : cd /tmp/ltsmin10751175948979886813;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10751175948979886813;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10751175948979886813;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-11 03:40:36] [INFO ] Flatten gal took : 131 ms
[2022-06-11 03:40:36] [INFO ] Flatten gal took : 109 ms
[2022-06-11 03:40:36] [INFO ] Time to serialize gal into /tmp/LTL10876842892465694538.gal : 21 ms
[2022-06-11 03:40:36] [INFO ] Time to serialize properties into /tmp/LTL9464700198567126403.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/LTL10876842892465694538.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9464700198567126403.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/LTL1087684...267
Read 1 LTL properties
Checking formula 0 : !((F((("(p2==1)")U(!(F("(((p77==0)||(p87==1))&&(p2==1))"))))||((G("((p69==0)||(p26==1))"))&&("(p2==1)")))))
Formula 0 simplified : !F(("(p2==1)" U !F"(((p77==0)||(p87==1))&&(p2==1))") | ("(p2==1)" & G"((p69==0)||(p26==1))"))
Reverse transition relation is NOT exact ! Due to transitions t1, t4.t871, t5, t7, t10, t11, t14, t16, t19, t20, t23, t24, t27, t29, t32, t34, t37, t39, t4...3336
Computing Next relation with stutter on 393130 deadlock states
Detected timeout of ITS tools.
[2022-06-11 03:40:52] [INFO ] Flatten gal took : 120 ms
[2022-06-11 03:40:52] [INFO ] Applying decomposition
[2022-06-11 03:40:52] [INFO ] Flatten gal took : 115 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/graph13245109525190952384.txt' '-o' '/tmp/graph13245109525190952384.bin' '-w' '/tmp/graph13245109525190952384.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13245109525190952384.bin' '-l' '-1' '-v' '-w' '/tmp/graph13245109525190952384.weights' '-q' '0' '-e' '0.001'
[2022-06-11 03:40:52] [INFO ] Decomposing Gal with order
[2022-06-11 03:40:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 03:40:52] [INFO ] Removed a total of 5563 redundant transitions.
[2022-06-11 03:40:52] [INFO ] Flatten gal took : 203 ms
[2022-06-11 03:40:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 48 ms.
[2022-06-11 03:40:52] [INFO ] Time to serialize gal into /tmp/LTL15297558714892136051.gal : 8 ms
[2022-06-11 03:40:52] [INFO ] Time to serialize properties into /tmp/LTL5567366544692157829.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/LTL15297558714892136051.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5567366544692157829.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/LTL1529755...246
Read 1 LTL properties
Checking formula 0 : !((F((("(u20.p2==1)")U(!(F("(((i11.u19.p77==0)||(i11.u21.p87==1))&&(u20.p2==1))"))))||((G("((i10.u16.p69==0)||(u3.p26==1))"))&&("(u20....167
Formula 0 simplified : !F(("(u20.p2==1)" U !F"(((i11.u19.p77==0)||(i11.u21.p87==1))&&(u20.p2==1))") | ("(u20.p2==1)" & G"((i10.u16.p69==0)||(u3.p26==1))"))
Reverse transition relation is NOT exact ! Due to transitions t4_t871, t349, t350, t351, t352, t353, t354, t355, t356, t357, t358, t359, t360, t361, t362, ...3440
Computing Next relation with stutter on 393130 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17661341374517927592
[2022-06-11 03:41:07] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17661341374517927592
Running compilation step : cd /tmp/ltsmin17661341374517927592;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17661341374517927592;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17661341374517927592;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property AutonomousCar-PT-09a-LTLCardinality-02 finished in 54932 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 874/874 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 79 transition count 823
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 79 transition count 823
Applied a total of 12 rules in 12 ms. Remains 79 /85 variables (removed 6) and now considering 823/874 (removed 51) transitions.
// Phase 1: matrix 823 rows 79 cols
[2022-06-11 03:41:11] [INFO ] Computed 12 place invariants in 4 ms
[2022-06-11 03:41:11] [INFO ] Implicit Places using invariants in 444 ms returned []
// Phase 1: matrix 823 rows 79 cols
[2022-06-11 03:41:11] [INFO ] Computed 12 place invariants in 4 ms
[2022-06-11 03:41:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 03:41:12] [INFO ] Implicit Places using invariants and state equation in 601 ms returned [75, 77]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1050 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 77/85 places, 823/874 transitions.
Applied a total of 0 rules in 5 ms. Remains 77 /77 variables (removed 0) and now considering 823/823 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 77/85 places, 823/874 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(OR (EQ s32 0) (EQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 4019 ms.
Product exploration explored 100000 steps with 33333 reset in 3730 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 52 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-09a-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-09a-LTLCardinality-03 finished in 9034 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)||X(p1)))||X(F(p2))))'
Support contains 5 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 874/874 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 79 transition count 823
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 79 transition count 823
Applied a total of 12 rules in 7 ms. Remains 79 /85 variables (removed 6) and now considering 823/874 (removed 51) transitions.
// Phase 1: matrix 823 rows 79 cols
[2022-06-11 03:41:20] [INFO ] Computed 12 place invariants in 4 ms
[2022-06-11 03:41:20] [INFO ] Implicit Places using invariants in 323 ms returned []
// Phase 1: matrix 823 rows 79 cols
[2022-06-11 03:41:20] [INFO ] Computed 12 place invariants in 4 ms
[2022-06-11 03:41:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 03:41:21] [INFO ] Implicit Places using invariants and state equation in 763 ms returned [75, 77]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1090 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 77/85 places, 823/874 transitions.
Applied a total of 0 rules in 7 ms. Remains 77 /77 variables (removed 0) and now considering 823/823 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 77/85 places, 823/874 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-09a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(EQ s3 1), p0:(OR (EQ s64 0) (EQ s48 1) (EQ s47 0) (EQ s58 1)), p1:(OR (EQ s47 0) (EQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-09a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLCardinality-04 finished in 1270 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 874/874 transitions.
Reduce places removed 1 places and 1 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 84 transition count 864
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 75 transition count 863
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 74 transition count 863
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 27 place count 67 transition count 802
Iterating global reduction 3 with 7 rules applied. Total rules applied 34 place count 67 transition count 802
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 38 place count 65 transition count 800
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 40 place count 64 transition count 800
Applied a total of 40 rules in 178 ms. Remains 64 /85 variables (removed 21) and now considering 800/874 (removed 74) transitions.
// Phase 1: matrix 800 rows 64 cols
[2022-06-11 03:41:21] [INFO ] Computed 12 place invariants in 5 ms
[2022-06-11 03:41:21] [INFO ] Implicit Places using invariants in 497 ms returned []
// Phase 1: matrix 800 rows 64 cols
[2022-06-11 03:41:22] [INFO ] Computed 12 place invariants in 6 ms
[2022-06-11 03:41:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 03:41:22] [INFO ] Implicit Places using invariants and state equation in 883 ms returned [60, 62]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1395 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/85 places, 800/874 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 62 transition count 799
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 61 transition count 799
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 60 transition count 798
Applied a total of 4 rules in 131 ms. Remains 60 /62 variables (removed 2) and now considering 798/800 (removed 2) transitions.
// Phase 1: matrix 798 rows 60 cols
[2022-06-11 03:41:23] [INFO ] Computed 10 place invariants in 6 ms
[2022-06-11 03:41:23] [INFO ] Implicit Places using invariants in 512 ms returned []
// Phase 1: matrix 798 rows 60 cols
[2022-06-11 03:41:23] [INFO ] Computed 10 place invariants in 6 ms
[2022-06-11 03:41:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 03:41:24] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1390 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/85 places, 798/874 transitions.
Finished structural reductions, in 2 iterations. Remains : 60/85 places, 798/874 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s23 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]]
Product exploration explored 100000 steps with 50000 reset in 1205 ms.
Product exploration explored 100000 steps with 50000 reset in 721 ms.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-09a-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-09a-LTLCardinality-05 finished in 5196 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(X(G(p0))))))'
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 874/874 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 78 transition count 813
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 78 transition count 813
Applied a total of 14 rules in 10 ms. Remains 78 /85 variables (removed 7) and now considering 813/874 (removed 61) transitions.
// Phase 1: matrix 813 rows 78 cols
[2022-06-11 03:41:26] [INFO ] Computed 12 place invariants in 3 ms
[2022-06-11 03:41:26] [INFO ] Implicit Places using invariants in 417 ms returned []
// Phase 1: matrix 813 rows 78 cols
[2022-06-11 03:41:26] [INFO ] Computed 12 place invariants in 7 ms
[2022-06-11 03:41:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 03:41:27] [INFO ] Implicit Places using invariants and state equation in 750 ms returned [74, 76]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1171 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/85 places, 813/874 transitions.
Applied a total of 0 rules in 5 ms. Remains 76 /76 variables (removed 0) and now considering 813/813 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 76/85 places, 813/874 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLCardinality-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: 2}]], initial=3, aps=[p0:(AND (NEQ s71 0) (NEQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-09a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLCardinality-06 finished in 1309 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(F(p0)))&&X(p1)))'
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 874/874 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 79 transition count 823
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 79 transition count 823
Applied a total of 12 rules in 10 ms. Remains 79 /85 variables (removed 6) and now considering 823/874 (removed 51) transitions.
// Phase 1: matrix 823 rows 79 cols
[2022-06-11 03:41:27] [INFO ] Computed 12 place invariants in 4 ms
[2022-06-11 03:41:28] [INFO ] Implicit Places using invariants in 342 ms returned []
// Phase 1: matrix 823 rows 79 cols
[2022-06-11 03:41:28] [INFO ] Computed 12 place invariants in 4 ms
[2022-06-11 03:41:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 03:41:28] [INFO ] Implicit Places using invariants and state equation in 592 ms returned [75, 77]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 938 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 77/85 places, 823/874 transitions.
Applied a total of 0 rules in 6 ms. Remains 77 /77 variables (removed 0) and now considering 823/823 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 77/85 places, 823/874 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : AutonomousCar-PT-09a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (OR (EQ s41 0) (EQ s47 1)) (OR (EQ s38 0) (EQ s26 1))), p1:(OR (EQ s41 0) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4970 ms.
Product exploration explored 100000 steps with 50000 reset in 4988 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p1 (NOT p0)))), (X p1), true, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-09a-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-09a-LTLCardinality-07 finished in 11167 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&p1)))'
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 874/874 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 78 transition count 813
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 78 transition count 813
Applied a total of 14 rules in 6 ms. Remains 78 /85 variables (removed 7) and now considering 813/874 (removed 61) transitions.
// Phase 1: matrix 813 rows 78 cols
[2022-06-11 03:41:38] [INFO ] Computed 12 place invariants in 7 ms
[2022-06-11 03:41:39] [INFO ] Implicit Places using invariants in 339 ms returned []
// Phase 1: matrix 813 rows 78 cols
[2022-06-11 03:41:39] [INFO ] Computed 12 place invariants in 5 ms
[2022-06-11 03:41:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 03:41:40] [INFO ] Implicit Places using invariants and state equation in 698 ms returned [74, 76]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1040 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/85 places, 813/874 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 813/813 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 76/85 places, 813/874 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s69 0) (EQ s18 1)), p0:(OR (EQ s54 0) (EQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 5338 ms.
Product exploration explored 100000 steps with 50000 reset in 4978 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 7 factoid took 177 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-09a-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-09a-LTLCardinality-08 finished in 11667 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p1)||p0)))'
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 874/874 transitions.
Reduce places removed 1 places and 1 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 84 transition count 863
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 74 transition count 863
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 27 place count 67 transition count 802
Iterating global reduction 2 with 7 rules applied. Total rules applied 34 place count 67 transition count 802
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 65 transition count 800
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 64 transition count 800
Applied a total of 40 rules in 111 ms. Remains 64 /85 variables (removed 21) and now considering 800/874 (removed 74) transitions.
// Phase 1: matrix 800 rows 64 cols
[2022-06-11 03:41:50] [INFO ] Computed 12 place invariants in 4 ms
[2022-06-11 03:41:51] [INFO ] Implicit Places using invariants in 448 ms returned []
// Phase 1: matrix 800 rows 64 cols
[2022-06-11 03:41:51] [INFO ] Computed 12 place invariants in 4 ms
[2022-06-11 03:41:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 03:41:52] [INFO ] Implicit Places using invariants and state equation in 793 ms returned [60, 62]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1245 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/85 places, 800/874 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 62 transition count 799
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 61 transition count 799
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 60 transition count 798
Applied a total of 4 rules in 103 ms. Remains 60 /62 variables (removed 2) and now considering 798/800 (removed 2) transitions.
// Phase 1: matrix 798 rows 60 cols
[2022-06-11 03:41:52] [INFO ] Computed 10 place invariants in 5 ms
[2022-06-11 03:41:52] [INFO ] Implicit Places using invariants in 505 ms returned []
// Phase 1: matrix 798 rows 60 cols
[2022-06-11 03:41:52] [INFO ] Computed 10 place invariants in 5 ms
[2022-06-11 03:41:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 03:41:53] [INFO ] Implicit Places using invariants and state equation in 914 ms returned []
Implicit Place search using SMT with State Equation took 1429 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/85 places, 798/874 transitions.
Finished structural reductions, in 2 iterations. Remains : 60/85 places, 798/874 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-09a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(AND (EQ s3 0) (EQ s8 1)), p0:(OR (EQ s8 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 2637 steps with 185 reset in 34 ms.
FORMULA AutonomousCar-PT-09a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLCardinality-13 finished in 3058 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(F((X(p0)||F(p0))))))'
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 874/874 transitions.
Reduce places removed 1 places and 1 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 84 transition count 864
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 75 transition count 864
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 25 place count 68 transition count 803
Iterating global reduction 2 with 7 rules applied. Total rules applied 32 place count 68 transition count 803
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 66 transition count 801
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 65 transition count 801
Applied a total of 38 rules in 128 ms. Remains 65 /85 variables (removed 20) and now considering 801/874 (removed 73) transitions.
// Phase 1: matrix 801 rows 65 cols
[2022-06-11 03:41:53] [INFO ] Computed 12 place invariants in 5 ms
[2022-06-11 03:41:54] [INFO ] Implicit Places using invariants in 543 ms returned []
// Phase 1: matrix 801 rows 65 cols
[2022-06-11 03:41:54] [INFO ] Computed 12 place invariants in 5 ms
[2022-06-11 03:41:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 03:41:55] [INFO ] Implicit Places using invariants and state equation in 860 ms returned [61, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1407 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/85 places, 801/874 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 63 transition count 800
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 62 transition count 800
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 799
Applied a total of 4 rules in 96 ms. Remains 61 /63 variables (removed 2) and now considering 799/801 (removed 2) transitions.
// Phase 1: matrix 799 rows 61 cols
[2022-06-11 03:41:55] [INFO ] Computed 10 place invariants in 4 ms
[2022-06-11 03:41:55] [INFO ] Implicit Places using invariants in 528 ms returned []
// Phase 1: matrix 799 rows 61 cols
[2022-06-11 03:41:55] [INFO ] Computed 10 place invariants in 5 ms
[2022-06-11 03:41:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 03:41:56] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1387 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/85 places, 799/874 transitions.
Finished structural reductions, in 2 iterations. Remains : 61/85 places, 799/874 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s46 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 19 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-09a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLCardinality-14 finished in 3153 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p0 U X(p1)))||(p2 U p1))))'
Found a SL insensitive property : AutonomousCar-PT-09a-LTLCardinality-00
Stuttering acceptance computed with spot in 334 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 6 out of 85 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 85/85 places, 874/874 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 85 transition count 866
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 77 transition count 865
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 76 transition count 865
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 25 place count 69 transition count 804
Iterating global reduction 3 with 7 rules applied. Total rules applied 32 place count 69 transition count 804
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 36 place count 67 transition count 802
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 38 place count 66 transition count 802
Applied a total of 38 rules in 103 ms. Remains 66 /85 variables (removed 19) and now considering 802/874 (removed 72) transitions.
// Phase 1: matrix 802 rows 66 cols
[2022-06-11 03:41:57] [INFO ] Computed 12 place invariants in 6 ms
[2022-06-11 03:41:57] [INFO ] Implicit Places using invariants in 453 ms returned []
// Phase 1: matrix 802 rows 66 cols
[2022-06-11 03:41:57] [INFO ] Computed 12 place invariants in 6 ms
[2022-06-11 03:41:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 03:41:58] [INFO ] Implicit Places using invariants and state equation in 839 ms returned [62, 64]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1302 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 64/85 places, 802/874 transitions.
Applied a total of 0 rules in 29 ms. Remains 64 /64 variables (removed 0) and now considering 802/802 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/85 places, 802/874 transitions.
Running random walk in product with property : AutonomousCar-PT-09a-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=2 dest: 1}, { cond=(OR p1 p2), acceptance={} source=2 dest: 2}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s56 0) (EQ s29 1)), p1:(OR (EQ s61 0) (EQ s31 1)), p2:(OR (EQ s15 0) (EQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 588 reset in 377 ms.
Product exploration explored 100000 steps with 221 reset in 276 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (OR p1 p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (OR p1 p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 2021 ms. Reduced automaton from 7 states, 19 edges and 3 AP to 7 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 341 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 628 resets, run finished after 885 ms. (steps per millisecond=11 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 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 45 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 802 rows 64 cols
[2022-06-11 03:42:03] [INFO ] Computed 10 place invariants in 4 ms
[2022-06-11 03:42:03] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-11 03:42:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-11 03:42:04] [INFO ] After 1347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-06-11 03:42:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 03:42:05] [INFO ] After 1004ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2022-06-11 03:42:07] [INFO ] After 2146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 925 ms.
[2022-06-11 03:42:07] [INFO ] After 4497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 413 ms.
Support contains 6 out of 64 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 802/802 transitions.
Graph (complete) has 894 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 63 transition count 799
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 11 place count 63 transition count 791
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 82 place count 55 transition count 728
Applied a total of 82 rules in 150 ms. Remains 55 /64 variables (removed 9) and now considering 728/802 (removed 74) transitions.
Finished structural reductions, in 1 iterations. Remains : 55/64 places, 728/802 transitions.
Incomplete random walk after 10000 steps, including 187 resets, run finished after 580 ms. (steps per millisecond=17 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
Finished Best-First random walk after 1041 steps, including 1 resets, run visited all 1 properties in 8 ms. (steps per millisecond=130 )
Knowledge obtained : [(AND p0 p1 p2), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (OR p1 p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (OR p1 p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(F (NOT (OR (AND p0 p1) (AND p0 p2)))), (F (NOT (OR p1 p2))), (F (AND (NOT p1) p2)), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 26 factoid took 1862 ms. Reduced automaton from 7 states, 19 edges and 3 AP to 7 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 294 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 292 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 6 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 802/802 transitions.
Applied a total of 0 rules in 5 ms. Remains 64 /64 variables (removed 0) and now considering 802/802 (removed 0) transitions.
// Phase 1: matrix 802 rows 64 cols
[2022-06-11 03:42:11] [INFO ] Computed 10 place invariants in 6 ms
[2022-06-11 03:42:12] [INFO ] Implicit Places using invariants in 344 ms returned []
// Phase 1: matrix 802 rows 64 cols
[2022-06-11 03:42:12] [INFO ] Computed 10 place invariants in 6 ms
[2022-06-11 03:42:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 03:42:12] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 1160 ms to find 0 implicit places.
// Phase 1: matrix 802 rows 64 cols
[2022-06-11 03:42:12] [INFO ] Computed 10 place invariants in 10 ms
[2022-06-11 03:42:13] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 802/802 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (OR p1 p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (OR p1 p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 1899 ms. Reduced automaton from 7 states, 19 edges and 3 AP to 7 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 296 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 643 resets, run finished after 702 ms. (steps per millisecond=14 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 51 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 802 rows 64 cols
[2022-06-11 03:42:16] [INFO ] Computed 10 place invariants in 4 ms
[2022-06-11 03:42:17] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-11 03:42:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-06-11 03:42:18] [INFO ] After 1359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-06-11 03:42:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 03:42:19] [INFO ] After 996ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2022-06-11 03:42:20] [INFO ] After 2180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 992 ms.
[2022-06-11 03:42:21] [INFO ] After 4646ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 589 ms.
Support contains 6 out of 64 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 802/802 transitions.
Graph (complete) has 894 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 63 transition count 799
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 11 place count 63 transition count 791
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 82 place count 55 transition count 728
Applied a total of 82 rules in 146 ms. Remains 55 /64 variables (removed 9) and now considering 728/802 (removed 74) transitions.
Finished structural reductions, in 1 iterations. Remains : 55/64 places, 728/802 transitions.
Incomplete random walk after 10000 steps, including 125 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :5
Finished Best-First random walk after 821 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=273 )
Knowledge obtained : [(AND p0 p1 p2), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (OR p1 p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (OR p1 p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(F (NOT (OR (AND p0 p1) (AND p0 p2)))), (F (NOT (OR p1 p2))), (F (AND (NOT p1) p2)), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 26 factoid took 2038 ms. Reduced automaton from 7 states, 19 edges and 3 AP to 7 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 297 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 298 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 361 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 517 reset in 349 ms.
Product exploration explored 100000 steps with 717 reset in 397 ms.
Applying partial POR strategy [false, true, false, true, false, false, true]
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 6 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 802/802 transitions.
Applied a total of 0 rules in 48 ms. Remains 64 /64 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2022-06-11 03:42:27] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 802 rows 64 cols
[2022-06-11 03:42:27] [INFO ] Computed 10 place invariants in 4 ms
[2022-06-11 03:42:27] [INFO ] Dead Transitions using invariants and state equation in 796 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 802/802 transitions.
Product exploration explored 100000 steps with 455 reset in 190 ms.
Product exploration explored 100000 steps with 350 reset in 189 ms.
Built C files in :
/tmp/ltsmin5264709569587540566
[2022-06-11 03:42:28] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5264709569587540566
Running compilation step : cd /tmp/ltsmin5264709569587540566;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5264709569587540566;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5264709569587540566;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 6 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 802/802 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 802/802 (removed 0) transitions.
// Phase 1: matrix 802 rows 64 cols
[2022-06-11 03:42:31] [INFO ] Computed 10 place invariants in 5 ms
[2022-06-11 03:42:31] [INFO ] Implicit Places using invariants in 320 ms returned []
// Phase 1: matrix 802 rows 64 cols
[2022-06-11 03:42:31] [INFO ] Computed 10 place invariants in 7 ms
[2022-06-11 03:42:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 03:42:32] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 1092 ms to find 0 implicit places.
// Phase 1: matrix 802 rows 64 cols
[2022-06-11 03:42:32] [INFO ] Computed 10 place invariants in 4 ms
[2022-06-11 03:42:32] [INFO ] Dead Transitions using invariants and state equation in 563 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 802/802 transitions.
Built C files in :
/tmp/ltsmin5446368087632836535
[2022-06-11 03:42:33] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5446368087632836535
Running compilation step : cd /tmp/ltsmin5446368087632836535;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5446368087632836535;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5446368087632836535;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-11 03:42:36] [INFO ] Flatten gal took : 111 ms
[2022-06-11 03:42:36] [INFO ] Flatten gal took : 114 ms
[2022-06-11 03:42:36] [INFO ] Time to serialize gal into /tmp/LTL88176714182662862.gal : 25 ms
[2022-06-11 03:42:36] [INFO ] Time to serialize properties into /tmp/LTL3796336612497389743.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/LTL88176714182662862.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3796336612497389743.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/LTL8817671...264
Read 1 LTL properties
Checking formula 0 : !((G((G(("((p75==0)||(p39==1))")U(X("((p83==0)||(p41==1))"))))||(("((p19==0)||(p88==1))")U("((p83==0)||(p41==1))")))))
Formula 0 simplified : !G(G("((p75==0)||(p39==1))" U X"((p83==0)||(p41==1))") | ("((p19==0)||(p88==1))" U "((p83==0)||(p41==1))"))
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t7, t10, t11, t14, t16, t19, t20, t23, t24, t27, t29, t32, t34, t37, t39, t42, t44, t...3365
Computing Next relation with stutter on 393130 deadlock states
Detected timeout of ITS tools.
[2022-06-11 03:42:51] [INFO ] Flatten gal took : 99 ms
[2022-06-11 03:42:51] [INFO ] Applying decomposition
[2022-06-11 03:42:51] [INFO ] Flatten gal took : 116 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/graph3331957596144780138.txt' '-o' '/tmp/graph3331957596144780138.bin' '-w' '/tmp/graph3331957596144780138.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3331957596144780138.bin' '-l' '-1' '-v' '-w' '/tmp/graph3331957596144780138.weights' '-q' '0' '-e' '0.001'
[2022-06-11 03:42:51] [INFO ] Decomposing Gal with order
[2022-06-11 03:42:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 03:42:52] [INFO ] Removed a total of 5564 redundant transitions.
[2022-06-11 03:42:52] [INFO ] Flatten gal took : 170 ms
[2022-06-11 03:42:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 51 ms.
[2022-06-11 03:42:52] [INFO ] Time to serialize gal into /tmp/LTL314481665990199898.gal : 28 ms
[2022-06-11 03:42:52] [INFO ] Time to serialize properties into /tmp/LTL13166411366170519664.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/LTL314481665990199898.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13166411366170519664.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/LTL3144816...245
Read 1 LTL properties
Checking formula 0 : !((G((G(("((u19.p75==0)||(u8.p39==1))")U(X("((i10.u20.p83==0)||(i5.u9.p41==1))"))))||(("((i1.u2.p19==0)||(i10.u20.p88==1))")U("((i10.u...188
Formula 0 simplified : !G(G("((u19.p75==0)||(u8.p39==1))" U X"((i10.u20.p83==0)||(i5.u9.p41==1))") | ("((i1.u2.p19==0)||(i10.u20.p88==1))" U "((i10.u20.p83...179
Reverse transition relation is NOT exact ! Due to transitions t349, t350, t351, t352, t353, t354, t355, t356, t357, t358, t359, t360, t361, t362, t363, t36...3467
Computing Next relation with stutter on 393130 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14024975828263517496
[2022-06-11 03:43:07] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14024975828263517496
Running compilation step : cd /tmp/ltsmin14024975828263517496;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14024975828263517496;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14024975828263517496;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property AutonomousCar-PT-09a-LTLCardinality-00 finished in 73441 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U !F(p1))||(G(p2)&&p0))))'
[2022-06-11 03:43:10] [INFO ] Flatten gal took : 111 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5183915786639037301
[2022-06-11 03:43:10] [INFO ] Computing symmetric may disable matrix : 874 transitions.
[2022-06-11 03:43:10] [INFO ] Applying decomposition
[2022-06-11 03:43:10] [INFO ] Computation of Complete disable matrix. took 98 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 03:43:10] [INFO ] Computing symmetric may enable matrix : 874 transitions.
[2022-06-11 03:43:10] [INFO ] Flatten gal took : 108 ms
[2022-06-11 03:43:10] [INFO ] Computation of Complete enable matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 03:43:10] [INFO ] Computing Do-Not-Accords matrix : 874 transitions.
[2022-06-11 03:43:10] [INFO ] Computation of Completed DNA matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph5113529169540468424.txt' '-o' '/tmp/graph5113529169540468424.bin' '-w' '/tmp/graph5113529169540468424.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5113529169540468424.bin' '-l' '-1' '-v' '-w' '/tmp/graph5113529169540468424.weights' '-q' '0' '-e' '0.001'
[2022-06-11 03:43:10] [INFO ] Decomposing Gal with order
[2022-06-11 03:43:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 03:43:10] [INFO ] Built C files in 413ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5183915786639037301
Running compilation step : cd /tmp/ltsmin5183915786639037301;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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'
[2022-06-11 03:43:11] [INFO ] Removed a total of 6256 redundant transitions.
[2022-06-11 03:43:11] [INFO ] Flatten gal took : 180 ms
[2022-06-11 03:43:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 54 ms.
[2022-06-11 03:43:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality12984814978433937368.gal : 5 ms
[2022-06-11 03:43:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality15737854552245691980.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/LTLCardinality12984814978433937368.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15737854552245691980.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/LTLCardina...269
Read 2 LTL properties
Checking formula 0 : !((G((G(("((i9.u27.p75==0)||(i4.u12.p39==1))")U(X("((i11.u30.p83==0)||(i5.u13.p41==1))"))))||(("((i1.u3.p19==0)||(i11.u28.p88==1))")U(...197
Formula 0 simplified : !G(G("((i9.u27.p75==0)||(i4.u12.p39==1))" U X"((i11.u30.p83==0)||(i5.u13.p41==1))") | ("((i1.u3.p19==0)||(i11.u28.p88==1))" U "((i11...188
Compilation finished in 6406 ms.
Running link step : cd /tmp/ltsmin5183915786639037301;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 88 ms.
Running LTSmin : cd /tmp/ltsmin5183915786639037301;'/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' '[](([](((LTLAPp0==true) U X((LTLAPp1==true))))||((LTLAPp2==true) U (LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 14205 ms.
FORMULA AutonomousCar-PT-09a-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin5183915786639037301;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((((LTLAPp3==true) U !<>((LTLAPp4==true)))||([]((LTLAPp5==true))&&(LTLAPp3==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t209, t360, t376, t392, t408, t488, t504, t536, t871, u29.t346, i0.u1.t2, i0.u2.t43, i0.u2.t4...524
Computing Next relation with stutter on 393130 deadlock states
Detected timeout of ITS tools.
[2022-06-11 04:04:35] [INFO ] Applying decomposition
[2022-06-11 04:04:36] [INFO ] Flatten gal took : 303 ms
[2022-06-11 04:04:36] [INFO ] Decomposing Gal with order
[2022-06-11 04:04:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 04:04:37] [INFO ] Removed a total of 5951 redundant transitions.
[2022-06-11 04:04:37] [INFO ] Flatten gal took : 584 ms
[2022-06-11 04:04:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 57 ms.
[2022-06-11 04:04:37] [INFO ] Time to serialize gal into /tmp/LTLCardinality6742459087428163634.gal : 2 ms
[2022-06-11 04:04:37] [INFO ] Time to serialize properties into /tmp/LTLCardinality3736639619855795560.ltl : 8 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/LTLCardinality6742459087428163634.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3736639619855795560.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/LTLCardina...267
Read 1 LTL properties
Checking formula 0 : !((F((("(u2.p2==1)")U(!(F("(((u12.p77==0)||(u14.p87==1))&&(u2.p2==1))"))))||((G("((u11.p69==0)||(u4.p26==1))"))&&("(u2.p2==1)")))))
Formula 0 simplified : !F(("(u2.p2==1)" U !F"(((u12.p77==0)||(u14.p87==1))&&(u2.p2==1))") | ("(u2.p2==1)" & G"((u11.p69==0)||(u4.p26==1))"))
Reverse transition relation is NOT exact ! Due to transitions t50, t95, t176, t203, t230, t266, t774, t871, u2.t346, u3.t42, u3.t43, u3.t44, u4.t37, u4.t38...425
Computing Next relation with stutter on 393130 deadlock states
151 unique states visited
150 strongly connected components in search stack
153 transitions explored
151 items max in DFS search stack
2351 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,23.5333,554632,1,0,1.16175e+06,1260,902,1.58979e+06,399,13495,1457244
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutonomousCar-PT-09a-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1603705 ms.

BK_STOP 1654920342210

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-09a"
export BK_EXAMINATION="LTLCardinality"
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-09a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r294-smll-165463873100539"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-09a.tgz
mv AutonomousCar-PT-09a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;