Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.7K Feb 25 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 12:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 12:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 114K Feb 25 12:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.5M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678523180546

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-10a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 08:26:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 08:26:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 08:26:23] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2023-03-11 08:26:23] [INFO ] Transformed 97 places.
[2023-03-11 08:26:23] [INFO ] Transformed 1921 transitions.
[2023-03-11 08:26:23] [INFO ] Found NUPN structural information;
[2023-03-11 08:26:23] [INFO ] Parsed PT model containing 97 places and 1921 transitions and 29152 arcs in 300 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 423 transitions
Reduce redundant transitions removed 423 transitions.
FORMULA AutonomousCar-PT-10a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 1498/1498 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 91 transition count 1442
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 91 transition count 1442
Applied a total of 12 rules in 39 ms. Remains 91 /97 variables (removed 6) and now considering 1442/1498 (removed 56) transitions.
// Phase 1: matrix 1442 rows 91 cols
[2023-03-11 08:26:23] [INFO ] Computed 14 place invariants in 37 ms
[2023-03-11 08:26:23] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-11 08:26:23] [INFO ] Invariant cache hit.
[2023-03-11 08:26:24] [INFO ] State equation strengthened by 353 read => feed constraints.
[2023-03-11 08:26:24] [INFO ] Implicit Places using invariants and state equation in 805 ms returned [87, 89]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1177 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/97 places, 1442/1498 transitions.
Applied a total of 0 rules in 26 ms. Remains 89 /89 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1243 ms. Remains : 89/97 places, 1442/1498 transitions.
Support contains 47 out of 89 places after structural reductions.
[2023-03-11 08:26:25] [INFO ] Flatten gal took : 414 ms
[2023-03-11 08:26:25] [INFO ] Flatten gal took : 236 ms
[2023-03-11 08:26:25] [INFO ] Input system was already deterministic with 1442 transitions.
Support contains 46 out of 89 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 465 resets, run finished after 623 ms. (steps per millisecond=16 ) properties (out of 37) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Running SMT prover for 32 properties.
// Phase 1: matrix 1442 rows 89 cols
[2023-03-11 08:26:26] [INFO ] Computed 12 place invariants in 12 ms
[2023-03-11 08:26:27] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-11 08:26:28] [INFO ] After 763ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7 real:25
[2023-03-11 08:26:28] [INFO ] State equation strengthened by 353 read => feed constraints.
[2023-03-11 08:26:29] [INFO ] After 538ms SMT Verify possible using 353 Read/Feed constraints in real domain returned unsat :0 sat :0 real:32
[2023-03-11 08:26:29] [INFO ] After 1503ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2023-03-11 08:26:29] [INFO ] [Nat]Absence check using 12 positive place invariants in 13 ms returned sat
[2023-03-11 08:26:31] [INFO ] After 2161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :32
[2023-03-11 08:26:33] [INFO ] After 1630ms SMT Verify possible using 353 Read/Feed constraints in natural domain returned unsat :0 sat :32
[2023-03-11 08:26:36] [INFO ] After 4826ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :32
Attempting to minimize the solution found.
Minimization took 1704 ms.
[2023-03-11 08:26:38] [INFO ] After 9224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :32
Parikh walk visited 1 properties in 1418 ms.
Support contains 44 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Graph (complete) has 1186 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 88 transition count 1434
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 84 transition count 1432
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 82 transition count 1432
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 16 place count 82 transition count 1429
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 22 place count 79 transition count 1429
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 78 transition count 1428
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 78 transition count 1428
Free-agglomeration rule applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 33 place count 78 transition count 1419
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 3 with 49 rules applied. Total rules applied 82 place count 69 transition count 1379
Applied a total of 82 rules in 330 ms. Remains 69 /89 variables (removed 20) and now considering 1379/1442 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 330 ms. Remains : 69/89 places, 1379/1442 transitions.
Incomplete random walk after 10000 steps, including 62 resets, run finished after 489 ms. (steps per millisecond=20 ) properties (out of 31) seen :6
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :1
Running SMT prover for 22 properties.
// Phase 1: matrix 1379 rows 69 cols
[2023-03-11 08:26:40] [INFO ] Computed 14 place invariants in 10 ms
[2023-03-11 08:26:41] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-11 08:26:42] [INFO ] After 746ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7 real:15
[2023-03-11 08:26:42] [INFO ] State equation strengthened by 311 read => feed constraints.
[2023-03-11 08:26:42] [INFO ] After 460ms SMT Verify possible using 311 Read/Feed constraints in real domain returned unsat :0 sat :0 real:22
[2023-03-11 08:26:42] [INFO ] After 1556ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2023-03-11 08:26:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-11 08:26:44] [INFO ] After 1441ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2023-03-11 08:26:45] [INFO ] After 1068ms SMT Verify possible using 311 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2023-03-11 08:26:47] [INFO ] After 3230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 1108 ms.
[2023-03-11 08:26:48] [INFO ] After 6086ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Parikh walk visited 0 properties in 974 ms.
Support contains 36 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 1379/1379 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 68 transition count 1368
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 68 transition count 1368
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 67 transition count 1367
Applied a total of 4 rules in 94 ms. Remains 67 /69 variables (removed 2) and now considering 1367/1379 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 67/69 places, 1367/1379 transitions.
Incomplete random walk after 10000 steps, including 151 resets, run finished after 565 ms. (steps per millisecond=17 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 300778 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 300778 steps, saw 47610 distinct states, run finished after 3012 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 1367 rows 67 cols
[2023-03-11 08:26:53] [INFO ] Computed 14 place invariants in 8 ms
[2023-03-11 08:26:54] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-11 08:26:54] [INFO ] After 530ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:15
[2023-03-11 08:26:54] [INFO ] State equation strengthened by 301 read => feed constraints.
[2023-03-11 08:26:54] [INFO ] After 276ms SMT Verify possible using 301 Read/Feed constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-11 08:26:54] [INFO ] After 1061ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-11 08:26:55] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-11 08:26:56] [INFO ] After 1100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-11 08:26:57] [INFO ] After 904ms SMT Verify possible using 301 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-03-11 08:26:59] [INFO ] After 2770ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 993 ms.
[2023-03-11 08:27:00] [INFO ] After 5214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 0 properties in 963 ms.
Support contains 36 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 1367/1367 transitions.
Applied a total of 0 rules in 71 ms. Remains 67 /67 variables (removed 0) and now considering 1367/1367 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 67/67 places, 1367/1367 transitions.
Incomplete random walk after 10000 steps, including 169 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 20) seen :3
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-11 08:27:01] [INFO ] Invariant cache hit.
[2023-03-11 08:27:02] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-11 08:27:03] [INFO ] After 864ms SMT Verify possible using state equation in real domain returned unsat :0 sat :13 real:1
[2023-03-11 08:27:03] [INFO ] State equation strengthened by 301 read => feed constraints.
[2023-03-11 08:27:03] [INFO ] After 665ms SMT Verify possible using 301 Read/Feed constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-11 08:27:03] [INFO ] After 1748ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-11 08:27:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-11 08:27:04] [INFO ] After 921ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-11 08:27:05] [INFO ] After 663ms SMT Verify possible using 301 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-11 08:27:06] [INFO ] After 1939ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 633 ms.
[2023-03-11 08:27:07] [INFO ] After 3655ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 596 ms.
Support contains 35 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 1367/1367 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 1366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 1366
Applied a total of 2 rules in 184 ms. Remains 66 /67 variables (removed 1) and now considering 1366/1367 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 66/67 places, 1366/1367 transitions.
Incomplete random walk after 10000 steps, including 107 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1366 rows 66 cols
[2023-03-11 08:27:09] [INFO ] Computed 14 place invariants in 6 ms
[2023-03-11 08:27:09] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-11 08:27:09] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 08:27:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-11 08:27:09] [INFO ] After 518ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 08:27:09] [INFO ] State equation strengthened by 301 read => feed constraints.
[2023-03-11 08:27:10] [INFO ] After 303ms SMT Verify possible using 301 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 08:27:10] [INFO ] After 798ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 264 ms.
[2023-03-11 08:27:10] [INFO ] After 1652ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 120 ms.
Support contains 9 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 1366/1366 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 1355
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 1355
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 0 with 4 rules applied. Total rules applied 6 place count 63 transition count 1353
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 63 transition count 1351
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 30 place count 61 transition count 1331
Applied a total of 30 rules in 239 ms. Remains 61 /66 variables (removed 5) and now considering 1331/1366 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 61/66 places, 1331/1366 transitions.
Incomplete random walk after 10000 steps, including 34 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 447794 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :{}
Probabilistic random walk after 447794 steps, saw 69467 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1331 rows 61 cols
[2023-03-11 08:27:14] [INFO ] Computed 14 place invariants in 6 ms
[2023-03-11 08:27:14] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-11 08:27:14] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 08:27:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-11 08:27:15] [INFO ] After 504ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 08:27:15] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 08:27:15] [INFO ] After 322ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 08:27:16] [INFO ] After 775ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 313 ms.
[2023-03-11 08:27:16] [INFO ] After 1844ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 155 ms.
Support contains 9 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1331/1331 transitions.
Applied a total of 0 rules in 91 ms. Remains 61 /61 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 61/61 places, 1331/1331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1331/1331 transitions.
Applied a total of 0 rules in 115 ms. Remains 61 /61 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-11 08:27:17] [INFO ] Invariant cache hit.
[2023-03-11 08:27:17] [INFO ] Implicit Places using invariants in 929 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 955 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/61 places, 1331/1331 transitions.
Applied a total of 0 rules in 105 ms. Remains 60 /60 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1176 ms. Remains : 60/61 places, 1331/1331 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 432267 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :{}
Probabilistic random walk after 432267 steps, saw 67385 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1331 rows 60 cols
[2023-03-11 08:27:21] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-11 08:27:21] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-11 08:27:21] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 08:27:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-11 08:27:22] [INFO ] After 482ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 08:27:22] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 08:27:22] [INFO ] After 222ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 08:27:22] [INFO ] After 679ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 249 ms.
[2023-03-11 08:27:23] [INFO ] After 1495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 88 ms.
Support contains 9 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1331/1331 transitions.
Applied a total of 0 rules in 84 ms. Remains 60 /60 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 60/60 places, 1331/1331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1331/1331 transitions.
Applied a total of 0 rules in 73 ms. Remains 60 /60 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-11 08:27:23] [INFO ] Invariant cache hit.
[2023-03-11 08:27:24] [INFO ] Implicit Places using invariants in 893 ms returned []
[2023-03-11 08:27:24] [INFO ] Invariant cache hit.
[2023-03-11 08:27:24] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 08:27:25] [INFO ] Implicit Places using invariants and state equation in 1394 ms returned []
Implicit Place search using SMT with State Equation took 2311 ms to find 0 implicit places.
[2023-03-11 08:27:25] [INFO ] Redundant transitions in 156 ms returned []
[2023-03-11 08:27:25] [INFO ] Invariant cache hit.
[2023-03-11 08:27:26] [INFO ] Dead Transitions using invariants and state equation in 722 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3284 ms. Remains : 60/60 places, 1331/1331 transitions.
Applied a total of 0 rules in 75 ms. Remains 60 /60 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-11 08:27:26] [INFO ] Invariant cache hit.
[2023-03-11 08:27:26] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-11 08:27:26] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 08:27:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 61 ms returned sat
[2023-03-11 08:27:27] [INFO ] After 567ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 08:27:28] [INFO ] After 1070ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 295 ms.
[2023-03-11 08:27:28] [INFO ] After 1594ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(((!p0&&X(F((!p1&&F(!p2)))))||G((F(!p2)&&F(!p1))))) U p0))'
Support contains 17 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 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 89 transition count 1434
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 81 transition count 1433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 80 transition count 1433
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 18 place count 80 transition count 1431
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 22 place count 78 transition count 1431
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 27 place count 73 transition count 1376
Iterating global reduction 3 with 5 rules applied. Total rules applied 32 place count 73 transition count 1376
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 72 transition count 1375
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 71 transition count 1375
Applied a total of 36 rules in 241 ms. Remains 71 /89 variables (removed 18) and now considering 1375/1442 (removed 67) transitions.
// Phase 1: matrix 1375 rows 71 cols
[2023-03-11 08:27:29] [INFO ] Computed 12 place invariants in 13 ms
[2023-03-11 08:27:29] [INFO ] Implicit Places using invariants in 471 ms returned []
[2023-03-11 08:27:29] [INFO ] Invariant cache hit.
[2023-03-11 08:27:30] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-11 08:27:30] [INFO ] Implicit Places using invariants and state equation in 927 ms returned []
Implicit Place search using SMT with State Equation took 1402 ms to find 0 implicit places.
[2023-03-11 08:27:30] [INFO ] Redundant transitions in 257 ms returned []
[2023-03-11 08:27:30] [INFO ] Invariant cache hit.
[2023-03-11 08:27:31] [INFO ] Dead Transitions using invariants and state equation in 664 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/89 places, 1375/1442 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2574 ms. Remains : 71/89 places, 1375/1442 transitions.
Stuttering acceptance computed with spot in 472 ms :[p2, (NOT p0), (OR p1 p2), (OR (NOT p0) p2 p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 2}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(AND (EQ s15 1) (EQ s20 1) (EQ s25 1) (EQ s30 1) (EQ s36 1) (EQ s43 1) (EQ s46 1) (EQ s53 1) (EQ s56 1) (EQ s63 1) (EQ s68 1)), p0:(AND (EQ s1 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 24 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-01 finished in 3152 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((p1 U (p2||X(p3))))||p0))))'
Support contains 22 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 1387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 1387
Applied a total of 10 rules in 11 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2023-03-11 08:27:32] [INFO ] Computed 12 place invariants in 18 ms
[2023-03-11 08:27:32] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-11 08:27:32] [INFO ] Invariant cache hit.
[2023-03-11 08:27:32] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-11 08:27:33] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 843 ms to find 0 implicit places.
[2023-03-11 08:27:33] [INFO ] Invariant cache hit.
[2023-03-11 08:27:33] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/89 places, 1387/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1429 ms. Remains : 84/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s19 0) (EQ s25 0) (EQ s31 0) (EQ s37 0) (EQ s43 0) (EQ s47 0) (EQ s55 0) (EQ s59 0) (EQ s67 0) (EQ s71 0) (EQ s80 0)), p2:(AND (EQ s17 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3780 reset in 1252 ms.
Product exploration explored 100000 steps with 343 reset in 244 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 584 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter sensitive) to 4 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 453 resets, run finished after 444 ms. (steps per millisecond=22 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 08:27:36] [INFO ] Invariant cache hit.
[2023-03-11 08:27:36] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 08:27:36] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-11 08:27:36] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X p0)), (G (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (G (NOT (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (F (AND (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 1039 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Support contains 21 out of 84 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Applied a total of 0 rules in 11 ms. Remains 84 /84 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
[2023-03-11 08:27:38] [INFO ] Invariant cache hit.
[2023-03-11 08:27:38] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-03-11 08:27:38] [INFO ] Invariant cache hit.
[2023-03-11 08:27:39] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-11 08:27:39] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 842 ms to find 0 implicit places.
[2023-03-11 08:27:39] [INFO ] Invariant cache hit.
[2023-03-11 08:27:39] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1458 ms. Remains : 84/84 places, 1387/1387 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 423 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 466 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Finished Best-First random walk after 3449 steps, including 12 resets, run visited all 4 properties in 13 ms. (steps per millisecond=265 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p3))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 458 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 2046 reset in 634 ms.
Product exploration explored 100000 steps with 1736 reset in 573 ms.
Built C files in :
/tmp/ltsmin13401468024835778118
[2023-03-11 08:27:43] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13401468024835778118
Running compilation step : cd /tmp/ltsmin13401468024835778118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin13401468024835778118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin13401468024835778118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 21 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Applied a total of 0 rules in 14 ms. Remains 84 /84 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
[2023-03-11 08:27:46] [INFO ] Invariant cache hit.
[2023-03-11 08:27:46] [INFO ] Implicit Places using invariants in 256 ms returned []
[2023-03-11 08:27:46] [INFO ] Invariant cache hit.
[2023-03-11 08:27:47] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-11 08:27:47] [INFO ] Implicit Places using invariants and state equation in 669 ms returned []
Implicit Place search using SMT with State Equation took 953 ms to find 0 implicit places.
[2023-03-11 08:27:47] [INFO ] Invariant cache hit.
[2023-03-11 08:27:48] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1629 ms. Remains : 84/84 places, 1387/1387 transitions.
Built C files in :
/tmp/ltsmin9135554966189584865
[2023-03-11 08:27:48] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9135554966189584865
Running compilation step : cd /tmp/ltsmin9135554966189584865;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin9135554966189584865;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin9135554966189584865;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 08:27:51] [INFO ] Flatten gal took : 186 ms
[2023-03-11 08:27:52] [INFO ] Flatten gal took : 163 ms
[2023-03-11 08:27:52] [INFO ] Time to serialize gal into /tmp/LTL7883916218011010551.gal : 48 ms
[2023-03-11 08:27:52] [INFO ] Time to serialize properties into /tmp/LTL7340692282762284475.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7883916218011010551.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4745078222376113486.hoa' '-atoms' '/tmp/LTL7340692282762284475.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7340692282762284475.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4745078222376113486.hoa
Detected timeout of ITS tools.
[2023-03-11 08:28:07] [INFO ] Flatten gal took : 208 ms
[2023-03-11 08:28:07] [INFO ] Flatten gal took : 152 ms
[2023-03-11 08:28:07] [INFO ] Time to serialize gal into /tmp/LTL9218774692515919743.gal : 21 ms
[2023-03-11 08:28:07] [INFO ] Time to serialize properties into /tmp/LTL12417894794889144578.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9218774692515919743.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12417894794889144578.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((p20==0)||(p27==0))||((p34==0)||(p41==0)))||(((p48==0)||(p52==0))||((p62==0)||(p66==0))))")||(("((p76==0)||(p80==0))")||((...497
Formula 0 simplified : G(F(!"(((((p17==1)&&(p24==1))&&((p34==1)&&(p38==1)))&&(((p48==1)&&(p52==1))&&((p62==1)&&(p69==1))))&&(((p76==1)&&(p80==1))&&(p90==1)...487
Detected timeout of ITS tools.
[2023-03-11 08:28:22] [INFO ] Flatten gal took : 170 ms
[2023-03-11 08:28:22] [INFO ] Applying decomposition
[2023-03-11 08:28:23] [INFO ] Flatten gal took : 148 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14885340129686513843.txt' '-o' '/tmp/graph14885340129686513843.bin' '-w' '/tmp/graph14885340129686513843.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14885340129686513843.bin' '-l' '-1' '-v' '-w' '/tmp/graph14885340129686513843.weights' '-q' '0' '-e' '0.001'
[2023-03-11 08:28:23] [INFO ] Decomposing Gal with order
[2023-03-11 08:28:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:28:24] [INFO ] Removed a total of 12828 redundant transitions.
[2023-03-11 08:28:24] [INFO ] Flatten gal took : 529 ms
[2023-03-11 08:28:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 145 ms.
[2023-03-11 08:28:24] [INFO ] Time to serialize gal into /tmp/LTL11525817370294580750.gal : 20 ms
[2023-03-11 08:28:24] [INFO ] Time to serialize properties into /tmp/LTL9785158895955951882.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11525817370294580750.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9785158895955951882.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((u2.p20==0)||(i1.u4.p27==0))||((i1.u6.p34==0)||(u8.p41==0)))||(((u10.p48==0)||(i1.u11.p52==0))||((i1.u14.p62==0)||(i1.u15....707
Formula 0 simplified : G(F(!"(((((i1.u1.p17==1)&&(i2.u3.p24==1))&&((i1.u6.p34==1)&&(i1.u7.p38==1)))&&(((u10.p48==1)&&(i1.u11.p52==1))&&((i1.u14.p62==1)&&(u...697
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13199890709885100305
[2023-03-11 08:28:39] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13199890709885100305
Running compilation step : cd /tmp/ltsmin13199890709885100305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin13199890709885100305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin13199890709885100305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AutonomousCar-PT-10a-LTLFireability-02 finished in 70655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p1 U p2))&&p0)))'
Support contains 7 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 85 transition count 1398
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 85 transition count 1398
Applied a total of 8 rules in 31 ms. Remains 85 /89 variables (removed 4) and now considering 1398/1442 (removed 44) transitions.
// Phase 1: matrix 1398 rows 85 cols
[2023-03-11 08:28:42] [INFO ] Computed 12 place invariants in 8 ms
[2023-03-11 08:28:43] [INFO ] Implicit Places using invariants in 948 ms returned []
[2023-03-11 08:28:43] [INFO ] Invariant cache hit.
[2023-03-11 08:28:44] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-11 08:28:44] [INFO ] Implicit Places using invariants and state equation in 1143 ms returned []
Implicit Place search using SMT with State Equation took 2093 ms to find 0 implicit places.
[2023-03-11 08:28:44] [INFO ] Invariant cache hit.
[2023-03-11 08:28:45] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/89 places, 1398/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2711 ms. Remains : 85/89 places, 1398/1442 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), true]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(AND (EQ s1 1) (EQ s2 1) (EQ s26 1) (EQ s80 1)), p1:(EQ s36 1), p0:(AND (EQ s1 1) (EQ s13 1) (EQ s54 1) (EQ s80 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-03 finished in 2936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 11 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 1387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 1387
Applied a total of 10 rules in 14 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2023-03-11 08:28:45] [INFO ] Computed 12 place invariants in 18 ms
[2023-03-11 08:28:46] [INFO ] Implicit Places using invariants in 521 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 529 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/89 places, 1387/1442 transitions.
Applied a total of 0 rules in 11 ms. Remains 83 /83 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 554 ms. Remains : 83/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s18 1) (EQ s22 1) (EQ s30 1) (EQ s36 1) (EQ s42 1) (EQ s46 1) (EQ s54 1) (EQ s60 1) (EQ s66 1) (EQ s70 1) (EQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 299 steps with 0 reset in 11 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-04 finished in 715 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (!p0&&G(F(p1))&&(!p2||F(!p3)))))'
Support contains 21 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 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 89 transition count 1432
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 79 transition count 1432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 79 transition count 1430
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 24 place count 77 transition count 1430
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 73 transition count 1386
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 73 transition count 1386
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 72 transition count 1386
Applied a total of 34 rules in 159 ms. Remains 72 /89 variables (removed 17) and now considering 1386/1442 (removed 56) transitions.
// Phase 1: matrix 1386 rows 72 cols
[2023-03-11 08:28:46] [INFO ] Computed 12 place invariants in 15 ms
[2023-03-11 08:28:47] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-11 08:28:47] [INFO ] Invariant cache hit.
[2023-03-11 08:28:47] [INFO ] State equation strengthened by 315 read => feed constraints.
[2023-03-11 08:28:47] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 1008 ms to find 0 implicit places.
[2023-03-11 08:28:47] [INFO ] Redundant transitions in 81 ms returned []
[2023-03-11 08:28:47] [INFO ] Invariant cache hit.
[2023-03-11 08:28:48] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/89 places, 1386/1442 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1872 ms. Remains : 72/89 places, 1386/1442 transitions.
Stuttering acceptance computed with spot in 431 ms :[(OR (NOT p1) p0 (AND p2 p3)), (NOT p1), (NOT p1), (AND (NOT p0) p3), (OR (AND (NOT p1) p3) (AND p2 p3) (AND p0 p3)), (AND (NOT p1) p3), (AND (NOT p1) p3)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2 p3), acceptance={} source=4 dest: 3}, { cond=(OR (AND p0 p3) (AND p2 p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) p3), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s2 1) (EQ s50 1) (EQ s68 1)), p1:(AND (EQ s1 1) (EQ s6 1) (EQ s52 1) (EQ s68 1)), p2:(AND (EQ s16 1) (EQ s21 1) (EQ s28 1) (EQ s31 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-05 finished in 2364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 15 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 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 89 transition count 1432
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 79 transition count 1432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 79 transition count 1430
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 24 place count 77 transition count 1430
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 73 transition count 1386
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 73 transition count 1386
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 34 place count 72 transition count 1385
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 71 transition count 1385
Applied a total of 36 rules in 215 ms. Remains 71 /89 variables (removed 18) and now considering 1385/1442 (removed 57) transitions.
// Phase 1: matrix 1385 rows 71 cols
[2023-03-11 08:28:49] [INFO ] Computed 12 place invariants in 13 ms
[2023-03-11 08:28:49] [INFO ] Implicit Places using invariants in 408 ms returned []
[2023-03-11 08:28:49] [INFO ] Invariant cache hit.
[2023-03-11 08:28:49] [INFO ] State equation strengthened by 315 read => feed constraints.
[2023-03-11 08:28:50] [INFO ] Implicit Places using invariants and state equation in 1063 ms returned []
Implicit Place search using SMT with State Equation took 1474 ms to find 0 implicit places.
[2023-03-11 08:28:50] [INFO ] Redundant transitions in 157 ms returned []
[2023-03-11 08:28:50] [INFO ] Invariant cache hit.
[2023-03-11 08:28:51] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/89 places, 1385/1442 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2341 ms. Remains : 71/89 places, 1385/1442 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s11 1) (EQ s44 1) (EQ s67 1) (OR (NEQ s17 1) (NEQ s20 1) (NEQ s25 1) (NEQ s32 1) (NEQ s35 1) (NEQ s42 1) (NEQ s45 1) (NEQ s51 1) (NE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-06 finished in 2412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p1)||p0)))'
Support contains 18 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 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 89 transition count 1432
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 79 transition count 1432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 79 transition count 1430
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 24 place count 77 transition count 1430
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 72 transition count 1375
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 72 transition count 1375
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 71 transition count 1374
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 70 transition count 1374
Applied a total of 38 rules in 132 ms. Remains 70 /89 variables (removed 19) and now considering 1374/1442 (removed 68) transitions.
// Phase 1: matrix 1374 rows 70 cols
[2023-03-11 08:28:51] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-11 08:28:51] [INFO ] Implicit Places using invariants in 275 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 291 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/89 places, 1374/1442 transitions.
Applied a total of 0 rules in 90 ms. Remains 69 /69 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 526 ms. Remains : 69/89 places, 1374/1442 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s16 0) (EQ s19 0) (EQ s24 0) (EQ s31 0) (EQ s36 0) (EQ s39 0) (EQ s44 0) (EQ s49 0) (EQ s56 0) (EQ s59 0) (EQ s66 0)), p1:(OR (EQ s16 0) (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1315 reset in 432 ms.
Product exploration explored 100000 steps with 377 reset in 219 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), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 209 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 569 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 1374 rows 69 cols
[2023-03-11 08:28:53] [INFO ] Computed 11 place invariants in 8 ms
[2023-03-11 08:28:53] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:28:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-11 08:28:53] [INFO ] After 40ms 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 p0 p1), (X p1), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 4 factoid took 203 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10a-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLFireability-07 finished in 2378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 15 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 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 89 transition count 1433
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 80 transition count 1433
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 80 transition count 1431
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 78 transition count 1431
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 73 transition count 1376
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 73 transition count 1376
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 72 transition count 1376
Applied a total of 34 rules in 172 ms. Remains 72 /89 variables (removed 17) and now considering 1376/1442 (removed 66) transitions.
// Phase 1: matrix 1376 rows 72 cols
[2023-03-11 08:28:53] [INFO ] Computed 12 place invariants in 11 ms
[2023-03-11 08:28:54] [INFO ] Implicit Places using invariants in 516 ms returned []
[2023-03-11 08:28:54] [INFO ] Invariant cache hit.
[2023-03-11 08:28:54] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-11 08:28:55] [INFO ] Implicit Places using invariants and state equation in 794 ms returned []
Implicit Place search using SMT with State Equation took 1321 ms to find 0 implicit places.
[2023-03-11 08:28:55] [INFO ] Redundant transitions in 92 ms returned []
[2023-03-11 08:28:55] [INFO ] Invariant cache hit.
[2023-03-11 08:28:55] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/89 places, 1376/1442 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2094 ms. Remains : 72/89 places, 1376/1442 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s2 0) (EQ s44 0) (EQ s68 0)), p1:(AND (EQ s18 1) (EQ s23 1) (EQ s28 1) (EQ s33 1) (EQ s38 1) (EQ s41 1) (EQ s49 1) (EQ s54 1) (EQ s59...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-08 finished in 2324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 89 transition count 1431
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 78 transition count 1431
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 22 place count 78 transition count 1430
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 77 transition count 1430
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 72 transition count 1375
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 72 transition count 1375
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 70 transition count 1373
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 69 transition count 1373
Applied a total of 40 rules in 226 ms. Remains 69 /89 variables (removed 20) and now considering 1373/1442 (removed 69) transitions.
// Phase 1: matrix 1373 rows 69 cols
[2023-03-11 08:28:56] [INFO ] Computed 12 place invariants in 15 ms
[2023-03-11 08:28:57] [INFO ] Implicit Places using invariants in 1009 ms returned []
[2023-03-11 08:28:57] [INFO ] Invariant cache hit.
[2023-03-11 08:28:57] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-11 08:28:58] [INFO ] Implicit Places using invariants and state equation in 1446 ms returned []
Implicit Place search using SMT with State Equation took 2457 ms to find 0 implicit places.
[2023-03-11 08:28:58] [INFO ] Redundant transitions in 89 ms returned []
[2023-03-11 08:28:58] [INFO ] Invariant cache hit.
[2023-03-11 08:28:59] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/89 places, 1373/1442 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3307 ms. Remains : 69/89 places, 1373/1442 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s7 1) (EQ s28 1) (EQ s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-09 finished in 3362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(G(p0)))&&F(p1)))))'
Support contains 15 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 1387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 1387
Applied a total of 10 rules in 12 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2023-03-11 08:28:59] [INFO ] Computed 12 place invariants in 16 ms
[2023-03-11 08:28:59] [INFO ] Implicit Places using invariants in 498 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 502 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/89 places, 1387/1442 transitions.
Applied a total of 0 rules in 9 ms. Remains 83 /83 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 523 ms. Remains : 83/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 407 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s18 1) (EQ s24 1) (EQ s30 1) (EQ s34 1) (EQ s40 1) (EQ s46 1) (EQ s52 1) (EQ s58 1) (EQ s66 1) (EQ s70 1) (EQ s79 1)), p0:(AND (EQ s16 1) (EQ ...], 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]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-10 finished in 965 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&X((G(!p0)||(F(p1)&&X(F(!p2))))))))'
Support contains 17 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 85 transition count 1398
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 85 transition count 1398
Applied a total of 8 rules in 23 ms. Remains 85 /89 variables (removed 4) and now considering 1398/1442 (removed 44) transitions.
// Phase 1: matrix 1398 rows 85 cols
[2023-03-11 08:29:00] [INFO ] Computed 12 place invariants in 18 ms
[2023-03-11 08:29:00] [INFO ] Implicit Places using invariants in 547 ms returned []
[2023-03-11 08:29:00] [INFO ] Invariant cache hit.
[2023-03-11 08:29:01] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-11 08:29:01] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1568 ms to find 0 implicit places.
[2023-03-11 08:29:01] [INFO ] Invariant cache hit.
[2023-03-11 08:29:02] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/89 places, 1398/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2211 ms. Remains : 85/89 places, 1398/1442 transitions.
Stuttering acceptance computed with spot in 305 ms :[p0, p0, true, (OR (AND p0 (NOT p1)) (AND p0 p2)), (NOT p1), p2, (AND (NOT p1) p0), (AND p2 p0)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(NOT p0), acceptance={} source=3 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 6}], [{ cond=(AND p0 p2), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s17 1) (EQ s23 1) (EQ s29 1) (EQ s37 1) (EQ s43 1) (EQ s49 1) (EQ s55 1) (EQ s62 1) (EQ s66 1) (EQ s74 1) (EQ s81 1)), p1:(AND (EQ s1 1) (EQ s...], 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, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 331 reset in 257 ms.
Product exploration explored 100000 steps with 1735 reset in 484 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 458 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 432 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), (NOT p1), p2, (AND (NOT p1) p0), (AND p2 p0)]
Incomplete random walk after 10000 steps, including 466 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 08:29:05] [INFO ] Invariant cache hit.
[2023-03-11 08:29:05] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-11 08:29:05] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-11 08:29:05] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-11 08:29:05] [INFO ] After 434ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-11 08:29:05] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-11 08:29:05] [INFO ] After 211ms SMT Verify possible using 313 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-11 08:29:06] [INFO ] After 538ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 178 ms.
[2023-03-11 08:29:06] [INFO ] After 1204ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 93 ms.
Support contains 17 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Graph (complete) has 1138 edges and 85 vertex of which 84 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 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 84 transition count 1385
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 23 place count 75 transition count 1384
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 74 transition count 1384
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 24 place count 74 transition count 1381
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 71 transition count 1381
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 70 transition count 1380
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 70 transition count 1380
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 69 transition count 1379
Free-agglomeration rule applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 44 place count 69 transition count 1369
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 3 with 100 rules applied. Total rules applied 144 place count 59 transition count 1279
Applied a total of 144 rules in 201 ms. Remains 59 /85 variables (removed 26) and now considering 1279/1398 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 59/85 places, 1279/1398 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1279 rows 59 cols
[2023-03-11 08:29:06] [INFO ] Computed 14 place invariants in 13 ms
[2023-03-11 08:29:06] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-11 08:29:07] [INFO ] After 334ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 08:29:07] [INFO ] State equation strengthened by 221 read => feed constraints.
[2023-03-11 08:29:07] [INFO ] After 71ms SMT Verify possible using 221 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:29:07] [INFO ] After 447ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:29:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-11 08:29:07] [INFO ] After 374ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 08:29:07] [INFO ] After 51ms SMT Verify possible using 221 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 08:29:07] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-11 08:29:07] [INFO ] After 582ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 1279/1279 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 57 transition count 1277
Applied a total of 4 rules in 93 ms. Remains 57 /59 variables (removed 2) and now considering 1277/1279 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 57/59 places, 1277/1279 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 730614 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :{}
Probabilistic random walk after 730614 steps, saw 90200 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1277 rows 57 cols
[2023-03-11 08:29:11] [INFO ] Computed 14 place invariants in 13 ms
[2023-03-11 08:29:11] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-11 08:29:11] [INFO ] After 386ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 08:29:11] [INFO ] State equation strengthened by 221 read => feed constraints.
[2023-03-11 08:29:11] [INFO ] After 57ms SMT Verify possible using 221 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:29:11] [INFO ] After 504ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:29:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-11 08:29:12] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 08:29:12] [INFO ] After 52ms SMT Verify possible using 221 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 08:29:12] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-11 08:29:12] [INFO ] After 514ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 31 ms.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1277/1277 transitions.
Applied a total of 0 rules in 83 ms. Remains 57 /57 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 57/57 places, 1277/1277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1277/1277 transitions.
Applied a total of 0 rules in 121 ms. Remains 57 /57 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
[2023-03-11 08:29:12] [INFO ] Invariant cache hit.
[2023-03-11 08:29:13] [INFO ] Implicit Places using invariants in 708 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 711 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 56/57 places, 1277/1277 transitions.
Applied a total of 0 rules in 85 ms. Remains 56 /56 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 917 ms. Remains : 56/57 places, 1277/1277 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Finished Best-First random walk after 6271 steps, including 15 resets, run visited all 1 properties in 9 ms. (steps per millisecond=696 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (G (NOT (AND p2 p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p2 (NOT p0))), (F p1), (F (AND (NOT p1) p0)), (F p2)]
Knowledge based reduction with 7 factoid took 527 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 296 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 15 out of 85 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Applied a total of 0 rules in 12 ms. Remains 85 /85 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
// Phase 1: matrix 1398 rows 85 cols
[2023-03-11 08:29:14] [INFO ] Computed 12 place invariants in 17 ms
[2023-03-11 08:29:15] [INFO ] Implicit Places using invariants in 530 ms returned []
[2023-03-11 08:29:15] [INFO ] Invariant cache hit.
[2023-03-11 08:29:15] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-11 08:29:16] [INFO ] Implicit Places using invariants and state equation in 881 ms returned []
Implicit Place search using SMT with State Equation took 1426 ms to find 0 implicit places.
[2023-03-11 08:29:16] [INFO ] Invariant cache hit.
[2023-03-11 08:29:16] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1934 ms. Remains : 85/85 places, 1398/1398 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 462 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 513513 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :{}
Probabilistic random walk after 513513 steps, saw 65466 distinct states, run finished after 3001 ms. (steps per millisecond=171 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 08:29:20] [INFO ] Invariant cache hit.
[2023-03-11 08:29:20] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-11 08:29:20] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 08:29:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-11 08:29:21] [INFO ] After 522ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 08:29:21] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-11 08:29:21] [INFO ] After 218ms SMT Verify possible using 313 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 08:29:21] [INFO ] After 552ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 176 ms.
[2023-03-11 08:29:21] [INFO ] After 1333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 174 ms.
Support contains 15 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Graph (complete) has 1138 edges and 85 vertex of which 84 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 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 84 transition count 1385
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 23 place count 75 transition count 1384
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 74 transition count 1384
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 24 place count 74 transition count 1381
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 71 transition count 1381
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 69 transition count 1369
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 69 transition count 1369
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 68 transition count 1368
Free-agglomeration rule applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 45 place count 68 transition count 1359
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 3 with 99 rules applied. Total rules applied 144 place count 59 transition count 1269
Applied a total of 144 rules in 169 ms. Remains 59 /85 variables (removed 26) and now considering 1269/1398 (removed 129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 59/85 places, 1269/1398 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 1269 rows 59 cols
[2023-03-11 08:29:22] [INFO ] Computed 14 place invariants in 13 ms
[2023-03-11 08:29:22] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-11 08:29:22] [INFO ] After 356ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 08:29:22] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-11 08:29:23] [INFO ] After 115ms SMT Verify possible using 211 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:29:23] [INFO ] After 558ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:29:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 96 ms returned sat
[2023-03-11 08:29:23] [INFO ] After 346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 08:29:23] [INFO ] After 51ms SMT Verify possible using 211 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 08:29:23] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-11 08:29:23] [INFO ] After 703ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 32 ms.
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 1269/1269 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 57 transition count 1267
Applied a total of 4 rules in 98 ms. Remains 57 /59 variables (removed 2) and now considering 1267/1269 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 57/59 places, 1267/1269 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 687944 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :{}
Probabilistic random walk after 687944 steps, saw 94690 distinct states, run finished after 3001 ms. (steps per millisecond=229 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1267 rows 57 cols
[2023-03-11 08:29:27] [INFO ] Computed 14 place invariants in 12 ms
[2023-03-11 08:29:27] [INFO ] [Real]Absence check using 14 positive place invariants in 33 ms returned sat
[2023-03-11 08:29:27] [INFO ] After 372ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 08:29:27] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-11 08:29:27] [INFO ] After 53ms SMT Verify possible using 211 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:29:27] [INFO ] After 507ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:29:27] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-11 08:29:27] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 08:29:28] [INFO ] After 50ms SMT Verify possible using 211 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 08:29:28] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-11 08:29:28] [INFO ] After 543ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1267/1267 transitions.
Applied a total of 0 rules in 78 ms. Remains 57 /57 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 57/57 places, 1267/1267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1267/1267 transitions.
Applied a total of 0 rules in 61 ms. Remains 57 /57 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
[2023-03-11 08:29:28] [INFO ] Invariant cache hit.
[2023-03-11 08:29:29] [INFO ] Implicit Places using invariants in 778 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 795 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 56/57 places, 1267/1267 transitions.
Applied a total of 0 rules in 136 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 992 ms. Remains : 56/57 places, 1267/1267 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 704928 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :{}
Probabilistic random walk after 704928 steps, saw 97327 distinct states, run finished after 3002 ms. (steps per millisecond=234 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1267 rows 56 cols
[2023-03-11 08:29:32] [INFO ] Computed 13 place invariants in 14 ms
[2023-03-11 08:29:32] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-11 08:29:32] [INFO ] After 358ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 08:29:32] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-11 08:29:32] [INFO ] After 51ms SMT Verify possible using 211 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:29:32] [INFO ] After 458ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:29:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-11 08:29:33] [INFO ] After 373ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 08:29:33] [INFO ] After 49ms SMT Verify possible using 211 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 08:29:33] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-11 08:29:33] [INFO ] After 566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1267/1267 transitions.
Applied a total of 0 rules in 78 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 56/56 places, 1267/1267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1267/1267 transitions.
Applied a total of 0 rules in 64 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
[2023-03-11 08:29:33] [INFO ] Invariant cache hit.
[2023-03-11 08:29:34] [INFO ] Implicit Places using invariants in 876 ms returned []
[2023-03-11 08:29:34] [INFO ] Invariant cache hit.
[2023-03-11 08:29:34] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-11 08:29:35] [INFO ] Implicit Places using invariants and state equation in 1251 ms returned []
Implicit Place search using SMT with State Equation took 2129 ms to find 0 implicit places.
[2023-03-11 08:29:35] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-11 08:29:35] [INFO ] Invariant cache hit.
[2023-03-11 08:29:36] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2810 ms. Remains : 56/56 places, 1267/1267 transitions.
Applied a total of 0 rules in 64 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-11 08:29:36] [INFO ] Invariant cache hit.
[2023-03-11 08:29:36] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-11 08:29:36] [INFO ] After 338ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 08:29:36] [INFO ] After 406ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-11 08:29:36] [INFO ] After 489ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 2 factoid took 217 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 318 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 319 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 2360 reset in 783 ms.
Product exploration explored 100000 steps with 722 reset in 320 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 303 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 15 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 85 transition count 1398
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 10 place count 85 transition count 1400
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 85 transition count 1400
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 84 transition count 1389
Deduced a syphon composed of 12 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 84 transition count 1389
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 84 transition count 1389
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 84 transition count 1392
Deduced a syphon composed of 14 places in 0 ms
Applied a total of 16 rules in 185 ms. Remains 84 /85 variables (removed 1) and now considering 1392/1398 (removed 6) transitions.
[2023-03-11 08:29:39] [INFO ] Redundant transitions in 48 ms returned []
// Phase 1: matrix 1392 rows 84 cols
[2023-03-11 08:29:39] [INFO ] Computed 12 place invariants in 8 ms
[2023-03-11 08:29:40] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/85 places, 1392/1398 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 767 ms. Remains : 84/85 places, 1392/1398 transitions.
Built C files in :
/tmp/ltsmin7553699982070346113
[2023-03-11 08:29:40] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7553699982070346113
Running compilation step : cd /tmp/ltsmin7553699982070346113;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7553699982070346113;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7553699982070346113;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 15 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 84 transition count 1387
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 1387
Applied a total of 2 rules in 23 ms. Remains 84 /85 variables (removed 1) and now considering 1387/1398 (removed 11) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2023-03-11 08:29:43] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-11 08:29:44] [INFO ] Implicit Places using invariants in 474 ms returned []
[2023-03-11 08:29:44] [INFO ] Invariant cache hit.
[2023-03-11 08:29:44] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-11 08:29:44] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 1236 ms to find 0 implicit places.
[2023-03-11 08:29:44] [INFO ] Invariant cache hit.
[2023-03-11 08:29:45] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/85 places, 1387/1398 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1844 ms. Remains : 84/85 places, 1387/1398 transitions.
Built C files in :
/tmp/ltsmin10893961066735539348
[2023-03-11 08:29:45] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10893961066735539348
Running compilation step : cd /tmp/ltsmin10893961066735539348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin10893961066735539348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin10893961066735539348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 08:29:48] [INFO ] Flatten gal took : 159 ms
[2023-03-11 08:29:48] [INFO ] Flatten gal took : 162 ms
[2023-03-11 08:29:48] [INFO ] Time to serialize gal into /tmp/LTL13420335864805312294.gal : 23 ms
[2023-03-11 08:29:48] [INFO ] Time to serialize properties into /tmp/LTL17024652301803289472.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13420335864805312294.gal' '-t' 'CGAL' '-hoa' '/tmp/aut335961362329111746.hoa' '-atoms' '/tmp/LTL17024652301803289472.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17024652301803289472.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut335961362329111746.hoa
Detected timeout of ITS tools.
[2023-03-11 08:30:04] [INFO ] Flatten gal took : 212 ms
[2023-03-11 08:30:04] [INFO ] Flatten gal took : 184 ms
[2023-03-11 08:30:04] [INFO ] Time to serialize gal into /tmp/LTL10469570319761194004.gal : 20 ms
[2023-03-11 08:30:04] [INFO ] Time to serialize properties into /tmp/LTL4607242812058915644.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10469570319761194004.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4607242812058915644.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((X((G("(((((p17!=1)||(p24!=1))||((p31!=1)||(p41!=1)))||(((p48!=1)||(p55!=1))||((p62!=1)||(p69!=1))))||(((p73!=1)||(p83!=1))||(p90...411
Formula 0 simplified : X(!"(((((p17!=1)||(p24!=1))||((p31!=1)||(p41!=1)))||(((p48!=1)||(p55!=1))||((p62!=1)||(p69!=1))))||(((p73!=1)||(p83!=1))||(p90!=1)))...397
Detected timeout of ITS tools.
[2023-03-11 08:30:19] [INFO ] Flatten gal took : 171 ms
[2023-03-11 08:30:19] [INFO ] Applying decomposition
[2023-03-11 08:30:20] [INFO ] Flatten gal took : 156 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12314077702321979949.txt' '-o' '/tmp/graph12314077702321979949.bin' '-w' '/tmp/graph12314077702321979949.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12314077702321979949.bin' '-l' '-1' '-v' '-w' '/tmp/graph12314077702321979949.weights' '-q' '0' '-e' '0.001'
[2023-03-11 08:30:20] [INFO ] Decomposing Gal with order
[2023-03-11 08:30:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:30:21] [INFO ] Removed a total of 12445 redundant transitions.
[2023-03-11 08:30:21] [INFO ] Flatten gal took : 277 ms
[2023-03-11 08:30:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 94 ms.
[2023-03-11 08:30:21] [INFO ] Time to serialize gal into /tmp/LTL5279786446910820996.gal : 10 ms
[2023-03-11 08:30:21] [INFO ] Time to serialize properties into /tmp/LTL12548258824452722716.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5279786446910820996.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12548258824452722716.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((X((G("(((((i6.u1.p17!=1)||(i6.u4.p24!=1))||((i6.u7.p31!=1)||(i3.u11.p41!=1)))||(((i4.u14.p48!=1)||(i6.u17.p55!=1))||((i5.u20.p62...615
Formula 0 simplified : X(!"(((((i6.u1.p17!=1)||(i6.u4.p24!=1))||((i6.u7.p31!=1)||(i3.u11.p41!=1)))||(((i4.u14.p48!=1)||(i6.u17.p55!=1))||((i5.u20.p62!=1)||...601
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9535359750658881112
[2023-03-11 08:30:36] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9535359750658881112
Running compilation step : cd /tmp/ltsmin9535359750658881112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin9535359750658881112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin9535359750658881112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AutonomousCar-PT-10a-LTLFireability-11 finished in 99046 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 11 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 1387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 1387
Applied a total of 10 rules in 12 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
[2023-03-11 08:30:39] [INFO ] Invariant cache hit.
[2023-03-11 08:30:40] [INFO ] Implicit Places using invariants in 721 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 725 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/89 places, 1387/1442 transitions.
Applied a total of 0 rules in 12 ms. Remains 83 /83 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 749 ms. Remains : 83/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-12 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}]], initial=1, aps=[p0:(OR (EQ s16 0) (EQ s22 0) (EQ s28 0) (EQ s34 0) (EQ s40 0) (EQ s48 0) (EQ s54 0) (EQ s60 0) (EQ s66 0) (EQ s72 0) (EQ s79 0))], 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 6153 ms.
Product exploration explored 100000 steps with 50000 reset in 5966 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 p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10a-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLFireability-12 finished in 13141 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(p0)) U G(p1)) U G(!p2)))'
Support contains 22 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 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 89 transition count 1433
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 80 transition count 1433
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 80 transition count 1431
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 78 transition count 1431
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 73 transition count 1376
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 73 transition count 1376
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 72 transition count 1375
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 36 place count 71 transition count 1375
Applied a total of 36 rules in 203 ms. Remains 71 /89 variables (removed 18) and now considering 1375/1442 (removed 67) transitions.
// Phase 1: matrix 1375 rows 71 cols
[2023-03-11 08:30:52] [INFO ] Computed 12 place invariants in 11 ms
[2023-03-11 08:30:52] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-11 08:30:52] [INFO ] Invariant cache hit.
[2023-03-11 08:30:53] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-11 08:30:53] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
[2023-03-11 08:30:53] [INFO ] Redundant transitions in 87 ms returned []
[2023-03-11 08:30:53] [INFO ] Invariant cache hit.
[2023-03-11 08:30:54] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/89 places, 1375/1442 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1673 ms. Remains : 71/89 places, 1375/1442 transitions.
Stuttering acceptance computed with spot in 281 ms :[p2, (NOT p0), (AND (NOT p0) p1), (NOT p1), (AND (NOT p0) p1 p2)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p2 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s17 1) (EQ s20 1) (EQ s27 1) (EQ s30 1) (EQ s35 1) (EQ s41 1) (EQ s46 1) (EQ s53 1) (EQ s56 1) (EQ s63 1) (EQ s68 1)), p1:(AND (EQ s15 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 33388 reset in 4809 ms.
Product exploration explored 100000 steps with 33425 reset in 4806 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 1717 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 263 ms :[p2, (NOT p0), (AND (NOT p0) p1), (NOT p1), (AND (NOT p0) p1 p2)]
Incomplete random walk after 10000 steps, including 552 resets, run finished after 524 ms. (steps per millisecond=19 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-11 08:31:06] [INFO ] Invariant cache hit.
[2023-03-11 08:31:07] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-11 08:31:07] [INFO ] After 493ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-11 08:31:07] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-11 08:31:07] [INFO ] After 99ms SMT Verify possible using 305 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 08:31:07] [INFO ] After 668ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 08:31:07] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-11 08:31:08] [INFO ] After 492ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-11 08:31:08] [INFO ] After 213ms SMT Verify possible using 305 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2023-03-11 08:31:08] [INFO ] After 622ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 297 ms.
[2023-03-11 08:31:09] [INFO ] After 1519ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 103 ms.
Support contains 22 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 1375/1375 transitions.
Graph (complete) has 1116 edges and 71 vertex of which 70 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 70 transition count 1372
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 69 transition count 1370
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 69 transition count 1370
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 15 place count 69 transition count 1360
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 115 place count 59 transition count 1270
Applied a total of 115 rules in 169 ms. Remains 59 /71 variables (removed 12) and now considering 1270/1375 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 59/71 places, 1270/1375 transitions.
Incomplete random walk after 10000 steps, including 52 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1270 rows 59 cols
[2023-03-11 08:31:09] [INFO ] Computed 13 place invariants in 6 ms
[2023-03-11 08:31:09] [INFO ] [Real]Absence check using 12 positive place invariants in 41 ms returned sat
[2023-03-11 08:31:09] [INFO ] [Real]Absence check using 12 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 08:31:10] [INFO ] After 342ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 08:31:10] [INFO ] State equation strengthened by 212 read => feed constraints.
[2023-03-11 08:31:10] [INFO ] After 53ms SMT Verify possible using 212 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:31:10] [INFO ] After 480ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:31:10] [INFO ] [Nat]Absence check using 12 positive place invariants in 1 ms returned sat
[2023-03-11 08:31:10] [INFO ] [Nat]Absence check using 12 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 08:31:10] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 08:31:10] [INFO ] After 49ms SMT Verify possible using 212 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 08:31:10] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-11 08:31:10] [INFO ] After 581ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 1270/1270 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 57 transition count 1268
Applied a total of 4 rules in 82 ms. Remains 57 /59 variables (removed 2) and now considering 1268/1270 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 57/59 places, 1268/1270 transitions.
Incomplete random walk after 10000 steps, including 73 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 733148 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :{}
Probabilistic random walk after 733148 steps, saw 101059 distinct states, run finished after 3001 ms. (steps per millisecond=244 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1268 rows 57 cols
[2023-03-11 08:31:14] [INFO ] Computed 13 place invariants in 25 ms
[2023-03-11 08:31:14] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-11 08:31:14] [INFO ] [Real]Absence check using 12 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 08:31:14] [INFO ] After 376ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 08:31:14] [INFO ] State equation strengthened by 212 read => feed constraints.
[2023-03-11 08:31:14] [INFO ] After 105ms SMT Verify possible using 212 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:31:14] [INFO ] After 520ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:31:14] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-11 08:31:14] [INFO ] [Nat]Absence check using 12 positive and 1 generalized place invariants in 21 ms returned sat
[2023-03-11 08:31:15] [INFO ] After 340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 08:31:15] [INFO ] After 72ms SMT Verify possible using 212 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 08:31:15] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-11 08:31:15] [INFO ] After 671ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1268/1268 transitions.
Applied a total of 0 rules in 75 ms. Remains 57 /57 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 57/57 places, 1268/1268 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1268/1268 transitions.
Applied a total of 0 rules in 80 ms. Remains 57 /57 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
[2023-03-11 08:31:15] [INFO ] Invariant cache hit.
[2023-03-11 08:31:16] [INFO ] Implicit Places using invariants in 840 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 843 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 56/57 places, 1268/1268 transitions.
Applied a total of 0 rules in 99 ms. Remains 56 /56 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1022 ms. Remains : 56/57 places, 1268/1268 transitions.
Incomplete random walk after 10000 steps, including 88 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 689533 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :{}
Probabilistic random walk after 689533 steps, saw 95845 distinct states, run finished after 3001 ms. (steps per millisecond=229 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1268 rows 56 cols
[2023-03-11 08:31:19] [INFO ] Computed 12 place invariants in 16 ms
[2023-03-11 08:31:19] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-11 08:31:20] [INFO ] After 409ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 08:31:20] [INFO ] State equation strengthened by 212 read => feed constraints.
[2023-03-11 08:31:20] [INFO ] After 55ms SMT Verify possible using 212 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:31:20] [INFO ] After 547ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:31:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-11 08:31:20] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 08:31:20] [INFO ] After 51ms SMT Verify possible using 212 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 08:31:20] [INFO ] After 127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-11 08:31:20] [INFO ] After 546ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 36 ms.
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1268/1268 transitions.
Applied a total of 0 rules in 88 ms. Remains 56 /56 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 56/56 places, 1268/1268 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1268/1268 transitions.
Applied a total of 0 rules in 79 ms. Remains 56 /56 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
[2023-03-11 08:31:21] [INFO ] Invariant cache hit.
[2023-03-11 08:31:22] [INFO ] Implicit Places using invariants in 912 ms returned []
[2023-03-11 08:31:22] [INFO ] Invariant cache hit.
[2023-03-11 08:31:22] [INFO ] State equation strengthened by 212 read => feed constraints.
[2023-03-11 08:31:23] [INFO ] Implicit Places using invariants and state equation in 1259 ms returned []
Implicit Place search using SMT with State Equation took 2173 ms to find 0 implicit places.
[2023-03-11 08:31:23] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-11 08:31:23] [INFO ] Invariant cache hit.
[2023-03-11 08:31:23] [INFO ] Dead Transitions using invariants and state equation in 622 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2947 ms. Remains : 56/56 places, 1268/1268 transitions.
Applied a total of 0 rules in 73 ms. Remains 56 /56 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-11 08:31:24] [INFO ] Invariant cache hit.
[2023-03-11 08:31:24] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-11 08:31:24] [INFO ] After 344ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 08:31:24] [INFO ] After 411ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-11 08:31:24] [INFO ] After 540ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (G (NOT (AND p2 (NOT p0) p1))), (G (NOT (AND p2 p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F p1), (F (AND (NOT p0) p1)), (F p2), (F (AND p2 (NOT p1))), (F (AND p2 (NOT p0) (NOT p1))), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 25 factoid took 1882 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 286 ms :[p2, (NOT p0), (AND (NOT p0) p1), (NOT p1)]
Stuttering acceptance computed with spot in 201 ms :[p2, (NOT p0), (AND (NOT p0) p1), (NOT p1)]
Support contains 22 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 1375/1375 transitions.
Applied a total of 0 rules in 159 ms. Remains 71 /71 variables (removed 0) and now considering 1375/1375 (removed 0) transitions.
// Phase 1: matrix 1375 rows 71 cols
[2023-03-11 08:31:27] [INFO ] Computed 12 place invariants in 10 ms
[2023-03-11 08:31:27] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-11 08:31:27] [INFO ] Invariant cache hit.
[2023-03-11 08:31:27] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-11 08:31:28] [INFO ] Implicit Places using invariants and state equation in 669 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
[2023-03-11 08:31:28] [INFO ] Redundant transitions in 69 ms returned []
[2023-03-11 08:31:28] [INFO ] Invariant cache hit.
[2023-03-11 08:31:28] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1671 ms. Remains : 71/71 places, 1375/1375 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 1082 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 268 ms :[p2, (NOT p0), (AND (NOT p0) p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 551 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 455292 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :{}
Probabilistic random walk after 455292 steps, saw 56540 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-11 08:31:33] [INFO ] Invariant cache hit.
[2023-03-11 08:31:33] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-11 08:31:34] [INFO ] After 417ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-11 08:31:34] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-11 08:31:34] [INFO ] After 75ms SMT Verify possible using 305 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 08:31:34] [INFO ] After 572ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 08:31:34] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-11 08:31:35] [INFO ] After 657ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 08:31:35] [INFO ] After 335ms SMT Verify possible using 305 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 08:31:36] [INFO ] After 977ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 335 ms.
[2023-03-11 08:31:36] [INFO ] After 2034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 104 ms.
Support contains 22 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 1375/1375 transitions.
Graph (complete) has 1116 edges and 71 vertex of which 70 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 70 transition count 1372
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 69 transition count 1370
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 69 transition count 1370
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 15 place count 69 transition count 1360
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 115 place count 59 transition count 1270
Applied a total of 115 rules in 144 ms. Remains 59 /71 variables (removed 12) and now considering 1270/1375 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 59/71 places, 1270/1375 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 1270 rows 59 cols
[2023-03-11 08:31:37] [INFO ] Computed 13 place invariants in 6 ms
[2023-03-11 08:31:37] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-11 08:31:37] [INFO ] [Real]Absence check using 12 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 08:31:37] [INFO ] After 351ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 08:31:37] [INFO ] State equation strengthened by 212 read => feed constraints.
[2023-03-11 08:31:37] [INFO ] After 55ms SMT Verify possible using 212 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:31:37] [INFO ] After 437ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:31:37] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-11 08:31:37] [INFO ] [Nat]Absence check using 12 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 08:31:37] [INFO ] After 376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 08:31:37] [INFO ] After 49ms SMT Verify possible using 212 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 08:31:38] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-11 08:31:38] [INFO ] After 611ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 39 ms.
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 1270/1270 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 57 transition count 1268
Applied a total of 4 rules in 92 ms. Remains 57 /59 variables (removed 2) and now considering 1268/1270 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 57/59 places, 1268/1270 transitions.
Incomplete random walk after 10000 steps, including 88 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 702246 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :{}
Probabilistic random walk after 702246 steps, saw 97023 distinct states, run finished after 3001 ms. (steps per millisecond=234 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1268 rows 57 cols
[2023-03-11 08:31:41] [INFO ] Computed 13 place invariants in 12 ms
[2023-03-11 08:31:41] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-11 08:31:41] [INFO ] [Real]Absence check using 12 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 08:31:41] [INFO ] After 378ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 08:31:41] [INFO ] State equation strengthened by 212 read => feed constraints.
[2023-03-11 08:31:42] [INFO ] After 97ms SMT Verify possible using 212 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:31:42] [INFO ] After 528ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:31:42] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-11 08:31:42] [INFO ] [Nat]Absence check using 12 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 08:31:42] [INFO ] After 336ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 08:31:42] [INFO ] After 49ms SMT Verify possible using 212 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 08:31:42] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-11 08:31:42] [INFO ] After 546ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 37 ms.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1268/1268 transitions.
Applied a total of 0 rules in 74 ms. Remains 57 /57 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 57/57 places, 1268/1268 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1268/1268 transitions.
Applied a total of 0 rules in 73 ms. Remains 57 /57 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
[2023-03-11 08:31:42] [INFO ] Invariant cache hit.
[2023-03-11 08:31:43] [INFO ] Implicit Places using invariants in 873 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 877 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 56/57 places, 1268/1268 transitions.
Applied a total of 0 rules in 98 ms. Remains 56 /56 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1049 ms. Remains : 56/57 places, 1268/1268 transitions.
Incomplete random walk after 10000 steps, including 70 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Finished Best-First random walk after 3385 steps, including 2 resets, run visited all 1 properties in 6 ms. (steps per millisecond=564 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F p0), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 13 factoid took 1051 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 252 ms :[p2, (NOT p0), (AND (NOT p0) p1), (NOT p1)]
Stuttering acceptance computed with spot in 290 ms :[p2, (NOT p0), (AND (NOT p0) p1), (NOT p1)]
Stuttering acceptance computed with spot in 312 ms :[p2, (NOT p0), (AND (NOT p0) p1), (NOT p1)]
Product exploration explored 100000 steps with 156 reset in 147 ms.
Product exploration explored 100000 steps with 1360 reset in 429 ms.
Built C files in :
/tmp/ltsmin13592460954415138424
[2023-03-11 08:31:46] [INFO ] Computing symmetric may disable matrix : 1375 transitions.
[2023-03-11 08:31:46] [INFO ] Computation of Complete disable matrix. took 415 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:31:47] [INFO ] Computing symmetric may enable matrix : 1375 transitions.
[2023-03-11 08:31:47] [INFO ] Computation of Complete enable matrix. took 87 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:31:47] [INFO ] Computing Do-Not-Accords matrix : 1375 transitions.
[2023-03-11 08:31:47] [INFO ] Computation of Completed DNA matrix. took 94 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:31:47] [INFO ] Built C files in 1299ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13592460954415138424
Running compilation step : cd /tmp/ltsmin13592460954415138424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin13592460954415138424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin13592460954415138424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 22 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 1375/1375 transitions.
Applied a total of 0 rules in 125 ms. Remains 71 /71 variables (removed 0) and now considering 1375/1375 (removed 0) transitions.
// Phase 1: matrix 1375 rows 71 cols
[2023-03-11 08:31:50] [INFO ] Computed 12 place invariants in 9 ms
[2023-03-11 08:31:51] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-11 08:31:51] [INFO ] Invariant cache hit.
[2023-03-11 08:31:51] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-11 08:31:51] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
[2023-03-11 08:31:51] [INFO ] Redundant transitions in 84 ms returned []
[2023-03-11 08:31:51] [INFO ] Invariant cache hit.
[2023-03-11 08:31:52] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1672 ms. Remains : 71/71 places, 1375/1375 transitions.
Built C files in :
/tmp/ltsmin12838249295733638542
[2023-03-11 08:31:52] [INFO ] Computing symmetric may disable matrix : 1375 transitions.
[2023-03-11 08:31:52] [INFO ] Computation of Complete disable matrix. took 364 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:31:52] [INFO ] Computing symmetric may enable matrix : 1375 transitions.
[2023-03-11 08:31:52] [INFO ] Computation of Complete enable matrix. took 47 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:31:53] [INFO ] Computing Do-Not-Accords matrix : 1375 transitions.
[2023-03-11 08:31:53] [INFO ] Computation of Completed DNA matrix. took 95 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:31:53] [INFO ] Built C files in 1160ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12838249295733638542
Running compilation step : cd /tmp/ltsmin12838249295733638542;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin12838249295733638542;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin12838249295733638542;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 08:31:56] [INFO ] Flatten gal took : 183 ms
[2023-03-11 08:31:57] [INFO ] Flatten gal took : 188 ms
[2023-03-11 08:31:57] [INFO ] Time to serialize gal into /tmp/LTL15016525428455289655.gal : 21 ms
[2023-03-11 08:31:57] [INFO ] Time to serialize properties into /tmp/LTL17033444185932496992.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15016525428455289655.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14374071412359685844.hoa' '-atoms' '/tmp/LTL17033444185932496992.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17033444185932496992.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14374071412359685844.hoa
Detected timeout of ITS tools.
[2023-03-11 08:32:12] [INFO ] Flatten gal took : 247 ms
[2023-03-11 08:32:12] [INFO ] Flatten gal took : 187 ms
[2023-03-11 08:32:12] [INFO ] Time to serialize gal into /tmp/LTL7560999344553289157.gal : 19 ms
[2023-03-11 08:32:12] [INFO ] Time to serialize properties into /tmp/LTL8464610609043350642.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7560999344553289157.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8464610609043350642.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((((G(F("(((p1==1)&&(p7==1))&&((p49==1)&&(p89==1)))")))U(G("(((((p17==1)&&(p27==1))&&((p31==1)&&(p38==1)))&&(((p45==1)&&(p55==1))&&((...355
Formula 0 simplified : (FG!"(((p1==1)&&(p7==1))&&((p49==1)&&(p89==1)))" R F!"(((((p17==1)&&(p27==1))&&((p31==1)&&(p38==1)))&&(((p45==1)&&(p55==1))&&((p62==...341
Detected timeout of ITS tools.
[2023-03-11 08:32:28] [INFO ] Flatten gal took : 194 ms
[2023-03-11 08:32:28] [INFO ] Applying decomposition
[2023-03-11 08:32:28] [INFO ] Flatten gal took : 188 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6090723750421319104.txt' '-o' '/tmp/graph6090723750421319104.bin' '-w' '/tmp/graph6090723750421319104.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6090723750421319104.bin' '-l' '-1' '-v' '-w' '/tmp/graph6090723750421319104.weights' '-q' '0' '-e' '0.001'
[2023-03-11 08:32:28] [INFO ] Decomposing Gal with order
[2023-03-11 08:32:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:32:29] [INFO ] Removed a total of 12319 redundant transitions.
[2023-03-11 08:32:29] [INFO ] Flatten gal took : 234 ms
[2023-03-11 08:32:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 71 ms.
[2023-03-11 08:32:29] [INFO ] Time to serialize gal into /tmp/LTL1862147096220768250.gal : 9 ms
[2023-03-11 08:32:29] [INFO ] Time to serialize properties into /tmp/LTL11853222347193893530.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1862147096220768250.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11853222347193893530.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((((G(F("(((i2.u20.p1==1)&&(i2.u20.p7==1))&&((i1.u11.p49==1)&&(i2.u20.p89==1)))")))U(G("(((((i0.u0.p17==1)&&(i1.u3.p27==1))&&((i1.u4....525
Formula 0 simplified : (FG!"(((i2.u20.p1==1)&&(i2.u20.p7==1))&&((i1.u11.p49==1)&&(i2.u20.p89==1)))" R F!"(((((i0.u0.p17==1)&&(i1.u3.p27==1))&&((i1.u4.p31==...511
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17560975767675801396
[2023-03-11 08:32:44] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17560975767675801396
Running compilation step : cd /tmp/ltsmin17560975767675801396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17560975767675801396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17560975767675801396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AutonomousCar-PT-10a-LTLFireability-13 finished in 114929 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(!p0)||(!p0&&F(!p1))))||((G(!p0)||(!p0&&F(!p1)))&&X(F((!p2||X(!p3)))))))'
Support contains 19 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 86 transition count 1409
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 86 transition count 1409
Applied a total of 6 rules in 11 ms. Remains 86 /89 variables (removed 3) and now considering 1409/1442 (removed 33) transitions.
// Phase 1: matrix 1409 rows 86 cols
[2023-03-11 08:32:47] [INFO ] Computed 12 place invariants in 19 ms
[2023-03-11 08:32:47] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-11 08:32:47] [INFO ] Invariant cache hit.
[2023-03-11 08:32:48] [INFO ] State equation strengthened by 323 read => feed constraints.
[2023-03-11 08:32:48] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1232 ms to find 0 implicit places.
[2023-03-11 08:32:48] [INFO ] Invariant cache hit.
[2023-03-11 08:32:49] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 86/89 places, 1409/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1826 ms. Remains : 86/89 places, 1409/1442 transitions.
Stuttering acceptance computed with spot in 426 ms :[p0, true, (AND p2 p3 p0), (AND p1 p0), (AND p2 p3 p0), (AND p2 p3), p1]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p2 p3), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2 p3), acceptance={} source=4 dest: 5}], [{ cond=(AND p2 p3), acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s6 1) (EQ s33 1) (EQ s81 1)), p1:(AND (EQ s20 1) (EQ s24 1) (EQ s30 1) (EQ s38 1) (EQ s42 1) (EQ s51 1) (EQ s55 1) (EQ s61 1) (EQ s6...], 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 50000 reset in 6747 ms.
Product exploration explored 100000 steps with 50000 reset in 6702 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p0 p2 p3)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p2)))
Knowledge based reduction with 12 factoid took 401 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLFireability-14 finished in 16171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X((X(X(p1))||G(p2)))))))'
Support contains 17 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 85 transition count 1398
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 85 transition count 1398
Applied a total of 8 rules in 10 ms. Remains 85 /89 variables (removed 4) and now considering 1398/1442 (removed 44) transitions.
// Phase 1: matrix 1398 rows 85 cols
[2023-03-11 08:33:03] [INFO ] Computed 12 place invariants in 14 ms
[2023-03-11 08:33:04] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-11 08:33:04] [INFO ] Invariant cache hit.
[2023-03-11 08:33:04] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-11 08:33:04] [INFO ] Implicit Places using invariants and state equation in 734 ms returned []
Implicit Place search using SMT with State Equation took 1152 ms to find 0 implicit places.
[2023-03-11 08:33:04] [INFO ] Invariant cache hit.
[2023-03-11 08:33:05] [INFO ] Dead Transitions using invariants and state equation in 499 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/89 places, 1398/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1662 ms. Remains : 85/89 places, 1398/1442 transitions.
Stuttering acceptance computed with spot in 459 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}, { cond=p2, acceptance={} source=4 dest: 7}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p2), acceptance={} source=8 dest: 6}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s19 1) (EQ s23 1) (EQ s32 1) (EQ s36 1) (EQ s42 1) (EQ s48 1) (EQ s54 1) (EQ s60 1) (EQ s68 1) (EQ s74 1) (EQ s81 1)), p2:(AND (EQ s1 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16696 reset in 2857 ms.
Product exploration explored 100000 steps with 16651 reset in 2795 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 333 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 459 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Incomplete random walk after 10000 steps, including 446 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 08:33:12] [INFO ] Invariant cache hit.
[2023-03-11 08:33:12] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-11 08:33:13] [INFO ] After 395ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-11 08:33:13] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-11 08:33:13] [INFO ] After 67ms SMT Verify possible using 313 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 08:33:13] [INFO ] After 502ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 08:33:13] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-11 08:33:13] [INFO ] After 515ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-11 08:33:14] [INFO ] After 197ms SMT Verify possible using 313 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-11 08:33:14] [INFO ] After 473ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 164 ms.
[2023-03-11 08:33:14] [INFO ] After 1210ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 70 ms.
Support contains 17 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Graph (complete) has 1138 edges and 85 vertex of which 84 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 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 84 transition count 1385
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 22 place count 75 transition count 1385
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 22 place count 75 transition count 1382
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 72 transition count 1382
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 71 transition count 1381
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 71 transition count 1381
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 70 transition count 1380
Free-agglomeration rule applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 43 place count 70 transition count 1369
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 101 rules applied. Total rules applied 144 place count 59 transition count 1279
Applied a total of 144 rules in 171 ms. Remains 59 /85 variables (removed 26) and now considering 1279/1398 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 59/85 places, 1279/1398 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1279 rows 59 cols
[2023-03-11 08:33:15] [INFO ] Computed 14 place invariants in 13 ms
[2023-03-11 08:33:15] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 08:33:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-11 08:33:15] [INFO ] After 462ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 08:33:15] [INFO ] State equation strengthened by 221 read => feed constraints.
[2023-03-11 08:33:15] [INFO ] After 115ms SMT Verify possible using 221 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 08:33:15] [INFO ] After 281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-11 08:33:16] [INFO ] After 916ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 48 ms.
Support contains 6 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 1279/1279 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 57 transition count 1277
Applied a total of 4 rules in 87 ms. Remains 57 /59 variables (removed 2) and now considering 1277/1279 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 57/59 places, 1277/1279 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 610057 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 610057 steps, saw 72434 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1277 rows 57 cols
[2023-03-11 08:33:19] [INFO ] Computed 14 place invariants in 14 ms
[2023-03-11 08:33:19] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 08:33:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 67 ms returned sat
[2023-03-11 08:33:20] [INFO ] After 330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 08:33:20] [INFO ] State equation strengthened by 221 read => feed constraints.
[2023-03-11 08:33:20] [INFO ] After 66ms SMT Verify possible using 221 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 08:33:20] [INFO ] After 202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-11 08:33:20] [INFO ] After 807ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 6 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1277/1277 transitions.
Applied a total of 0 rules in 71 ms. Remains 57 /57 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 57/57 places, 1277/1277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1277/1277 transitions.
Applied a total of 0 rules in 61 ms. Remains 57 /57 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
[2023-03-11 08:33:20] [INFO ] Invariant cache hit.
[2023-03-11 08:33:21] [INFO ] Implicit Places using invariants in 879 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 894 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 56/57 places, 1277/1277 transitions.
Applied a total of 0 rules in 114 ms. Remains 56 /56 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1069 ms. Remains : 56/57 places, 1277/1277 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 615493 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 615493 steps, saw 72920 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1277 rows 56 cols
[2023-03-11 08:33:24] [INFO ] Computed 13 place invariants in 13 ms
[2023-03-11 08:33:24] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 08:33:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-11 08:33:25] [INFO ] After 470ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 08:33:25] [INFO ] State equation strengthened by 221 read => feed constraints.
[2023-03-11 08:33:25] [INFO ] After 124ms SMT Verify possible using 221 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 08:33:25] [INFO ] After 259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-11 08:33:25] [INFO ] After 869ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 43 ms.
Support contains 6 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1277/1277 transitions.
Applied a total of 0 rules in 70 ms. Remains 56 /56 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 56/56 places, 1277/1277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1277/1277 transitions.
Applied a total of 0 rules in 66 ms. Remains 56 /56 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
[2023-03-11 08:33:26] [INFO ] Invariant cache hit.
[2023-03-11 08:33:26] [INFO ] Implicit Places using invariants in 935 ms returned []
[2023-03-11 08:33:26] [INFO ] Invariant cache hit.
[2023-03-11 08:33:27] [INFO ] State equation strengthened by 221 read => feed constraints.
[2023-03-11 08:33:28] [INFO ] Implicit Places using invariants and state equation in 1190 ms returned []
Implicit Place search using SMT with State Equation took 2140 ms to find 0 implicit places.
[2023-03-11 08:33:28] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-11 08:33:28] [INFO ] Invariant cache hit.
[2023-03-11 08:33:28] [INFO ] Dead Transitions using invariants and state equation in 529 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2804 ms. Remains : 56/56 places, 1277/1277 transitions.
Applied a total of 0 rules in 63 ms. Remains 56 /56 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-11 08:33:28] [INFO ] Invariant cache hit.
[2023-03-11 08:33:28] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 08:33:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-11 08:33:29] [INFO ] After 359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 08:33:29] [INFO ] After 497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-11 08:33:29] [INFO ] After 641ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT p0))), (G (NOT (AND p2 (NOT p1))))]
False Knowledge obtained : [(F p0), (F p2)]
Knowledge based reduction with 6 factoid took 434 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 343 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 15 out of 85 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Applied a total of 0 rules in 10 ms. Remains 85 /85 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
// Phase 1: matrix 1398 rows 85 cols
[2023-03-11 08:33:30] [INFO ] Computed 12 place invariants in 15 ms
[2023-03-11 08:33:31] [INFO ] Implicit Places using invariants in 505 ms returned []
[2023-03-11 08:33:31] [INFO ] Invariant cache hit.
[2023-03-11 08:33:31] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-11 08:33:32] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1465 ms to find 0 implicit places.
[2023-03-11 08:33:32] [INFO ] Invariant cache hit.
[2023-03-11 08:33:32] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2162 ms. Remains : 85/85 places, 1398/1398 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 215 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 463 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 541738 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :{}
Probabilistic random walk after 541738 steps, saw 68486 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 08:33:36] [INFO ] Invariant cache hit.
[2023-03-11 08:33:36] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-11 08:33:36] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 08:33:36] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-11 08:33:37] [INFO ] After 434ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 08:33:37] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-11 08:33:37] [INFO ] After 112ms SMT Verify possible using 313 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 08:33:37] [INFO ] After 316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-11 08:33:37] [INFO ] After 921ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 63 ms.
Support contains 15 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Graph (complete) has 1138 edges and 85 vertex of which 84 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 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 84 transition count 1385
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 22 place count 75 transition count 1385
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 22 place count 75 transition count 1382
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 72 transition count 1382
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 70 transition count 1370
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 70 transition count 1370
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 34 place count 69 transition count 1369
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 44 place count 69 transition count 1359
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 144 place count 59 transition count 1269
Applied a total of 144 rules in 184 ms. Remains 59 /85 variables (removed 26) and now considering 1269/1398 (removed 129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 59/85 places, 1269/1398 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1269 rows 59 cols
[2023-03-11 08:33:38] [INFO ] Computed 14 place invariants in 13 ms
[2023-03-11 08:33:38] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:33:38] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-11 08:33:38] [INFO ] After 388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 08:33:38] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-11 08:33:38] [INFO ] After 50ms SMT Verify possible using 211 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 08:33:38] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-11 08:33:38] [INFO ] After 596ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 43 ms.
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 1269/1269 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 57 transition count 1267
Applied a total of 4 rules in 80 ms. Remains 57 /59 variables (removed 2) and now considering 1267/1269 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 57/59 places, 1267/1269 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 694271 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :{}
Probabilistic random walk after 694271 steps, saw 95810 distinct states, run finished after 3001 ms. (steps per millisecond=231 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1267 rows 57 cols
[2023-03-11 08:33:42] [INFO ] Computed 14 place invariants in 13 ms
[2023-03-11 08:33:42] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:33:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-11 08:33:42] [INFO ] After 340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 08:33:42] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-11 08:33:42] [INFO ] After 82ms SMT Verify possible using 211 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 08:33:42] [INFO ] After 166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-11 08:33:42] [INFO ] After 598ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 37 ms.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1267/1267 transitions.
Applied a total of 0 rules in 82 ms. Remains 57 /57 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 57/57 places, 1267/1267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1267/1267 transitions.
Applied a total of 0 rules in 61 ms. Remains 57 /57 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
[2023-03-11 08:33:43] [INFO ] Invariant cache hit.
[2023-03-11 08:33:43] [INFO ] Implicit Places using invariants in 788 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 794 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 56/57 places, 1267/1267 transitions.
Applied a total of 0 rules in 105 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 973 ms. Remains : 56/57 places, 1267/1267 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 689712 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :{}
Probabilistic random walk after 689712 steps, saw 95041 distinct states, run finished after 3001 ms. (steps per millisecond=229 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1267 rows 56 cols
[2023-03-11 08:33:47] [INFO ] Computed 13 place invariants in 14 ms
[2023-03-11 08:33:47] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:33:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-11 08:33:47] [INFO ] After 418ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 08:33:47] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-11 08:33:47] [INFO ] After 48ms SMT Verify possible using 211 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 08:33:47] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-11 08:33:47] [INFO ] After 660ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 38 ms.
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1267/1267 transitions.
Applied a total of 0 rules in 69 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 56/56 places, 1267/1267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1267/1267 transitions.
Applied a total of 0 rules in 64 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
[2023-03-11 08:33:48] [INFO ] Invariant cache hit.
[2023-03-11 08:33:48] [INFO ] Implicit Places using invariants in 953 ms returned []
[2023-03-11 08:33:49] [INFO ] Invariant cache hit.
[2023-03-11 08:33:49] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-11 08:33:50] [INFO ] Implicit Places using invariants and state equation in 1318 ms returned []
Implicit Place search using SMT with State Equation took 2321 ms to find 0 implicit places.
[2023-03-11 08:33:50] [INFO ] Redundant transitions in 64 ms returned []
[2023-03-11 08:33:50] [INFO ] Invariant cache hit.
[2023-03-11 08:33:50] [INFO ] Dead Transitions using invariants and state equation in 508 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2978 ms. Remains : 56/56 places, 1267/1267 transitions.
Applied a total of 0 rules in 84 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-11 08:33:51] [INFO ] Invariant cache hit.
[2023-03-11 08:33:51] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:33:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-11 08:33:51] [INFO ] After 373ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 08:33:51] [INFO ] After 435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-11 08:33:51] [INFO ] After 535ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 215 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 357 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 345 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 16675 reset in 2814 ms.
Product exploration explored 100000 steps with 16669 reset in 2777 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 15 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 1398/1398 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 85 transition count 1398
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 9 place count 85 transition count 1400
Deduced a syphon composed of 11 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 85 transition count 1400
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 84 transition count 1389
Deduced a syphon composed of 11 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 84 transition count 1389
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 84 transition count 1389
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 84 transition count 1392
Deduced a syphon composed of 13 places in 1 ms
Applied a total of 15 rules in 170 ms. Remains 84 /85 variables (removed 1) and now considering 1392/1398 (removed 6) transitions.
[2023-03-11 08:33:59] [INFO ] Redundant transitions in 68 ms returned []
// Phase 1: matrix 1392 rows 84 cols
[2023-03-11 08:33:59] [INFO ] Computed 12 place invariants in 16 ms
[2023-03-11 08:33:59] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/85 places, 1392/1398 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 838 ms. Remains : 84/85 places, 1392/1398 transitions.
Built C files in :
/tmp/ltsmin8559532380814041857
[2023-03-11 08:33:59] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8559532380814041857
Running compilation step : cd /tmp/ltsmin8559532380814041857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8559532380814041857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8559532380814041857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 15 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 84 transition count 1387
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 1387
Applied a total of 2 rules in 17 ms. Remains 84 /85 variables (removed 1) and now considering 1387/1398 (removed 11) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2023-03-11 08:34:02] [INFO ] Computed 12 place invariants in 17 ms
[2023-03-11 08:34:03] [INFO ] Implicit Places using invariants in 518 ms returned []
[2023-03-11 08:34:03] [INFO ] Invariant cache hit.
[2023-03-11 08:34:03] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-11 08:34:04] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1406 ms to find 0 implicit places.
[2023-03-11 08:34:04] [INFO ] Invariant cache hit.
[2023-03-11 08:34:04] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/85 places, 1387/1398 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1984 ms. Remains : 84/85 places, 1387/1398 transitions.
Built C files in :
/tmp/ltsmin11181254658501999018
[2023-03-11 08:34:04] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11181254658501999018
Running compilation step : cd /tmp/ltsmin11181254658501999018;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin11181254658501999018;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin11181254658501999018;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 08:34:08] [INFO ] Flatten gal took : 139 ms
[2023-03-11 08:34:08] [INFO ] Flatten gal took : 145 ms
[2023-03-11 08:34:08] [INFO ] Time to serialize gal into /tmp/LTL2857940517924186433.gal : 32 ms
[2023-03-11 08:34:08] [INFO ] Time to serialize properties into /tmp/LTL3793544369353927629.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2857940517924186433.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16478686883984758657.hoa' '-atoms' '/tmp/LTL3793544369353927629.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3793544369353927629.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16478686883984758657.hoa
Detected timeout of ITS tools.
[2023-03-11 08:34:23] [INFO ] Flatten gal took : 146 ms
[2023-03-11 08:34:23] [INFO ] Flatten gal took : 150 ms
[2023-03-11 08:34:23] [INFO ] Time to serialize gal into /tmp/LTL16445744027520381865.gal : 20 ms
[2023-03-11 08:34:23] [INFO ] Time to serialize properties into /tmp/LTL5661050993582067388.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16445744027520381865.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5661050993582067388.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G((X((X(X("(((p1==0)||(p6==0))||((p28==0)||(p89==0)))")))||(G("(((p1==1)&&(p5==1))&&((p30==1)&&(p89==1)))"))))||("(((((p20==1)&&(...274
Formula 0 simplified : XF(!"(((((p20==1)&&(p24==1))&&((p34==1)&&(p38==1)))&&(((p45==1)&&(p52==1))&&((p59==1)&&(p66==1))))&&(((p76==1)&&(p83==1))&&(p90==1))...260
Detected timeout of ITS tools.
[2023-03-11 08:34:39] [INFO ] Flatten gal took : 173 ms
[2023-03-11 08:34:39] [INFO ] Applying decomposition
[2023-03-11 08:34:39] [INFO ] Flatten gal took : 170 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14768770163083753707.txt' '-o' '/tmp/graph14768770163083753707.bin' '-w' '/tmp/graph14768770163083753707.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14768770163083753707.bin' '-l' '-1' '-v' '-w' '/tmp/graph14768770163083753707.weights' '-q' '0' '-e' '0.001'
[2023-03-11 08:34:40] [INFO ] Decomposing Gal with order
[2023-03-11 08:34:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:34:40] [INFO ] Removed a total of 12957 redundant transitions.
[2023-03-11 08:34:40] [INFO ] Flatten gal took : 262 ms
[2023-03-11 08:34:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 74 ms.
[2023-03-11 08:34:40] [INFO ] Time to serialize gal into /tmp/LTL946311431778942763.gal : 10 ms
[2023-03-11 08:34:40] [INFO ] Time to serialize properties into /tmp/LTL5633936875175616120.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL946311431778942763.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5633936875175616120.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(G((X((X(X("(((i10.u0.p1==0)||(i10.u0.p6==0))||((i4.u7.p28==0)||(i10.u0.p89==0)))")))||(G("(((i10.u0.p1==1)&&(i10.u0.p5==1))&&((i3...402
Formula 0 simplified : XF(!"(((((i1.u3.p20==1)&&(i3.u5.p24==1))&&((i4.u10.p34==1)&&(i3.u12.p38==1)))&&(((i3.u15.p45==1)&&(i3.u18.p52==1))&&((i3.u21.p59==1)...388
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13557305924809622388
[2023-03-11 08:34:55] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13557305924809622388
Running compilation step : cd /tmp/ltsmin13557305924809622388;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin13557305924809622388;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin13557305924809622388;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AutonomousCar-PT-10a-LTLFireability-15 finished in 115193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((p1 U (p2||X(p3))))||p0))))'
Found a Lengthening insensitive property : AutonomousCar-PT-10a-LTLFireability-02
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Support contains 22 out of 89 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 89/89 places, 1442/1442 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 89 transition count 1433
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 80 transition count 1432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 79 transition count 1432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 20 place count 79 transition count 1430
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 24 place count 77 transition count 1430
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 29 place count 72 transition count 1375
Iterating global reduction 3 with 5 rules applied. Total rules applied 34 place count 72 transition count 1375
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 71 transition count 1374
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 70 transition count 1374
Applied a total of 38 rules in 161 ms. Remains 70 /89 variables (removed 19) and now considering 1374/1442 (removed 68) transitions.
// Phase 1: matrix 1374 rows 70 cols
[2023-03-11 08:34:59] [INFO ] Computed 12 place invariants in 14 ms
[2023-03-11 08:34:59] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-11 08:34:59] [INFO ] Invariant cache hit.
[2023-03-11 08:34:59] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-11 08:35:00] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 978 ms to find 0 implicit places.
[2023-03-11 08:35:00] [INFO ] Invariant cache hit.
[2023-03-11 08:35:00] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 70/89 places, 1374/1442 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1670 ms. Remains : 70/89 places, 1374/1442 transitions.
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s17 0) (EQ s22 0) (EQ s27 0) (EQ s32 0) (EQ s37 0) (EQ s40 0) (EQ s47 0) (EQ s50 0) (EQ s57 0) (EQ s60 0) (EQ s67 0)), p2:(AND (EQ s15 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 210 reset in 111 ms.
Product exploration explored 100000 steps with 1118 reset in 359 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 513 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter sensitive) to 4 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 572 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 08:35:02] [INFO ] Invariant cache hit.
[2023-03-11 08:35:02] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 08:35:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-11 08:35:02] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X p0)), (G (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (G (NOT (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (F (AND (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 716 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Support contains 21 out of 70 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 1374/1374 transitions.
Applied a total of 0 rules in 9 ms. Remains 70 /70 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
[2023-03-11 08:35:03] [INFO ] Invariant cache hit.
[2023-03-11 08:35:04] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-03-11 08:35:04] [INFO ] Invariant cache hit.
[2023-03-11 08:35:04] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-11 08:35:04] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 984 ms to find 0 implicit places.
[2023-03-11 08:35:04] [INFO ] Invariant cache hit.
[2023-03-11 08:35:05] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1492 ms. Remains : 70/70 places, 1374/1374 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 369 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 547 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 4) seen :0
Finished Best-First random walk after 2161 steps, including 7 resets, run visited all 4 properties in 9 ms. (steps per millisecond=240 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p3))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 388 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 1226 reset in 387 ms.
Product exploration explored 100000 steps with 736 reset in 246 ms.
Built C files in :
/tmp/ltsmin14270080870477086186
[2023-03-11 08:35:08] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14270080870477086186
Running compilation step : cd /tmp/ltsmin14270080870477086186;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin14270080870477086186;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin14270080870477086186;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 21 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 1374/1374 transitions.
Applied a total of 0 rules in 12 ms. Remains 70 /70 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
[2023-03-11 08:35:11] [INFO ] Invariant cache hit.
[2023-03-11 08:35:11] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-03-11 08:35:11] [INFO ] Invariant cache hit.
[2023-03-11 08:35:11] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-11 08:35:11] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
[2023-03-11 08:35:11] [INFO ] Invariant cache hit.
[2023-03-11 08:35:12] [INFO ] Dead Transitions using invariants and state equation in 549 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1455 ms. Remains : 70/70 places, 1374/1374 transitions.
Built C files in :
/tmp/ltsmin16189214653545770273
[2023-03-11 08:35:12] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16189214653545770273
Running compilation step : cd /tmp/ltsmin16189214653545770273;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16189214653545770273;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16189214653545770273;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 08:35:15] [INFO ] Flatten gal took : 200 ms
[2023-03-11 08:35:16] [INFO ] Flatten gal took : 218 ms
[2023-03-11 08:35:16] [INFO ] Time to serialize gal into /tmp/LTL4953477582282193044.gal : 48 ms
[2023-03-11 08:35:16] [INFO ] Time to serialize properties into /tmp/LTL11019242641969396643.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4953477582282193044.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17320130819139851641.hoa' '-atoms' '/tmp/LTL11019242641969396643.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11019242641969396643.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17320130819139851641.hoa
Detected timeout of ITS tools.
[2023-03-11 08:35:31] [INFO ] Flatten gal took : 192 ms
[2023-03-11 08:35:31] [INFO ] Flatten gal took : 189 ms
[2023-03-11 08:35:31] [INFO ] Time to serialize gal into /tmp/LTL5395979808353680010.gal : 20 ms
[2023-03-11 08:35:31] [INFO ] Time to serialize properties into /tmp/LTL6596720505955316746.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5395979808353680010.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6596720505955316746.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((p20==0)||(p27==0))||((p34==0)||(p41==0)))||(((p48==0)||(p52==0))||((p62==0)||(p66==0))))")||(("((p76==0)||(p80==0))")||((...497
Formula 0 simplified : G(F(!"(((((p17==1)&&(p24==1))&&((p34==1)&&(p38==1)))&&(((p48==1)&&(p52==1))&&((p62==1)&&(p69==1))))&&(((p76==1)&&(p80==1))&&(p90==1)...487
Detected timeout of ITS tools.
[2023-03-11 08:35:47] [INFO ] Flatten gal took : 191 ms
[2023-03-11 08:35:47] [INFO ] Applying decomposition
[2023-03-11 08:35:47] [INFO ] Flatten gal took : 198 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16724837603632007561.txt' '-o' '/tmp/graph16724837603632007561.bin' '-w' '/tmp/graph16724837603632007561.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16724837603632007561.bin' '-l' '-1' '-v' '-w' '/tmp/graph16724837603632007561.weights' '-q' '0' '-e' '0.001'
[2023-03-11 08:35:47] [INFO ] Decomposing Gal with order
[2023-03-11 08:35:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:35:48] [INFO ] Removed a total of 12319 redundant transitions.
[2023-03-11 08:35:48] [INFO ] Flatten gal took : 254 ms
[2023-03-11 08:35:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 42 ms.
[2023-03-11 08:35:48] [INFO ] Time to serialize gal into /tmp/LTL16626086934018660867.gal : 4 ms
[2023-03-11 08:35:48] [INFO ] Time to serialize properties into /tmp/LTL10155820666745878788.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16626086934018660867.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10155820666745878788.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((u2.p20==0)||(i0.u4.p27==0))||((u6.p34==0)||(u8.p41==0)))||(((u10.p48==0)||(i0.u11.p52==0))||((u14.p62==0)||(i0.u15.p66==0...689
Formula 0 simplified : G(F(!"(((((i0.u1.p17==1)&&(i0.u3.p24==1))&&((u6.p34==1)&&(i0.u7.p38==1)))&&(((u10.p48==1)&&(i0.u11.p52==1))&&((u14.p62==1)&&(i0.u16....679
Reverse transition relation is NOT exact ! Due to transitions t533, t534, t535, t536, t537, t538, t539, t540, t541, t542, t543, t544, t545, t546, t547, t54...1968
Computing Next relation with stutter on 1.29803e+06 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16695837961248670729
[2023-03-11 08:36:03] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16695837961248670729
Running compilation step : cd /tmp/ltsmin16695837961248670729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16695837961248670729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16695837961248670729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AutonomousCar-PT-10a-LTLFireability-02 finished in 67666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&X((G(!p0)||(F(p1)&&X(F(!p2))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(p0)) U G(p1)) U G(!p2)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X((X(X(p1))||G(p2)))))))'
[2023-03-11 08:36:06] [INFO ] Flatten gal took : 183 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7946179496609577480
[2023-03-11 08:36:07] [INFO ] Computing symmetric may disable matrix : 1442 transitions.
[2023-03-11 08:36:07] [INFO ] Applying decomposition
[2023-03-11 08:36:07] [INFO ] Flatten gal took : 156 ms
[2023-03-11 08:36:07] [INFO ] Computation of Complete disable matrix. took 468 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:36:07] [INFO ] Computing symmetric may enable matrix : 1442 transitions.
[2023-03-11 08:36:07] [INFO ] Computation of Complete enable matrix. took 53 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12025253587636814444.txt' '-o' '/tmp/graph12025253587636814444.bin' '-w' '/tmp/graph12025253587636814444.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12025253587636814444.bin' '-l' '-1' '-v' '-w' '/tmp/graph12025253587636814444.weights' '-q' '0' '-e' '0.001'
[2023-03-11 08:36:07] [INFO ] Decomposing Gal with order
[2023-03-11 08:36:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:36:08] [INFO ] Computing Do-Not-Accords matrix : 1442 transitions.
[2023-03-11 08:36:08] [INFO ] Removed a total of 13033 redundant transitions.
[2023-03-11 08:36:08] [INFO ] Computation of Completed DNA matrix. took 127 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:36:08] [INFO ] Flatten gal took : 257 ms
[2023-03-11 08:36:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 61 ms.
[2023-03-11 08:36:08] [INFO ] Time to serialize gal into /tmp/LTLFireability17045092893298191711.gal : 8 ms
[2023-03-11 08:36:08] [INFO ] Time to serialize properties into /tmp/LTLFireability9087264753337747550.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17045092893298191711.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9087264753337747550.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 4 LTL properties
[2023-03-11 08:36:08] [INFO ] Built C files in 1356ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7946179496609577480
Running compilation step : cd /tmp/ltsmin7946179496609577480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !((G(F(("((((i0.u3.p20==0)||(i1.u6.p27==0))||((i2.u9.p34==0)||(i3.u12.p41==0)))||(((i5.u16.p48==0)||(i4.u18.p52==0))||((i8.u22.p62==0)...744
Formula 0 simplified : G(F(!"(((((i4.u2.p17==1)&&(i4.u5.p24==1))&&((i2.u9.p34==1)&&(i4.u11.p38==1)))&&(((i5.u16.p48==1)&&(i4.u18.p52==1))&&((i8.u22.p62==1)...734
Compilation finished in 10254 ms.
Running link step : cd /tmp/ltsmin7946179496609577480;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 150 ms.
Running LTSmin : cd /tmp/ltsmin7946179496609577480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([](((LTLAPp1==true) U ((LTLAPp2==true)||X((LTLAPp3==true)))))||(LTLAPp0==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t97, t367, t397, t489, t491, t497, t499, t521, t523, t529, t531, t747, t753, t755, t777, t779...727
Computing Next relation with stutter on 1.29803e+06 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin7946179496609577480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([](((LTLAPp1==true) U ((LTLAPp2==true)||X((LTLAPp3==true)))))||(LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7946179496609577480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((!(LTLAPp4==true)&&X(([](!(LTLAPp4==true))||(<>((LTLAPp5==true))&&X(<>(!(LTLAPp6==true))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-11 08:59:23] [INFO ] Applying decomposition
[2023-03-11 08:59:23] [INFO ] Flatten gal took : 390 ms
[2023-03-11 08:59:23] [INFO ] Decomposing Gal with order
[2023-03-11 08:59:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:59:24] [INFO ] Removed a total of 12601 redundant transitions.
[2023-03-11 08:59:24] [INFO ] Flatten gal took : 641 ms
[2023-03-11 08:59:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 65 labels/synchronizations in 81 ms.
[2023-03-11 08:59:24] [INFO ] Time to serialize gal into /tmp/LTLFireability15088848631658330703.gal : 7 ms
[2023-03-11 08:59:24] [INFO ] Time to serialize properties into /tmp/LTLFireability13376857233131461877.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15088848631658330703.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13376857233131461877.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 4 LTL properties
Checking formula 0 : !((G(F(("((((u3.p20==0)||(u4.p27==0))||((u5.p34==0)||(u6.p41==0)))||(((u7.p48==0)||(u8.p52==0))||((u9.p62==0)||(u10.p66==0))))")||(("(...621
Formula 0 simplified : G(F(!"(((((u3.p17==1)&&(u4.p24==1))&&((u5.p34==1)&&(u6.p38==1)))&&(((u7.p48==1)&&(u8.p52==1))&&((u9.p62==1)&&(u10.p69==1))))&&(((u11...611
Reverse transition relation is NOT exact ! Due to transitions t90, t210, t250, t290, t360, t404, t803, t1440, u2.t402, u3.t45, u3.t46, u3.t47, u4.t41, u4.t...448
Computing Next relation with stutter on 1.29803e+06 deadlock states
179 unique states visited
179 strongly connected components in search stack
180 transitions explored
179 items max in DFS search stack
145 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,1.46926,66324,1,0,115860,1355,1205,137420,431,7542,184270
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutonomousCar-PT-10a-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X((!("(((((u3.p17==1)&&(u4.p24==1))&&((u5.p31==1)&&(u6.p41==1)))&&(((u7.p48==1)&&(u8.p55==1))&&((u9.p62==1)&&(u10.p69==1))))&&(((u1...522
Formula 1 simplified : X("(((((u3.p17==1)&&(u4.p24==1))&&((u5.p31==1)&&(u6.p41==1)))&&(((u7.p48==1)&&(u8.p55==1))&&((u9.p62==1)&&(u10.p69==1))))&&(((u11.p7...496
Computing Next relation with stutter on 1.29803e+06 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
131 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,2.7788,115260,1,0,242210,1434,1361,264467,432,9119,360313
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA AutonomousCar-PT-10a-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((((G(F("(((u1.p1==1)&&(u2.p7==1))&&((u8.p49==1)&&(u13.p89==1)))")))U(G("(((((u3.p17==1)&&(u4.p27==1))&&((u5.p31==1)&&(u6.p38==1)))&&...442
Formula 2 simplified : (FG!"(((u1.p1==1)&&(u2.p7==1))&&((u8.p49==1)&&(u13.p89==1)))" R F!"(((((u3.p17==1)&&(u4.p27==1))&&((u5.p31==1)&&(u6.p38==1)))&&(((u7...428
Computing Next relation with stutter on 1.29803e+06 deadlock states
219 unique states visited
217 strongly connected components in search stack
232 transitions explored
219 items max in DFS search stack
204 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.82667,180720,1,0,393717,1528,1565,446317,440,11367,617259
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA AutonomousCar-PT-10a-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(G(("(((((u3.p20==1)&&(u4.p24==1))&&((u5.p34==1)&&(u6.p38==1)))&&(((u7.p45==1)&&(u8.p52==1))&&((u9.p59==1)&&(u10.p66==1))))&&(((u1...337
Formula 3 simplified : XF(!"(((((u3.p20==1)&&(u4.p24==1))&&((u5.p34==1)&&(u6.p38==1)))&&(((u7.p45==1)&&(u8.p52==1))&&((u9.p59==1)&&(u10.p66==1))))&&(((u11....323
Computing Next relation with stutter on 1.29803e+06 deadlock states
179 unique states visited
179 strongly connected components in search stack
180 transitions explored
179 items max in DFS search stack
11 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.94714,184396,1,0,403180,1815,1608,457849,442,14091,637650
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA AutonomousCar-PT-10a-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1996380 ms.

BK_STOP 1678525179407

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-10a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-10a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r005-oct2-167813593500676"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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