Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r043-smll-171620180400228.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r043-smll-171620180400228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 17:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 12 17:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.5M May 18 16:42 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 1716323310405

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=gold2023
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 202304061127
[2024-05-21 20:28:32] [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]
[2024-05-21 20:28:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:28:33] [INFO ] Load time of PNML (sax parser for PT used): 401 ms
[2024-05-21 20:28:33] [INFO ] Transformed 97 places.
[2024-05-21 20:28:33] [INFO ] Transformed 1921 transitions.
[2024-05-21 20:28:33] [INFO ] Found NUPN structural information;
[2024-05-21 20:28:33] [INFO ] Parsed PT model containing 97 places and 1921 transitions and 29152 arcs in 546 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 423 transitions
Reduce redundant transitions removed 423 transitions.
FORMULA AutonomousCar-PT-10a-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 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 61 ms. Remains 91 /97 variables (removed 6) and now considering 1442/1498 (removed 56) transitions.
// Phase 1: matrix 1442 rows 91 cols
[2024-05-21 20:28:34] [INFO ] Computed 14 invariants in 58 ms
[2024-05-21 20:28:34] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-21 20:28:34] [INFO ] Invariant cache hit.
[2024-05-21 20:28:34] [INFO ] State equation strengthened by 353 read => feed constraints.
[2024-05-21 20:28:35] [INFO ] Implicit Places using invariants and state equation in 752 ms returned [87, 89]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1088 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 9 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 1161 ms. Remains : 89/97 places, 1442/1498 transitions.
Support contains 49 out of 89 places after structural reductions.
[2024-05-21 20:28:35] [INFO ] Flatten gal took : 447 ms
[2024-05-21 20:28:36] [INFO ] Flatten gal took : 282 ms
[2024-05-21 20:28:36] [INFO ] Input system was already deterministic with 1442 transitions.
Support contains 48 out of 89 places (down from 49) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 452 resets, run finished after 994 ms. (steps per millisecond=10 ) properties (out of 38) seen :8
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :3
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :1
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) 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 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
// Phase 1: matrix 1442 rows 89 cols
[2024-05-21 20:28:37] [INFO ] Computed 12 invariants in 23 ms
[2024-05-21 20:28:39] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2024-05-21 20:28:39] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-21 20:28:40] [INFO ] After 1527ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :24
[2024-05-21 20:28:40] [INFO ] State equation strengthened by 353 read => feed constraints.
[2024-05-21 20:28:41] [INFO ] After 948ms SMT Verify possible using 353 Read/Feed constraints in natural domain returned unsat :2 sat :24
[2024-05-21 20:28:43] [INFO ] After 2536ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :24
Attempting to minimize the solution found.
Minimization took 874 ms.
[2024-05-21 20:28:44] [INFO ] After 5228ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :24
Fused 26 Parikh solutions to 22 different solutions.
Parikh walk visited 0 properties in 1265 ms.
Support contains 40 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.34 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 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 26 place count 75 transition count 1395
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 75 transition count 1395
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 3 with 2 rules applied. Total rules applied 32 place count 74 transition count 1394
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 74 transition count 1388
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 3 with 46 rules applied. Total rules applied 84 place count 68 transition count 1348
Applied a total of 84 rules in 491 ms. Remains 68 /89 variables (removed 21) and now considering 1348/1442 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 492 ms. Remains : 68/89 places, 1348/1442 transitions.
Incomplete random walk after 10000 steps, including 74 resets, run finished after 720 ms. (steps per millisecond=13 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) 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 4 resets, run finished after 7 ms. (steps per millisecond=143 ) 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 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 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :2
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :1
Running SMT prover for 18 properties.
// Phase 1: matrix 1348 rows 68 cols
[2024-05-21 20:28:46] [INFO ] Computed 14 invariants in 13 ms
[2024-05-21 20:28:47] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-21 20:28:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-21 20:28:48] [INFO ] After 1050ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2024-05-21 20:28:48] [INFO ] State equation strengthened by 281 read => feed constraints.
[2024-05-21 20:28:49] [INFO ] After 625ms SMT Verify possible using 281 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2024-05-21 20:28:50] [INFO ] After 1645ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 594 ms.
[2024-05-21 20:28:50] [INFO ] After 3459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 1 properties in 1241 ms.
Support contains 39 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 1348/1348 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 68 transition count 1347
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 67 transition count 1337
Applied a total of 12 rules in 337 ms. Remains 67 /68 variables (removed 1) and now considering 1337/1348 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 337 ms. Remains : 67/68 places, 1337/1348 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 799 ms. (steps per millisecond=12 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) 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 :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) 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 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 1337 rows 67 cols
[2024-05-21 20:28:53] [INFO ] Computed 14 invariants in 17 ms
[2024-05-21 20:28:53] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-21 20:28:53] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-21 20:28:54] [INFO ] After 944ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-21 20:28:54] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-21 20:28:55] [INFO ] After 555ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2024-05-21 20:28:56] [INFO ] After 1380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 478 ms.
[2024-05-21 20:28:56] [INFO ] After 2936ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 1 properties in 744 ms.
Support contains 39 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 1337/1337 transitions.
Applied a total of 0 rules in 152 ms. Remains 67 /67 variables (removed 0) and now considering 1337/1337 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 67/67 places, 1337/1337 transitions.
Incomplete random walk after 10000 steps, including 45 resets, run finished after 697 ms. (steps per millisecond=14 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-21 20:28:58] [INFO ] Invariant cache hit.
[2024-05-21 20:28:59] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-21 20:28:59] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 20:28:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-21 20:28:59] [INFO ] After 653ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-21 20:28:59] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-21 20:29:00] [INFO ] After 230ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-21 20:29:00] [INFO ] After 594ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 202 ms.
[2024-05-21 20:29:00] [INFO ] After 1526ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 247 ms.
Support contains 23 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 1337/1337 transitions.
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 67 transition count 1333
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 28 place count 63 transition count 1313
Applied a total of 28 rules in 196 ms. Remains 63 /67 variables (removed 4) and now considering 1313/1337 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 63/67 places, 1313/1337 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1313 rows 63 cols
[2024-05-21 20:29:01] [INFO ] Computed 14 invariants in 10 ms
[2024-05-21 20:29:01] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2024-05-21 20:29:01] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 20:29:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2024-05-21 20:29:02] [INFO ] After 596ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-21 20:29:02] [INFO ] State equation strengthened by 251 read => feed constraints.
[2024-05-21 20:29:02] [INFO ] After 181ms SMT Verify possible using 251 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-21 20:29:03] [INFO ] After 470ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 162 ms.
[2024-05-21 20:29:03] [INFO ] After 1287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 251 ms.
Support contains 22 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 1313/1313 transitions.
Applied a total of 0 rules in 95 ms. Remains 63 /63 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 63/63 places, 1313/1313 transitions.
Incomplete random walk after 10000 steps, including 10 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 367748 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 367748 steps, saw 55986 distinct states, run finished after 3004 ms. (steps per millisecond=122 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-21 20:29:07] [INFO ] Invariant cache hit.
[2024-05-21 20:29:07] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2024-05-21 20:29:07] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 20:29:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2024-05-21 20:29:07] [INFO ] After 587ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-21 20:29:07] [INFO ] State equation strengthened by 251 read => feed constraints.
[2024-05-21 20:29:08] [INFO ] After 200ms SMT Verify possible using 251 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-21 20:29:08] [INFO ] After 494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 164 ms.
[2024-05-21 20:29:08] [INFO ] After 1308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 255 ms.
Support contains 22 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 1313/1313 transitions.
Applied a total of 0 rules in 90 ms. Remains 63 /63 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 63/63 places, 1313/1313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 1313/1313 transitions.
Applied a total of 0 rules in 84 ms. Remains 63 /63 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
[2024-05-21 20:29:09] [INFO ] Invariant cache hit.
[2024-05-21 20:29:09] [INFO ] Implicit Places using invariants in 320 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 323 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 62/63 places, 1313/1313 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 1312
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 1312
Applied a total of 2 rules in 102 ms. Remains 61 /62 variables (removed 1) and now considering 1312/1313 (removed 1) transitions.
// Phase 1: matrix 1312 rows 61 cols
[2024-05-21 20:29:09] [INFO ] Computed 13 invariants in 8 ms
[2024-05-21 20:29:09] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-21 20:29:09] [INFO ] Invariant cache hit.
[2024-05-21 20:29:10] [INFO ] State equation strengthened by 251 read => feed constraints.
[2024-05-21 20:29:10] [INFO ] Implicit Places using invariants and state equation in 768 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 61/63 places, 1312/1313 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1610 ms. Remains : 61/63 places, 1312/1313 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 365760 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :{}
Probabilistic random walk after 365760 steps, saw 55676 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-21 20:29:14] [INFO ] Invariant cache hit.
[2024-05-21 20:29:14] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-21 20:29:14] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 20:29:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 20:29:15] [INFO ] After 615ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-21 20:29:15] [INFO ] State equation strengthened by 251 read => feed constraints.
[2024-05-21 20:29:15] [INFO ] After 184ms SMT Verify possible using 251 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-21 20:29:15] [INFO ] After 460ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 154 ms.
[2024-05-21 20:29:15] [INFO ] After 1298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 274 ms.
Support contains 22 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1312/1312 transitions.
Applied a total of 0 rules in 84 ms. Remains 61 /61 variables (removed 0) and now considering 1312/1312 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 61/61 places, 1312/1312 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1312/1312 transitions.
Applied a total of 0 rules in 84 ms. Remains 61 /61 variables (removed 0) and now considering 1312/1312 (removed 0) transitions.
[2024-05-21 20:29:16] [INFO ] Invariant cache hit.
[2024-05-21 20:29:16] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-21 20:29:16] [INFO ] Invariant cache hit.
[2024-05-21 20:29:16] [INFO ] State equation strengthened by 251 read => feed constraints.
[2024-05-21 20:29:17] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 1185 ms to find 0 implicit places.
[2024-05-21 20:29:17] [INFO ] Redundant transitions in 173 ms returned []
[2024-05-21 20:29:17] [INFO ] Invariant cache hit.
[2024-05-21 20:29:18] [INFO ] Dead Transitions using invariants and state equation in 1056 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2506 ms. Remains : 61/61 places, 1312/1312 transitions.
Applied a total of 0 rules in 78 ms. Remains 61 /61 variables (removed 0) and now considering 1312/1312 (removed 0) transitions.
Running SMT prover for 5 properties.
[2024-05-21 20:29:18] [INFO ] Invariant cache hit.
[2024-05-21 20:29:18] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-21 20:29:18] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 20:29:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 20:29:19] [INFO ] After 609ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-21 20:29:19] [INFO ] After 892ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 154 ms.
[2024-05-21 20:29:19] [INFO ] After 1101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(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 13 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-05-21 20:29:20] [INFO ] Computed 12 invariants in 10 ms
[2024-05-21 20:29:20] [INFO ] Implicit Places using invariants in 502 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 505 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 7 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 526 ms. Remains : 83/89 places, 1387/1442 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 234 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s16 0) (EQ s22 0) (EQ s28 0) (EQ s36 0) (EQ s40 0) (EQ s48 0) (EQ s52 0) (EQ s58 0) (EQ s64 0) (EQ s70 0) (EQ s79 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 223 reset in 426 ms.
Product exploration explored 100000 steps with 3927 reset in 1949 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, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 468 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 552828 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :{}
Probabilistic random walk after 552828 steps, saw 69977 distinct states, run finished after 3002 ms. (steps per millisecond=184 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1387 rows 83 cols
[2024-05-21 20:29:26] [INFO ] Computed 11 invariants in 8 ms
[2024-05-21 20:29:27] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 20:29:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 20:29:27] [INFO ] After 466ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 20:29:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:29:27] [INFO ] After 31ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 20:29:27] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-21 20:29:27] [INFO ] After 627ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 11 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 1387/1387 transitions.
Graph (complete) has 1092 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 82 transition count 1373
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 24 place count 72 transition count 1373
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 24 place count 72 transition count 1370
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 30 place count 69 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 68 transition count 1369
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 68 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 2 with 2 rules applied. Total rules applied 34 place count 67 transition count 1368
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 44 place count 67 transition count 1358
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 2 with 110 rules applied. Total rules applied 154 place count 57 transition count 1258
Applied a total of 154 rules in 255 ms. Remains 57 /83 variables (removed 26) and now considering 1258/1387 (removed 129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 256 ms. Remains : 57/83 places, 1258/1387 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 1) seen :0
Finished Best-First random walk after 764 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=254 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10a-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLFireability-00 finished in 7995 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G((p0||F(p1))))&&F(p2))))'
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 1 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 1 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 274 ms. Remains 71 /89 variables (removed 18) and now considering 1375/1442 (removed 67) transitions.
// Phase 1: matrix 1375 rows 71 cols
[2024-05-21 20:29:28] [INFO ] Computed 12 invariants in 6 ms
[2024-05-21 20:29:28] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-21 20:29:28] [INFO ] Invariant cache hit.
[2024-05-21 20:29:29] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-05-21 20:29:29] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1206 ms to find 0 implicit places.
[2024-05-21 20:29:29] [INFO ] Redundant transitions in 116 ms returned []
[2024-05-21 20:29:29] [INFO ] Invariant cache hit.
[2024-05-21 20:29:30] [INFO ] Dead Transitions using invariants and state equation in 1065 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 2675 ms. Remains : 71/89 places, 1375/1442 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s7 1) (EQ s57 1) (EQ s67 1)), p0:(AND (EQ s1 1) (EQ s8 1) (EQ s38 1) (EQ s67 1)), p1:(AND (EQ s17 1) (EQ s20 1) (EQ s27 1) (EQ s30 1...], 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]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-02 finished in 2928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(X(p1)&&(!p2 U (p3||G(!p2))))))'
Support contains 21 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
[2024-05-21 20:29:31] [INFO ] Computed 12 invariants in 9 ms
[2024-05-21 20:29:31] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-21 20:29:31] [INFO ] Invariant cache hit.
[2024-05-21 20:29:31] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-21 20:29:32] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 819 ms to find 0 implicit places.
[2024-05-21 20:29:32] [INFO ] Invariant cache hit.
[2024-05-21 20:29:32] [INFO ] Dead Transitions using invariants and state equation in 763 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 1596 ms. Remains : 84/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) p2)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 1}, { cond=(OR p3 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(AND (NOT (AND (EQ s19 1) (EQ s25 1) (EQ s29 1) (EQ s37 1) (EQ s41 1) (EQ s49 1) (EQ s53 1) (EQ s59 1) (EQ s65 1) (EQ s73 1) (EQ s80 1))) (NOT (AND (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][false, false, false, false]]
Product exploration timeout after 72280 steps with 36140 reset in 10002 ms.
Product exploration timeout after 74420 steps with 37210 reset in 10001 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 p3 (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 18 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10a-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLFireability-03 finished in 21827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(G(p0))&&F(p1))) U p2)))'
Support contains 8 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 87 transition count 1420
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 87 transition count 1420
Applied a total of 4 rules in 13 ms. Remains 87 /89 variables (removed 2) and now considering 1420/1442 (removed 22) transitions.
// Phase 1: matrix 1420 rows 87 cols
[2024-05-21 20:29:53] [INFO ] Computed 12 invariants in 9 ms
[2024-05-21 20:29:53] [INFO ] Implicit Places using invariants in 648 ms returned []
[2024-05-21 20:29:53] [INFO ] Invariant cache hit.
[2024-05-21 20:29:54] [INFO ] State equation strengthened by 333 read => feed constraints.
[2024-05-21 20:29:54] [INFO ] Implicit Places using invariants and state equation in 1103 ms returned []
Implicit Place search using SMT with State Equation took 1757 ms to find 0 implicit places.
[2024-05-21 20:29:54] [INFO ] Invariant cache hit.
[2024-05-21 20:29:55] [INFO ] Dead Transitions using invariants and state equation in 754 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/89 places, 1420/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2528 ms. Remains : 87/89 places, 1420/1442 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
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 p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s8 1) (EQ s47 1) (EQ s82 1)), p0:(AND (EQ s1 1) (EQ s7 1) (EQ s42 1) (EQ s82 1)), p1:(AND (EQ s1 1) (EQ s2 1) (EQ s62 1) (EQ s82 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-04 finished in 2780 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0 U p1)) U !p0)))'
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 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 12 ms. Remains 85 /89 variables (removed 4) and now considering 1398/1442 (removed 44) transitions.
// Phase 1: matrix 1398 rows 85 cols
[2024-05-21 20:29:55] [INFO ] Computed 12 invariants in 9 ms
[2024-05-21 20:29:56] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-21 20:29:56] [INFO ] Invariant cache hit.
[2024-05-21 20:29:56] [INFO ] State equation strengthened by 313 read => feed constraints.
[2024-05-21 20:29:56] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
[2024-05-21 20:29:56] [INFO ] Invariant cache hit.
[2024-05-21 20:29:57] [INFO ] Dead Transitions using invariants and state equation in 874 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 2030 ms. Remains : 85/89 places, 1398/1442 transitions.
Stuttering acceptance computed with spot in 163 ms :[p0, p0, (NOT p1), (NOT p1), true]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(OR p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s6 1) (EQ s58 1) (EQ s80 1)), p1:(AND (EQ s19 1) (EQ s23 1) (EQ s31 1) (EQ s37 1) (EQ s43 1) (EQ s49 1) (EQ s53 1) (EQ s59 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][false, false, false, false, false]]
Product exploration timeout after 76690 steps with 38345 reset in 10001 ms.
Product exploration timeout after 77730 steps with 38865 reset in 10001 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)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 20 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10a-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLFireability-05 finished in 22264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)&&p0)))'
Support contains 11 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 210 ms. Remains 70 /89 variables (removed 19) and now considering 1374/1442 (removed 68) transitions.
// Phase 1: matrix 1374 rows 70 cols
[2024-05-21 20:30:18] [INFO ] Computed 12 invariants in 7 ms
[2024-05-21 20:30:18] [INFO ] Implicit Places using invariants in 490 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 493 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 102 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 808 ms. Remains : 69/89 places, 1374/1442 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s14 1) (EQ s19 1) (EQ s26 1) (EQ s29 1) (EQ s34 1) (EQ s41 1) (EQ s44 1) (EQ s49 1) (EQ s56 1) (EQ s61 1) (EQ s66 1)), p1:(AND (EQ s14 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 14 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 915 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 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 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 1 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 202 ms. Remains 70 /89 variables (removed 19) and now considering 1374/1442 (removed 68) transitions.
[2024-05-21 20:30:19] [INFO ] Invariant cache hit.
[2024-05-21 20:30:19] [INFO ] Implicit Places using invariants in 310 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 315 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 99 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 618 ms. Remains : 69/89 places, 1374/1442 transitions.
Stuttering acceptance computed with spot in 71 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 1369 reset in 674 ms.
Product exploration explored 100000 steps with 94 reset in 128 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 81 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 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 576 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 1374 rows 69 cols
[2024-05-21 20:30:21] [INFO ] Computed 11 invariants in 10 ms
[2024-05-21 20:30:21] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 20:30:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 20:30:21] [INFO ] After 31ms 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 (Minato strategy)
Knowledge based reduction with 4 factoid took 13 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 2377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&G(p1))))'
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 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 10 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-05-21 20:30:21] [INFO ] Computed 12 invariants in 8 ms
[2024-05-21 20:30:21] [INFO ] Implicit Places using invariants in 351 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 355 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 5 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 370 ms. Remains : 83/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 240 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (OR (NEQ s16 1) (NEQ s24 1) (NEQ s30 1) (NEQ s36 1) (NEQ s40 1) (NEQ s48 1) (NEQ s54 1) (NEQ s58 1) (NEQ s64 1) (NEQ s72 1) (NEQ s79 1)) (OR (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 513 reset in 378 ms.
Product exploration explored 100000 steps with 18 reset in 251 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X (AND p1 p0))), (X (X (NOT (OR (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 78 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p1)]
Incomplete random walk after 10000 steps, including 456 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 1) seen :0
Finished Best-First random walk after 3966 steps, including 12 resets, run visited all 1 properties in 13 ms. (steps per millisecond=305 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X (AND p1 p0))), (X (X (NOT (OR (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 5 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10a-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLFireability-08 finished in 1761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(!p1 U (G(!p1)||(!p1&&(!p2 U (p3||G(!p2))))))))))'
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 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.
[2024-05-21 20:30:23] [INFO ] Invariant cache hit.
[2024-05-21 20:30:23] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-21 20:30:23] [INFO ] Invariant cache hit.
[2024-05-21 20:30:23] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-21 20:30:24] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 1061 ms to find 0 implicit places.
[2024-05-21 20:30:24] [INFO ] Invariant cache hit.
[2024-05-21 20:30:24] [INFO ] Dead Transitions using invariants and state equation in 702 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 1777 ms. Remains : 84/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3)))]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p3) p2 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={1} source=2 dest: 4}], [{ cond=p1, acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p3) p2 p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p2) p1)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s9 0) (EQ s42 0) (EQ s79 0)), p1:(AND (EQ s1 1) (EQ s6 1) (EQ s56 1) (EQ s79 1)), p3:(AND (EQ s17 1) (EQ s25 1) (EQ s31 1) (EQ s37 1)...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4520 reset in 2252 ms.
Product exploration explored 100000 steps with 147 reset in 248 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 p1) (NOT p3) (NOT p2)), (X (AND p0 (NOT p3) (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (NOT (OR (NOT p0) p1))), (X (X (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (OR (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 111 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3)))]
Incomplete random walk after 10000 steps, including 469 resets, run finished after 508 ms. (steps per millisecond=19 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-21 20:30:28] [INFO ] Invariant cache hit.
[2024-05-21 20:30:29] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 20:30:29] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 20:30:29] [INFO ] After 606ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2024-05-21 20:30:29] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-21 20:30:29] [INFO ] After 190ms SMT Verify possible using 303 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2024-05-21 20:30:30] [INFO ] After 466ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 155 ms.
[2024-05-21 20:30:30] [INFO ] After 1296ms 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 59 ms.
Support contains 19 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Graph (complete) has 1126 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 83 transition count 1376
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 19 place count 76 transition count 1375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 75 transition count 1375
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 20 place count 75 transition count 1372
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 26 place count 72 transition count 1372
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 71 transition count 1371
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 71 transition count 1371
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 30 place count 70 transition count 1370
Free-agglomeration rule applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 39 place count 70 transition count 1361
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 3 with 79 rules applied. Total rules applied 118 place count 61 transition count 1291
Applied a total of 118 rules in 266 ms. Remains 61 /84 variables (removed 23) and now considering 1291/1387 (removed 96) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266 ms. Remains : 61/84 places, 1291/1387 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 451 ms. (steps per millisecond=22 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 333355 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 333355 steps, saw 49568 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1291 rows 61 cols
[2024-05-21 20:30:34] [INFO ] Computed 14 invariants in 8 ms
[2024-05-21 20:30:34] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 20:30:34] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-21 20:30:35] [INFO ] After 520ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 20:30:35] [INFO ] State equation strengthened by 231 read => feed constraints.
[2024-05-21 20:30:35] [INFO ] After 156ms SMT Verify possible using 231 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-21 20:30:35] [INFO ] After 383ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 130 ms.
[2024-05-21 20:30:35] [INFO ] After 1091ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 180 ms.
Support contains 19 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1291/1291 transitions.
Applied a total of 0 rules in 74 ms. Remains 61 /61 variables (removed 0) and now considering 1291/1291 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 61/61 places, 1291/1291 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1291/1291 transitions.
Applied a total of 0 rules in 77 ms. Remains 61 /61 variables (removed 0) and now considering 1291/1291 (removed 0) transitions.
[2024-05-21 20:30:35] [INFO ] Invariant cache hit.
[2024-05-21 20:30:36] [INFO ] Implicit Places using invariants in 291 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 298 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/61 places, 1291/1291 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 1290
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 1290
Applied a total of 2 rules in 87 ms. Remains 59 /60 variables (removed 1) and now considering 1290/1291 (removed 1) transitions.
// Phase 1: matrix 1290 rows 59 cols
[2024-05-21 20:30:36] [INFO ] Computed 13 invariants in 7 ms
[2024-05-21 20:30:36] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-21 20:30:36] [INFO ] Invariant cache hit.
[2024-05-21 20:30:36] [INFO ] State equation strengthened by 231 read => feed constraints.
[2024-05-21 20:30:37] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 1028 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 59/61 places, 1290/1291 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1490 ms. Remains : 59/61 places, 1290/1291 transitions.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 335359 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 335359 steps, saw 49884 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-21 20:30:40] [INFO ] Invariant cache hit.
[2024-05-21 20:30:41] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 20:30:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 20:30:41] [INFO ] After 517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 20:30:41] [INFO ] State equation strengthened by 231 read => feed constraints.
[2024-05-21 20:30:41] [INFO ] After 154ms SMT Verify possible using 231 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-21 20:30:42] [INFO ] After 373ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 119 ms.
[2024-05-21 20:30:42] [INFO ] After 1061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 115 ms.
Support contains 19 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 1290/1290 transitions.
Applied a total of 0 rules in 73 ms. Remains 59 /59 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 59/59 places, 1290/1290 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 1290/1290 transitions.
Applied a total of 0 rules in 74 ms. Remains 59 /59 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
[2024-05-21 20:30:42] [INFO ] Invariant cache hit.
[2024-05-21 20:30:42] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-21 20:30:42] [INFO ] Invariant cache hit.
[2024-05-21 20:30:43] [INFO ] State equation strengthened by 231 read => feed constraints.
[2024-05-21 20:30:43] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 1019 ms to find 0 implicit places.
[2024-05-21 20:30:43] [INFO ] Redundant transitions in 46 ms returned []
[2024-05-21 20:30:43] [INFO ] Invariant cache hit.
[2024-05-21 20:30:44] [INFO ] Dead Transitions using invariants and state equation in 853 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2003 ms. Remains : 59/59 places, 1290/1290 transitions.
Applied a total of 0 rules in 73 ms. Remains 59 /59 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-21 20:30:44] [INFO ] Invariant cache hit.
[2024-05-21 20:30:44] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 20:30:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 20:30:45] [INFO ] After 523ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 20:30:45] [INFO ] After 726ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 112 ms.
[2024-05-21 20:30:45] [INFO ] After 885ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (AND p0 (NOT p3) (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (NOT (OR (NOT p0) p1))), (X (X (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (OR (NOT p0) p1)))), (X (X (NOT p1))), (G (NOT (AND p1 p2 (NOT p3)))), (G (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (AND (NOT p1) p2 (NOT p3))), (F (AND p0 (NOT p1) p2 (NOT p3))), (F (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))]
Knowledge based reduction with 14 factoid took 254 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Support contains 19 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 5 ms. Remains 84 /84 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-05-21 20:30:46] [INFO ] Computed 12 invariants in 8 ms
[2024-05-21 20:30:46] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-21 20:30:46] [INFO ] Invariant cache hit.
[2024-05-21 20:30:46] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-21 20:30:47] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 1074 ms to find 0 implicit places.
[2024-05-21 20:30:47] [INFO ] Invariant cache hit.
[2024-05-21 20:30:47] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1780 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 (NOT p1) p0 (NOT p2) (NOT p3)), (X (NOT (AND (NOT p1) p2 (NOT p3) p0))), (X (NOT (OR p1 (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p3) p0)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) p0)))), (X (X (NOT (OR p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3) p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 124 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Incomplete random walk after 10000 steps, including 460 resets, run finished after 556 ms. (steps per millisecond=17 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 262782 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 262782 steps, saw 36812 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 9 properties.
[2024-05-21 20:30:52] [INFO ] Invariant cache hit.
[2024-05-21 20:30:52] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-21 20:30:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 20:30:53] [INFO ] After 785ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-21 20:30:53] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-21 20:30:53] [INFO ] After 355ms SMT Verify possible using 303 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-21 20:30:54] [INFO ] After 923ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 304 ms.
[2024-05-21 20:30:54] [INFO ] After 2112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 169 ms.
Support contains 19 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Graph (complete) has 1126 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 83 transition count 1376
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 19 place count 76 transition count 1375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 75 transition count 1375
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 20 place count 75 transition count 1372
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 26 place count 72 transition count 1372
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 71 transition count 1371
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 71 transition count 1371
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 30 place count 70 transition count 1370
Free-agglomeration rule applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 39 place count 70 transition count 1361
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 3 with 79 rules applied. Total rules applied 118 place count 61 transition count 1291
Applied a total of 118 rules in 254 ms. Remains 61 /84 variables (removed 23) and now considering 1291/1387 (removed 96) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 61/84 places, 1291/1387 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 670 ms. (steps per millisecond=14 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1291 rows 61 cols
[2024-05-21 20:30:56] [INFO ] Computed 14 invariants in 7 ms
[2024-05-21 20:30:56] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 20:30:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2024-05-21 20:30:56] [INFO ] After 552ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 20:30:56] [INFO ] State equation strengthened by 231 read => feed constraints.
[2024-05-21 20:30:56] [INFO ] After 157ms SMT Verify possible using 231 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-21 20:30:57] [INFO ] After 391ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 148 ms.
[2024-05-21 20:30:57] [INFO ] After 1149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 160 ms.
Support contains 19 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1291/1291 transitions.
Applied a total of 0 rules in 79 ms. Remains 61 /61 variables (removed 0) and now considering 1291/1291 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 61/61 places, 1291/1291 transitions.
Incomplete random walk after 10000 steps, including 12 resets, run finished after 477 ms. (steps per millisecond=20 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 312716 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 312716 steps, saw 46818 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-21 20:31:01] [INFO ] Invariant cache hit.
[2024-05-21 20:31:01] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 20:31:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2024-05-21 20:31:02] [INFO ] After 556ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 20:31:02] [INFO ] State equation strengthened by 231 read => feed constraints.
[2024-05-21 20:31:02] [INFO ] After 159ms SMT Verify possible using 231 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-21 20:31:02] [INFO ] After 399ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 146 ms.
[2024-05-21 20:31:02] [INFO ] After 1157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 162 ms.
Support contains 19 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1291/1291 transitions.
Applied a total of 0 rules in 78 ms. Remains 61 /61 variables (removed 0) and now considering 1291/1291 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 61/61 places, 1291/1291 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1291/1291 transitions.
Applied a total of 0 rules in 79 ms. Remains 61 /61 variables (removed 0) and now considering 1291/1291 (removed 0) transitions.
[2024-05-21 20:31:02] [INFO ] Invariant cache hit.
[2024-05-21 20:31:03] [INFO ] Implicit Places using invariants in 308 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 311 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/61 places, 1291/1291 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 1290
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 1290
Applied a total of 2 rules in 93 ms. Remains 59 /60 variables (removed 1) and now considering 1290/1291 (removed 1) transitions.
// Phase 1: matrix 1290 rows 59 cols
[2024-05-21 20:31:03] [INFO ] Computed 13 invariants in 10 ms
[2024-05-21 20:31:03] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-21 20:31:03] [INFO ] Invariant cache hit.
[2024-05-21 20:31:04] [INFO ] State equation strengthened by 231 read => feed constraints.
[2024-05-21 20:31:04] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 1095 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 59/61 places, 1290/1291 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1579 ms. Remains : 59/61 places, 1290/1291 transitions.
Incomplete random walk after 10000 steps, including 10 resets, run finished after 458 ms. (steps per millisecond=21 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
[2024-05-21 20:31:04] [INFO ] Invariant cache hit.
[2024-05-21 20:31:05] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 20:31:05] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:31:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 20:31:05] [INFO ] After 513ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:31:05] [INFO ] State equation strengthened by 231 read => feed constraints.
[2024-05-21 20:31:05] [INFO ] After 82ms SMT Verify possible using 231 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:31:05] [INFO ] After 195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 69 ms.
[2024-05-21 20:31:05] [INFO ] After 824ms 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 31 ms.
Support contains 17 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 1290/1290 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 59 transition count 1289
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 58 transition count 1279
Applied a total of 12 rules in 159 ms. Remains 58 /59 variables (removed 1) and now considering 1279/1290 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 58/59 places, 1279/1290 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 366747 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 366747 steps, saw 55709 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1279 rows 58 cols
[2024-05-21 20:31:09] [INFO ] Computed 13 invariants in 7 ms
[2024-05-21 20:31:09] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-21 20:31:09] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:31:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 20:31:10] [INFO ] After 457ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:31:10] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-05-21 20:31:10] [INFO ] After 82ms SMT Verify possible using 221 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:31:10] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 65 ms.
[2024-05-21 20:31:10] [INFO ] After 762ms 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 32 ms.
Support contains 17 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 79 ms. Remains 58 /58 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 58/58 places, 1279/1279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 76 ms. Remains 58 /58 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
[2024-05-21 20:31:10] [INFO ] Invariant cache hit.
[2024-05-21 20:31:10] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-21 20:31:10] [INFO ] Invariant cache hit.
[2024-05-21 20:31:11] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-05-21 20:31:11] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1098 ms to find 0 implicit places.
[2024-05-21 20:31:11] [INFO ] Redundant transitions in 45 ms returned []
[2024-05-21 20:31:11] [INFO ] Invariant cache hit.
[2024-05-21 20:31:12] [INFO ] Dead Transitions using invariants and state equation in 959 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2187 ms. Remains : 58/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 74 ms. Remains 58 /58 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-21 20:31:12] [INFO ] Invariant cache hit.
[2024-05-21 20:31:12] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 20:31:12] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:31:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 20:31:13] [INFO ] After 638ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:31:13] [INFO ] After 751ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 60 ms.
[2024-05-21 20:31:13] [INFO ] After 849ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (NOT (AND (NOT p1) p2 (NOT p3) p0))), (X (NOT (OR p1 (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p3) p0)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) p0)))), (X (X (NOT (OR p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3) p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p2 (NOT p3))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (OR (NOT p0) p1)), (F (AND p0 (NOT p1) p2 (NOT p3))), (F (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (F (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))), (F (AND (NOT p1) p2 (NOT p3)))]
Knowledge based reduction with 12 factoid took 350 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Product exploration explored 100000 steps with 1744 reset in 960 ms.
Product exploration explored 100000 steps with 4024 reset in 2085 ms.
Built C files in :
/tmp/ltsmin2509899218425819667
[2024-05-21 20:31:18] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2509899218425819667
Running compilation step : cd /tmp/ltsmin2509899218425819667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2509899218425819667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2509899218425819667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 19 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 5 ms. Remains 84 /84 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-05-21 20:31:21] [INFO ] Computed 12 invariants in 9 ms
[2024-05-21 20:31:21] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-21 20:31:21] [INFO ] Invariant cache hit.
[2024-05-21 20:31:22] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-21 20:31:22] [INFO ] Implicit Places using invariants and state equation in 829 ms returned []
Implicit Place search using SMT with State Equation took 1170 ms to find 0 implicit places.
[2024-05-21 20:31:22] [INFO ] Invariant cache hit.
[2024-05-21 20:31:23] [INFO ] Dead Transitions using invariants and state equation in 727 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1903 ms. Remains : 84/84 places, 1387/1387 transitions.
Built C files in :
/tmp/ltsmin7627909756178274771
[2024-05-21 20:31:23] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7627909756178274771
Running compilation step : cd /tmp/ltsmin7627909756178274771;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7627909756178274771;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7627909756178274771;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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)
[2024-05-21 20:31:26] [INFO ] Flatten gal took : 181 ms
[2024-05-21 20:31:27] [INFO ] Flatten gal took : 190 ms
[2024-05-21 20:31:27] [INFO ] Time to serialize gal into /tmp/LTL7182623149668464266.gal : 42 ms
[2024-05-21 20:31:27] [INFO ] Time to serialize properties into /tmp/LTL18022911640561542820.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7182623149668464266.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2683786945232159784.hoa' '-atoms' '/tmp/LTL18022911640561542820.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL18022911640561542820.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2683786945232159784.hoa
Detected timeout of ITS tools.
[2024-05-21 20:31:42] [INFO ] Flatten gal took : 193 ms
[2024-05-21 20:31:42] [INFO ] Flatten gal took : 152 ms
[2024-05-21 20:31:42] [INFO ] Time to serialize gal into /tmp/LTL15698879403850390326.gal : 38 ms
[2024-05-21 20:31:42] [INFO ] Time to serialize properties into /tmp/LTL7217004274571717167.ltl : 16 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15698879403850390326.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7217004274571717167.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(((!("(((p1==1)&&(p6==1))&&((p63==1)&&(p89==1)))"))U((G(!("(((p1==1)&&(p6==1))&&((p63==1)&&(p89==1)))")))||((!("(((p1==1)&&(p6==...533
Formula 0 simplified : XG(!"(((p1==0)||(p9==0))||((p47==0)||(p89==0)))" | (("(((p1==1)&&(p11==1))&&((p70==1)&&(p89==1)))" M !"(((((p17==1)&&(p27==1))&&((p3...355
Detected timeout of ITS tools.
[2024-05-21 20:31:57] [INFO ] Flatten gal took : 151 ms
[2024-05-21 20:31:57] [INFO ] Applying decomposition
[2024-05-21 20:31:58] [INFO ] Flatten gal took : 150 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1760782809108327137.txt' '-o' '/tmp/graph1760782809108327137.bin' '-w' '/tmp/graph1760782809108327137.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1760782809108327137.bin' '-l' '-1' '-v' '-w' '/tmp/graph1760782809108327137.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:31:59] [INFO ] Decomposing Gal with order
[2024-05-21 20:31:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:31:59] [INFO ] Removed a total of 12828 redundant transitions.
[2024-05-21 20:31:59] [INFO ] Flatten gal took : 659 ms
[2024-05-21 20:32:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 161 ms.
[2024-05-21 20:32:00] [INFO ] Time to serialize gal into /tmp/LTL17123490368642363946.gal : 18 ms
[2024-05-21 20:32:00] [INFO ] Time to serialize properties into /tmp/LTL11120263380743287496.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17123490368642363946.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11120263380743287496.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F(((!("(((u20.p1==1)&&(u20.p6==1))&&((u15.p63==1)&&(u20.p89==1)))"))U((G(!("(((u20.p1==1)&&(u20.p6==1))&&((u15.p63==1)&&(u20.p89=...707
Formula 0 simplified : XG(!"(((u20.p1==0)||(u20.p9==0))||((u9.p47==0)||(u20.p89==0)))" | (("(((u20.p1==1)&&(u20.p11==1))&&((i0.u17.p70==1)&&(u20.p89==1)))"...478
Reverse transition relation is NOT exact ! Due to transitions t661, t662, t663, t664, t665, t666, t667, t668, t669, t670, t671, t672, t673, t674, t675, t67...3750
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10806836687148481763
[2024-05-21 20:32:15] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10806836687148481763
Running compilation step : cd /tmp/ltsmin10806836687148481763;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10806836687148481763;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10806836687148481763;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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-09 finished in 115169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
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 11 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
[2024-05-21 20:32:18] [INFO ] Invariant cache hit.
[2024-05-21 20:32:18] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-21 20:32:18] [INFO ] Invariant cache hit.
[2024-05-21 20:32:19] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-21 20:32:19] [INFO ] Implicit Places using invariants and state equation in 838 ms returned []
Implicit Place search using SMT with State Equation took 1172 ms to find 0 implicit places.
[2024-05-21 20:32:19] [INFO ] Invariant cache hit.
[2024-05-21 20:32:20] [INFO ] Dead Transitions using invariants and state equation in 737 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 1925 ms. Remains : 84/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (EQ s1 1) (EQ s8 1) (EQ s62 1) (EQ s79 1)) (AND (EQ s19 1) (EQ s23 1) (EQ s29 1) (EQ s37 1) (EQ s43 1) (EQ s47 1) (EQ s53 1) (EQ s61 1) (EQ s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-10 finished in 2031 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(p1)) U p2))'
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 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 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 28 place count 73 transition count 1386
Iterating global reduction 3 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 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 1385
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 1385
Applied a total of 36 rules in 203 ms. Remains 71 /89 variables (removed 18) and now considering 1385/1442 (removed 57) transitions.
// Phase 1: matrix 1385 rows 71 cols
[2024-05-21 20:32:20] [INFO ] Computed 12 invariants in 7 ms
[2024-05-21 20:32:20] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-21 20:32:20] [INFO ] Invariant cache hit.
[2024-05-21 20:32:21] [INFO ] State equation strengthened by 315 read => feed constraints.
[2024-05-21 20:32:21] [INFO ] Implicit Places using invariants and state equation in 826 ms returned []
Implicit Place search using SMT with State Equation took 1161 ms to find 0 implicit places.
[2024-05-21 20:32:21] [INFO ] Redundant transitions in 65 ms returned []
[2024-05-21 20:32:21] [INFO ] Invariant cache hit.
[2024-05-21 20:32:22] [INFO ] Dead Transitions using invariants and state equation in 962 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 2398 ms. Remains : 71/89 places, 1385/1442 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s9 1) (EQ s21 1) (EQ s67 1)), p0:(AND (EQ s1 1) (EQ s4 1) (EQ s52 1) (EQ s67 1)), p1:(AND (EQ s15 1) (EQ s20 1) (EQ s28 1) (EQ s31 1...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-12 finished in 2522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 16 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 1 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 245 ms. Remains 70 /89 variables (removed 19) and now considering 1374/1442 (removed 68) transitions.
// Phase 1: matrix 1374 rows 70 cols
[2024-05-21 20:32:23] [INFO ] Computed 12 invariants in 12 ms
[2024-05-21 20:32:23] [INFO ] Implicit Places using invariants in 437 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 440 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 102 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 788 ms. Remains : 69/89 places, 1374/1442 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s14 0) (EQ s21 0) (EQ s26 0) (EQ s31 0) (EQ s36 0) (EQ s39 0) (EQ s46 0) (EQ s49 0) (EQ s56 0) (EQ s59 0) (EQ s66 0)), p1:(OR (NEQ s16 1) (NEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 984 reset in 517 ms.
Product exploration explored 100000 steps with 124 reset in 138 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 p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 85 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 562 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 1) seen :0
Finished Best-First random walk after 6440 steps, including 19 resets, run visited all 1 properties in 20 ms. (steps per millisecond=322 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Support contains 11 out of 69 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 1374/1374 transitions.
Applied a total of 0 rules in 102 ms. Remains 69 /69 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
// Phase 1: matrix 1374 rows 69 cols
[2024-05-21 20:32:25] [INFO ] Computed 11 invariants in 10 ms
[2024-05-21 20:32:25] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-21 20:32:25] [INFO ] Invariant cache hit.
[2024-05-21 20:32:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:32:26] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
[2024-05-21 20:32:26] [INFO ] Redundant transitions in 63 ms returned []
[2024-05-21 20:32:26] [INFO ] Invariant cache hit.
[2024-05-21 20:32:27] [INFO ] Dead Transitions using invariants and state equation in 1172 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2169 ms. Remains : 69/69 places, 1374/1374 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 207 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 552 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 1) seen :0
Finished Best-First random walk after 2165 steps, including 8 resets, run visited all 1 properties in 8 ms. (steps per millisecond=270 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 610 reset in 358 ms.
Product exploration explored 100000 steps with 3585 reset in 1690 ms.
Built C files in :
/tmp/ltsmin4869662640000058051
[2024-05-21 20:32:30] [INFO ] Computing symmetric may disable matrix : 1374 transitions.
[2024-05-21 20:32:30] [INFO ] Computation of Complete disable matrix. took 447 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:32:30] [INFO ] Computing symmetric may enable matrix : 1374 transitions.
[2024-05-21 20:32:31] [INFO ] Computation of Complete enable matrix. took 84 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:32:31] [INFO ] Computing Do-Not-Accords matrix : 1374 transitions.
[2024-05-21 20:32:31] [INFO ] Computation of Completed DNA matrix. took 141 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:32:31] [INFO ] Built C files in 1403ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4869662640000058051
Running compilation step : cd /tmp/ltsmin4869662640000058051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4869662640000058051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4869662640000058051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 11 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 1374/1374 transitions.
Applied a total of 0 rules in 106 ms. Remains 69 /69 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
[2024-05-21 20:32:34] [INFO ] Invariant cache hit.
[2024-05-21 20:32:35] [INFO ] Implicit Places using invariants in 350 ms returned []
[2024-05-21 20:32:35] [INFO ] Invariant cache hit.
[2024-05-21 20:32:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:32:36] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 1130 ms to find 0 implicit places.
[2024-05-21 20:32:36] [INFO ] Redundant transitions in 63 ms returned []
[2024-05-21 20:32:36] [INFO ] Invariant cache hit.
[2024-05-21 20:32:37] [INFO ] Dead Transitions using invariants and state equation in 1321 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2631 ms. Remains : 69/69 places, 1374/1374 transitions.
Built C files in :
/tmp/ltsmin16942568143173058686
[2024-05-21 20:32:37] [INFO ] Computing symmetric may disable matrix : 1374 transitions.
[2024-05-21 20:32:37] [INFO ] Computation of Complete disable matrix. took 435 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:32:38] [INFO ] Computing symmetric may enable matrix : 1374 transitions.
[2024-05-21 20:32:38] [INFO ] Computation of Complete enable matrix. took 67 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:32:38] [INFO ] Computing Do-Not-Accords matrix : 1374 transitions.
[2024-05-21 20:32:38] [INFO ] Computation of Completed DNA matrix. took 129 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:32:38] [INFO ] Built C files in 1312ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16942568143173058686
Running compilation step : cd /tmp/ltsmin16942568143173058686;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16942568143173058686;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16942568143173058686;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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)
[2024-05-21 20:32:42] [INFO ] Flatten gal took : 209 ms
[2024-05-21 20:32:42] [INFO ] Flatten gal took : 209 ms
[2024-05-21 20:32:42] [INFO ] Time to serialize gal into /tmp/LTL18290226119389979520.gal : 24 ms
[2024-05-21 20:32:42] [INFO ] Time to serialize properties into /tmp/LTL18231522682470778019.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18290226119389979520.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1022676211305666644.hoa' '-atoms' '/tmp/LTL18231522682470778019.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18231522682470778019.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1022676211305666644.hoa
Detected timeout of ITS tools.
[2024-05-21 20:32:57] [INFO ] Flatten gal took : 207 ms
[2024-05-21 20:32:57] [INFO ] Flatten gal took : 206 ms
[2024-05-21 20:32:57] [INFO ] Time to serialize gal into /tmp/LTL7817704411650814708.gal : 47 ms
[2024-05-21 20:32:57] [INFO ] Time to serialize properties into /tmp/LTL1192985092363037470.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7817704411650814708.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1192985092363037470.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F("(((((p17==0)||(p27==0))||((p34==0)||(p41==0)))||(((p48==0)||(p52==0))||((p62==0)||(p66==0))))||(((p76==0)||(p80==0))||(p90==0))...301
Formula 0 simplified : G!"(((((p17==0)||(p27==0))||((p34==0)||(p41==0)))||(((p48==0)||(p52==0))||((p62==0)||(p66==0))))||(((p76==0)||(p80==0))||(p90==0)))"...291
Detected timeout of ITS tools.
[2024-05-21 20:33:13] [INFO ] Flatten gal took : 211 ms
[2024-05-21 20:33:13] [INFO ] Applying decomposition
[2024-05-21 20:33:13] [INFO ] Flatten gal took : 201 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8291998953280460965.txt' '-o' '/tmp/graph8291998953280460965.bin' '-w' '/tmp/graph8291998953280460965.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8291998953280460965.bin' '-l' '-1' '-v' '-w' '/tmp/graph8291998953280460965.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:33:13] [INFO ] Decomposing Gal with order
[2024-05-21 20:33:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:33:14] [INFO ] Removed a total of 12319 redundant transitions.
[2024-05-21 20:33:14] [INFO ] Flatten gal took : 304 ms
[2024-05-21 20:33:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 95 ms.
[2024-05-21 20:33:14] [INFO ] Time to serialize gal into /tmp/LTL15473669154710520333.gal : 4 ms
[2024-05-21 20:33:14] [INFO ] Time to serialize properties into /tmp/LTL4327285415373912789.ltl : 112 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15473669154710520333.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4327285415373912789.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("(((((i0.u0.p17==0)||(u3.p27==0))||((u5.p34==0)||(u7.p41==0)))||(((u9.p48==0)||(i0.u10.p52==0))||((u13.p62==0)||(i0.u14.p66==0))...410
Formula 0 simplified : G!"(((((i0.u0.p17==0)||(u3.p27==0))||((u5.p34==0)||(u7.p41==0)))||(((u9.p48==0)||(i0.u10.p52==0))||((u13.p62==0)||(i0.u14.p66==0))))...400
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1728647222494873813
[2024-05-21 20:33:29] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1728647222494873813
Running compilation step : cd /tmp/ltsmin1728647222494873813;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1728647222494873813;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1728647222494873813;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 69919 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X((p1&&F((G(F(!p2))||(!p3&&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 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
[2024-05-21 20:33:32] [INFO ] Computed 12 invariants in 9 ms
[2024-05-21 20:33:33] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-21 20:33:33] [INFO ] Invariant cache hit.
[2024-05-21 20:33:33] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-21 20:33:33] [INFO ] Implicit Places using invariants and state equation in 819 ms returned []
Implicit Place search using SMT with State Equation took 1159 ms to find 0 implicit places.
[2024-05-21 20:33:33] [INFO ] Invariant cache hit.
[2024-05-21 20:33:34] [INFO ] Dead Transitions using invariants and state equation in 744 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 1915 ms. Remains : 84/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p1) p2), p2, p2]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p3), acceptance={} source=3 dest: 4}, { cond=(AND p1 p2), acceptance={} source=3 dest: 5}], [{ cond=p3, acceptance={} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s17 0) (EQ s25 0) (EQ s29 0) (EQ s35 0) (EQ s41 0) (EQ s49 0) (EQ s53 0) (EQ s61 0) (EQ s65 0) (EQ s71 0) (EQ s80 0)), p1:(OR (EQ s1 0) (EQ s12...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 7606 ms.
Product exploration explored 100000 steps with 25000 reset in 7670 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p1) p2), p2, p2]
Incomplete random walk after 10000 steps, including 451 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-21 20:33:51] [INFO ] Invariant cache hit.
[2024-05-21 20:33:51] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2024-05-21 20:33:51] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-21 20:33:52] [INFO ] After 583ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2024-05-21 20:33:52] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-21 20:33:52] [INFO ] After 143ms SMT Verify possible using 303 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2024-05-21 20:33:52] [INFO ] After 320ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 102 ms.
[2024-05-21 20:33:52] [INFO ] After 1066ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 75 ms.
Support contains 17 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Graph (complete) has 1126 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 83 transition count 1375
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 75 transition count 1373
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 73 transition count 1373
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 73 transition count 1370
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 70 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 69 transition count 1369
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 68 transition count 1368
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 42 place count 68 transition count 1360
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 3 with 88 rules applied. Total rules applied 130 place count 60 transition count 1280
Applied a total of 130 rules in 240 ms. Remains 60 /84 variables (removed 24) and now considering 1280/1387 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 60/84 places, 1280/1387 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 539 ms. (steps per millisecond=18 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1280 rows 60 cols
[2024-05-21 20:33:53] [INFO ] Computed 14 invariants in 7 ms
[2024-05-21 20:33:53] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:33:53] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-21 20:33:54] [INFO ] After 465ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:33:54] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-05-21 20:33:54] [INFO ] After 83ms SMT Verify possible using 221 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:33:54] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-21 20:33:54] [INFO ] After 771ms 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 37 ms.
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1280/1280 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 58 transition count 1278
Applied a total of 4 rules in 105 ms. Remains 58 /60 variables (removed 2) and now considering 1278/1280 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 58/60 places, 1278/1280 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 461 ms. (steps per millisecond=21 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 375423 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 375423 steps, saw 58015 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1278 rows 58 cols
[2024-05-21 20:33:58] [INFO ] Computed 14 invariants in 7 ms
[2024-05-21 20:33:58] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:33:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2024-05-21 20:33:58] [INFO ] After 460ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:33:58] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-05-21 20:33:58] [INFO ] After 80ms SMT Verify possible using 221 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:33:58] [INFO ] After 189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 62 ms.
[2024-05-21 20:33:58] [INFO ] After 755ms 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 33 ms.
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 86 ms. Remains 58 /58 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 58/58 places, 1278/1278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 85 ms. Remains 58 /58 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
[2024-05-21 20:33:59] [INFO ] Invariant cache hit.
[2024-05-21 20:33:59] [INFO ] Implicit Places using invariants in 630 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 633 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 57/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 88 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 808 ms. Remains : 57/58 places, 1278/1278 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 348242 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 348242 steps, saw 54294 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1278 rows 57 cols
[2024-05-21 20:34:03] [INFO ] Computed 13 invariants in 7 ms
[2024-05-21 20:34:03] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:34:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 20:34:03] [INFO ] After 455ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:34:03] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-05-21 20:34:03] [INFO ] After 80ms SMT Verify possible using 221 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:34:04] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 62 ms.
[2024-05-21 20:34:04] [INFO ] After 749ms 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 33 ms.
Support contains 6 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1278/1278 transitions.
Applied a total of 0 rules in 86 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 57/57 places, 1278/1278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1278/1278 transitions.
Applied a total of 0 rules in 95 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
[2024-05-21 20:34:04] [INFO ] Invariant cache hit.
[2024-05-21 20:34:04] [INFO ] Implicit Places using invariants in 603 ms returned []
[2024-05-21 20:34:04] [INFO ] Invariant cache hit.
[2024-05-21 20:34:05] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-05-21 20:34:06] [INFO ] Implicit Places using invariants and state equation in 1142 ms returned []
Implicit Place search using SMT with State Equation took 1746 ms to find 0 implicit places.
[2024-05-21 20:34:06] [INFO ] Redundant transitions in 46 ms returned []
[2024-05-21 20:34:06] [INFO ] Invariant cache hit.
[2024-05-21 20:34:07] [INFO ] Dead Transitions using invariants and state equation in 1251 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3147 ms. Remains : 57/57 places, 1278/1278 transitions.
Applied a total of 0 rules in 102 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-21 20:34:07] [INFO ] Invariant cache hit.
[2024-05-21 20:34:07] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:34:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 20:34:08] [INFO ] After 444ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:34:08] [INFO ] After 552ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2024-05-21 20:34:08] [INFO ] After 648ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (X p0)), (G (NOT (AND p1 p3))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p3), (F (NOT p0)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 186 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Support contains 6 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 5 ms. Remains 84 /84 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-05-21 20:34:08] [INFO ] Computed 12 invariants in 9 ms
[2024-05-21 20:34:09] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-21 20:34:09] [INFO ] Invariant cache hit.
[2024-05-21 20:34:09] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-21 20:34:09] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1156 ms to find 0 implicit places.
[2024-05-21 20:34:09] [INFO ] Invariant cache hit.
[2024-05-21 20:34:10] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1878 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 (NOT p2) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 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 189 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 459 resets, run finished after 507 ms. (steps per millisecond=19 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 20:34:11] [INFO ] Invariant cache hit.
[2024-05-21 20:34:11] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-21 20:34:12] [INFO ] After 655ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-21 20:34:12] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-21 20:34:12] [INFO ] After 111ms SMT Verify possible using 303 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:34:12] [INFO ] After 823ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:34:12] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-21 20:34:13] [INFO ] After 540ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:34:13] [INFO ] After 96ms SMT Verify possible using 303 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:34:13] [INFO ] After 223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 73 ms.
[2024-05-21 20:34:13] [INFO ] After 901ms 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 34 ms.
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Graph (complete) has 1126 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 83 transition count 1373
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 26 place count 73 transition count 1371
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 71 transition count 1371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 28 place count 71 transition count 1370
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 70 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 69 transition count 1369
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 69 transition count 1369
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 66 transition count 1366
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 46 place count 66 transition count 1358
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 3 with 88 rules applied. Total rules applied 134 place count 58 transition count 1278
Applied a total of 134 rules in 271 ms. Remains 58 /84 variables (removed 26) and now considering 1278/1387 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 271 ms. Remains : 58/84 places, 1278/1387 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 363844 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :{}
Probabilistic random walk after 363844 steps, saw 56409 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1278 rows 58 cols
[2024-05-21 20:34:17] [INFO ] Computed 14 invariants in 7 ms
[2024-05-21 20:34:17] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-21 20:34:17] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:34:17] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-21 20:34:17] [INFO ] After 466ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:34:17] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-05-21 20:34:17] [INFO ] After 80ms SMT Verify possible using 221 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:34:17] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 62 ms.
[2024-05-21 20:34:17] [INFO ] After 763ms 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 31 ms.
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 95 ms. Remains 58 /58 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 58/58 places, 1278/1278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 85 ms. Remains 58 /58 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
[2024-05-21 20:34:18] [INFO ] Invariant cache hit.
[2024-05-21 20:34:18] [INFO ] Implicit Places using invariants in 611 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 613 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 57/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 86 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 786 ms. Remains : 57/58 places, 1278/1278 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 370527 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :{}
Probabilistic random walk after 370527 steps, saw 57252 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1278 rows 57 cols
[2024-05-21 20:34:22] [INFO ] Computed 13 invariants in 7 ms
[2024-05-21 20:34:22] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-21 20:34:22] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:34:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-21 20:34:22] [INFO ] After 448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:34:22] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-05-21 20:34:22] [INFO ] After 79ms SMT Verify possible using 221 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:34:23] [INFO ] After 189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 64 ms.
[2024-05-21 20:34:23] [INFO ] After 746ms 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 34 ms.
Support contains 6 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1278/1278 transitions.
Applied a total of 0 rules in 85 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 57/57 places, 1278/1278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1278/1278 transitions.
Applied a total of 0 rules in 86 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
[2024-05-21 20:34:23] [INFO ] Invariant cache hit.
[2024-05-21 20:34:23] [INFO ] Implicit Places using invariants in 616 ms returned []
[2024-05-21 20:34:23] [INFO ] Invariant cache hit.
[2024-05-21 20:34:24] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-05-21 20:34:25] [INFO ] Implicit Places using invariants and state equation in 1132 ms returned []
Implicit Place search using SMT with State Equation took 1754 ms to find 0 implicit places.
[2024-05-21 20:34:25] [INFO ] Redundant transitions in 46 ms returned []
[2024-05-21 20:34:25] [INFO ] Invariant cache hit.
[2024-05-21 20:34:26] [INFO ] Dead Transitions using invariants and state equation in 1151 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3046 ms. Remains : 57/57 places, 1278/1278 transitions.
Applied a total of 0 rules in 86 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-21 20:34:26] [INFO ] Invariant cache hit.
[2024-05-21 20:34:26] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 20:34:26] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:34:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-21 20:34:27] [INFO ] After 604ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:34:27] [INFO ] After 719ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-05-21 20:34:27] [INFO ] After 835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p2) p1), true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 104 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 185 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 184 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 182 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Product exploration explored 100000 steps with 25000 reset in 7496 ms.
Product exploration explored 100000 steps with 25000 reset in 7501 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 185 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 84 transition count 1387
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 12 place count 84 transition count 1389
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 84 transition count 1389
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 84 transition count 1389
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 83 transition count 1388
Deduced a syphon composed of 14 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 83 transition count 1388
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 15 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 83 transition count 1391
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 18 rules in 262 ms. Remains 83 /84 variables (removed 1) and now considering 1391/1387 (removed -4) transitions.
[2024-05-21 20:34:43] [INFO ] Redundant transitions in 70 ms returned []
// Phase 1: matrix 1391 rows 83 cols
[2024-05-21 20:34:43] [INFO ] Computed 12 invariants in 8 ms
[2024-05-21 20:34:44] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/84 places, 1391/1387 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1234 ms. Remains : 83/84 places, 1391/1387 transitions.
Built C files in :
/tmp/ltsmin9451760867521036510
[2024-05-21 20:34:44] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9451760867521036510
Running compilation step : cd /tmp/ltsmin9451760867521036510;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin9451760867521036510;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin9451760867521036510;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 6 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 8 ms. Remains 84 /84 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-05-21 20:34:47] [INFO ] Computed 12 invariants in 10 ms
[2024-05-21 20:34:48] [INFO ] Implicit Places using invariants in 672 ms returned []
[2024-05-21 20:34:48] [INFO ] Invariant cache hit.
[2024-05-21 20:34:48] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-21 20:34:49] [INFO ] Implicit Places using invariants and state equation in 1167 ms returned []
Implicit Place search using SMT with State Equation took 1841 ms to find 0 implicit places.
[2024-05-21 20:34:49] [INFO ] Invariant cache hit.
[2024-05-21 20:34:50] [INFO ] Dead Transitions using invariants and state equation in 718 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2568 ms. Remains : 84/84 places, 1387/1387 transitions.
Built C files in :
/tmp/ltsmin5800542938062113794
[2024-05-21 20:34:50] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5800542938062113794
Running compilation step : cd /tmp/ltsmin5800542938062113794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5800542938062113794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5800542938062113794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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)
[2024-05-21 20:34:53] [INFO ] Flatten gal took : 147 ms
[2024-05-21 20:34:53] [INFO ] Flatten gal took : 150 ms
[2024-05-21 20:34:53] [INFO ] Time to serialize gal into /tmp/LTL3549591640748230079.gal : 24 ms
[2024-05-21 20:34:53] [INFO ] Time to serialize properties into /tmp/LTL10774055290624317938.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3549591640748230079.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1134269549229550482.hoa' '-atoms' '/tmp/LTL10774055290624317938.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10774055290624317938.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1134269549229550482.hoa
Detected timeout of ITS tools.
[2024-05-21 20:35:09] [INFO ] Flatten gal took : 147 ms
[2024-05-21 20:35:09] [INFO ] Flatten gal took : 148 ms
[2024-05-21 20:35:09] [INFO ] Time to serialize gal into /tmp/LTL16911165665059370474.gal : 23 ms
[2024-05-21 20:35:09] [INFO ] Time to serialize properties into /tmp/LTL5100779069218758455.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16911165665059370474.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5100779069218758455.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X(("(((p1==0)||(p12==0))||((p54==0)||(p89==0)))")&&(F((G(F("(((p1!=1)||(p5!=1))||((p19!=1)||(p89!=1)))")))||(("(((p1!=1)||(p...382
Formula 0 simplified : XXG(!"(((((p17==0)||(p27==0))||((p31==0)||(p38==0)))||(((p45==0)||(p55==0))||((p59==0)||(p69==0))))||(((p73==0)||(p80==0))||(p90==0)...364
Detected timeout of ITS tools.
[2024-05-21 20:35:24] [INFO ] Flatten gal took : 163 ms
[2024-05-21 20:35:24] [INFO ] Applying decomposition
[2024-05-21 20:35:24] [INFO ] Flatten gal took : 146 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15789678558036658508.txt' '-o' '/tmp/graph15789678558036658508.bin' '-w' '/tmp/graph15789678558036658508.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15789678558036658508.bin' '-l' '-1' '-v' '-w' '/tmp/graph15789678558036658508.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:35:25] [INFO ] Decomposing Gal with order
[2024-05-21 20:35:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:35:25] [INFO ] Removed a total of 12316 redundant transitions.
[2024-05-21 20:35:25] [INFO ] Flatten gal took : 268 ms
[2024-05-21 20:35:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 72 ms.
[2024-05-21 20:35:25] [INFO ] Time to serialize gal into /tmp/LTL15634916948323299126.gal : 8 ms
[2024-05-21 20:35:25] [INFO ] Time to serialize properties into /tmp/LTL17827323099323455237.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15634916948323299126.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17827323099323455237.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X(("(((u20.p1==0)||(u20.p12==0))||((u11.p54==0)||(u20.p89==0)))")&&(F((G(F("(((u20.p1!=1)||(u20.p5!=1))||((u1.p19!=1)||(u20....509
Formula 0 simplified : XXG(!"(((((i0.u0.p17==0)||(i0.u3.p27==0))||((i0.u4.p31==0)||(i0.u6.p38==0)))||(((i0.u8.p45==0)||(u11.p55==0))||((i0.u12.p59==0)||(u1...491
Reverse transition relation is NOT exact ! Due to transitions t661, t662, t663, t664, t665, t666, t667, t668, t669, t670, t671, t672, t673, t674, t675, t67...2088
Computing Next relation with stutter on 1.29803e+06 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
788 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,7.9403,256672,1,0,361992,1883,11577,1.97386e+06,518,12241,551978
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutonomousCar-PT-10a-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutonomousCar-PT-10a-LTLFireability-14 finished in 122267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 11 ms. Remains 85 /89 variables (removed 4) and now considering 1398/1442 (removed 44) transitions.
// Phase 1: matrix 1398 rows 85 cols
[2024-05-21 20:35:35] [INFO ] Computed 12 invariants in 8 ms
[2024-05-21 20:35:35] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-21 20:35:35] [INFO ] Invariant cache hit.
[2024-05-21 20:35:35] [INFO ] State equation strengthened by 313 read => feed constraints.
[2024-05-21 20:35:36] [INFO ] Implicit Places using invariants and state equation in 824 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
[2024-05-21 20:35:36] [INFO ] Invariant cache hit.
[2024-05-21 20:35:37] [INFO ] Dead Transitions using invariants and state equation in 975 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 2140 ms. Remains : 85/89 places, 1398/1442 transitions.
Stuttering acceptance computed with spot in 425 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 16685 reset in 5512 ms.
Product exploration explored 100000 steps with 16632 reset in 5515 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 111 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 309 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 469 resets, run finished after 515 ms. (steps per millisecond=19 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-21 20:35:49] [INFO ] Invariant cache hit.
[2024-05-21 20:35:49] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 20:35:50] [INFO ] After 542ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-21 20:35:50] [INFO ] State equation strengthened by 313 read => feed constraints.
[2024-05-21 20:35:50] [INFO ] After 70ms SMT Verify possible using 313 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 20:35:50] [INFO ] After 667ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 20:35:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 20:35:51] [INFO ] After 613ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-21 20:35:51] [INFO ] After 140ms SMT Verify possible using 313 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-21 20:35:51] [INFO ] After 329ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 105 ms.
[2024-05-21 20:35:51] [INFO ] After 1103ms 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 139 ms.
Support contains 6 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.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 84 transition count 1383
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 26 place count 73 transition count 1383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 73 transition count 1382
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 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 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 68 transition count 1378
Free-agglomeration rule applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 47 place count 68 transition count 1367
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 148 place count 57 transition count 1277
Applied a total of 148 rules in 270 ms. Remains 57 /85 variables (removed 28) and now considering 1277/1398 (removed 121) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 57/85 places, 1277/1398 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 449 ms. (steps per millisecond=22 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1277 rows 57 cols
[2024-05-21 20:35:52] [INFO ] Computed 14 invariants in 7 ms
[2024-05-21 20:35:52] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:35:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-21 20:35:53] [INFO ] After 491ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:35:53] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-05-21 20:35:53] [INFO ] After 82ms SMT Verify possible using 221 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:35:53] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 65 ms.
[2024-05-21 20:35:53] [INFO ] After 796ms 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 33 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 89 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 92 ms. Remains : 57/57 places, 1277/1277 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 444441 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :{}
Probabilistic random walk after 444441 steps, saw 53624 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-21 20:35:57] [INFO ] Invariant cache hit.
[2024-05-21 20:35:57] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:35:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-21 20:35:57] [INFO ] After 496ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:35:57] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-05-21 20:35:57] [INFO ] After 82ms SMT Verify possible using 221 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:35:57] [INFO ] After 189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 62 ms.
[2024-05-21 20:35:57] [INFO ] After 789ms 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 29 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 86 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 87 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 89 ms. Remains 57 /57 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
[2024-05-21 20:35:58] [INFO ] Invariant cache hit.
[2024-05-21 20:35:58] [INFO ] Implicit Places using invariants in 614 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 617 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 88 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 795 ms. Remains : 56/57 places, 1277/1277 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 387757 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :{}
Probabilistic random walk after 387757 steps, saw 47078 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1277 rows 56 cols
[2024-05-21 20:36:02] [INFO ] Computed 13 invariants in 9 ms
[2024-05-21 20:36:02] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:36:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 20:36:02] [INFO ] After 501ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:36:02] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-05-21 20:36:02] [INFO ] After 75ms SMT Verify possible using 221 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:36:03] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-21 20:36:03] [INFO ] After 792ms 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 31 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 82 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 83 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 83 ms. Remains 56 /56 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
[2024-05-21 20:36:03] [INFO ] Invariant cache hit.
[2024-05-21 20:36:03] [INFO ] Implicit Places using invariants in 617 ms returned []
[2024-05-21 20:36:03] [INFO ] Invariant cache hit.
[2024-05-21 20:36:04] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-05-21 20:36:05] [INFO ] Implicit Places using invariants and state equation in 1160 ms returned []
Implicit Place search using SMT with State Equation took 1779 ms to find 0 implicit places.
[2024-05-21 20:36:05] [INFO ] Redundant transitions in 45 ms returned []
[2024-05-21 20:36:05] [INFO ] Invariant cache hit.
[2024-05-21 20:36:06] [INFO ] Dead Transitions using invariants and state equation in 994 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2909 ms. Remains : 56/56 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.
Running SMT prover for 2 properties.
[2024-05-21 20:36:06] [INFO ] Invariant cache hit.
[2024-05-21 20:36:06] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:36:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-21 20:36:06] [INFO ] After 481ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:36:06] [INFO ] After 588ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 59 ms.
[2024-05-21 20:36:07] [INFO ] After 692ms 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 (NOT p1) p2)))]
False Knowledge obtained : [(F p0), (F p2)]
Knowledge based reduction with 6 factoid took 156 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 190 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 189 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 5 ms. Remains 85 /85 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
// Phase 1: matrix 1398 rows 85 cols
[2024-05-21 20:36:07] [INFO ] Computed 12 invariants in 8 ms
[2024-05-21 20:36:07] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-05-21 20:36:07] [INFO ] Invariant cache hit.
[2024-05-21 20:36:08] [INFO ] State equation strengthened by 313 read => feed constraints.
[2024-05-21 20:36:08] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1186 ms to find 0 implicit places.
[2024-05-21 20:36:08] [INFO ] Invariant cache hit.
[2024-05-21 20:36:09] [INFO ] Dead Transitions using invariants and state equation in 1184 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2377 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 119 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 250 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 460 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 20:36:10] [INFO ] Invariant cache hit.
[2024-05-21 20:36:10] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 20:36:10] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 20:36:11] [INFO ] After 481ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 20:36:11] [INFO ] State equation strengthened by 313 read => feed constraints.
[2024-05-21 20:36:11] [INFO ] After 62ms SMT Verify possible using 313 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 20:36:11] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-21 20:36:11] [INFO ] After 690ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 28 ms.
Support contains 4 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.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 84 transition count 1383
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 26 place count 73 transition count 1383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 73 transition count 1382
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 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 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 67 transition count 1367
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 48 place count 67 transition count 1357
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 148 place count 57 transition count 1267
Applied a total of 148 rules in 260 ms. Remains 57 /85 variables (removed 28) and now considering 1267/1398 (removed 131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 261 ms. Remains : 57/85 places, 1267/1398 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 512703 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 512703 steps, saw 73583 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1267 rows 57 cols
[2024-05-21 20:36:15] [INFO ] Computed 14 invariants in 6 ms
[2024-05-21 20:36:15] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 20:36:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-21 20:36:15] [INFO ] After 435ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 20:36:15] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-05-21 20:36:15] [INFO ] After 50ms SMT Verify possible using 211 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 20:36:15] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-21 20:36:15] [INFO ] After 609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 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 85 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 85 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 87 ms. Remains 57 /57 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
[2024-05-21 20:36:16] [INFO ] Invariant cache hit.
[2024-05-21 20:36:16] [INFO ] Implicit Places using invariants in 605 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 608 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 84 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 784 ms. Remains : 56/57 places, 1267/1267 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 516325 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 516325 steps, saw 74059 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1267 rows 56 cols
[2024-05-21 20:36:20] [INFO ] Computed 13 invariants in 7 ms
[2024-05-21 20:36:20] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 20:36:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 20:36:20] [INFO ] After 453ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 20:36:20] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-05-21 20:36:20] [INFO ] After 47ms SMT Verify possible using 211 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 20:36:20] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-21 20:36:20] [INFO ] After 624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 27 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 84 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 85 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 84 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
[2024-05-21 20:36:20] [INFO ] Invariant cache hit.
[2024-05-21 20:36:21] [INFO ] Implicit Places using invariants in 607 ms returned []
[2024-05-21 20:36:21] [INFO ] Invariant cache hit.
[2024-05-21 20:36:21] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-05-21 20:36:22] [INFO ] Implicit Places using invariants and state equation in 1167 ms returned []
Implicit Place search using SMT with State Equation took 1777 ms to find 0 implicit places.
[2024-05-21 20:36:22] [INFO ] Redundant transitions in 45 ms returned []
[2024-05-21 20:36:22] [INFO ] Invariant cache hit.
[2024-05-21 20:36:23] [INFO ] Dead Transitions using invariants and state equation in 920 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2838 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.
[2024-05-21 20:36:23] [INFO ] Invariant cache hit.
[2024-05-21 20:36:23] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 20:36:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 20:36:24] [INFO ] After 450ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 20:36:24] [INFO ] After 505ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-21 20:36:24] [INFO ] After 567ms 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 109 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 188 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 16662 reset in 5370 ms.
Product exploration explored 100000 steps with 16708 reset in 5410 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 193 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 0 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 173 ms. Remains 84 /85 variables (removed 1) and now considering 1392/1398 (removed 6) transitions.
[2024-05-21 20:36:36] [INFO ] Redundant transitions in 67 ms returned []
// Phase 1: matrix 1392 rows 84 cols
[2024-05-21 20:36:36] [INFO ] Computed 12 invariants in 9 ms
[2024-05-21 20:36:37] [INFO ] Dead Transitions using invariants and state equation in 1049 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 1300 ms. Remains : 84/85 places, 1392/1398 transitions.
Built C files in :
/tmp/ltsmin11005616607537668208
[2024-05-21 20:36:37] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11005616607537668208
Running compilation step : cd /tmp/ltsmin11005616607537668208;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin11005616607537668208;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin11005616607537668208;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 11 ms. Remains 84 /85 variables (removed 1) and now considering 1387/1398 (removed 11) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-05-21 20:36:40] [INFO ] Computed 12 invariants in 8 ms
[2024-05-21 20:36:40] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-21 20:36:40] [INFO ] Invariant cache hit.
[2024-05-21 20:36:41] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-21 20:36:41] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 1138 ms to find 0 implicit places.
[2024-05-21 20:36:41] [INFO ] Invariant cache hit.
[2024-05-21 20:36:42] [INFO ] Dead Transitions using invariants and state equation in 733 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 1884 ms. Remains : 84/85 places, 1387/1398 transitions.
Built C files in :
/tmp/ltsmin16422466139982848711
[2024-05-21 20:36:42] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16422466139982848711
Running compilation step : cd /tmp/ltsmin16422466139982848711;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16422466139982848711;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16422466139982848711;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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)
[2024-05-21 20:36:45] [INFO ] Flatten gal took : 157 ms
[2024-05-21 20:36:45] [INFO ] Flatten gal took : 145 ms
[2024-05-21 20:36:45] [INFO ] Time to serialize gal into /tmp/LTL18229306991455449463.gal : 22 ms
[2024-05-21 20:36:45] [INFO ] Time to serialize properties into /tmp/LTL12462172655815292827.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18229306991455449463.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1770660085367893673.hoa' '-atoms' '/tmp/LTL12462172655815292827.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12462172655815292827.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1770660085367893673.hoa
Detected timeout of ITS tools.
[2024-05-21 20:37:01] [INFO ] Flatten gal took : 146 ms
[2024-05-21 20:37:01] [INFO ] Flatten gal took : 147 ms
[2024-05-21 20:37:01] [INFO ] Time to serialize gal into /tmp/LTL12583470122014133705.gal : 22 ms
[2024-05-21 20:37:01] [INFO ] Time to serialize properties into /tmp/LTL8518968228132744117.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12583470122014133705.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8518968228132744117.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.202304061127/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.
[2024-05-21 20:37:16] [INFO ] Flatten gal took : 150 ms
[2024-05-21 20:37:16] [INFO ] Applying decomposition
[2024-05-21 20:37:16] [INFO ] Flatten gal took : 150 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10269837813715473665.txt' '-o' '/tmp/graph10269837813715473665.bin' '-w' '/tmp/graph10269837813715473665.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10269837813715473665.bin' '-l' '-1' '-v' '-w' '/tmp/graph10269837813715473665.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:37:17] [INFO ] Decomposing Gal with order
[2024-05-21 20:37:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:37:17] [INFO ] Removed a total of 12935 redundant transitions.
[2024-05-21 20:37:17] [INFO ] Flatten gal took : 245 ms
[2024-05-21 20:37:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 103 ms.
[2024-05-21 20:37:17] [INFO ] Time to serialize gal into /tmp/LTL17053771122984019359.gal : 12 ms
[2024-05-21 20:37:17] [INFO ] Time to serialize properties into /tmp/LTL17325816322079769102.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17053771122984019359.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17325816322079769102.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G((X((X(X("(((i1.u0.p1==0)||(i1.u0.p6==0))||((i1.u7.p28==0)||(i1.u0.p89==0)))")))||(G("(((i1.u0.p1==1)&&(i1.u0.p5==1))&&((i0.u8.p...396
Formula 0 simplified : XF(!"(((((i8.u3.p20==1)&&(i8.u5.p24==1))&&((i8.u9.p34==1)&&(i8.u10.p38==1)))&&(((i8.u13.p45==1)&&(i8.u16.p52==1))&&((i8.u19.p59==1)&...382
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10374751216106495241
[2024-05-21 20:37:32] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10374751216106495241
Running compilation step : cd /tmp/ltsmin10374751216106495241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10374751216106495241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10374751216106495241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 120746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(!p1 U (G(!p1)||(!p1&&(!p2 U (p3||G(!p2))))))))))'
Found a Shortening insensitive property : AutonomousCar-PT-10a-LTLFireability-09
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3)))]
Support contains 19 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 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 89 transition count 1435
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 82 transition count 1434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 81 transition count 1434
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 16 place count 81 transition count 1432
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 20 place count 79 transition count 1432
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 25 place count 74 transition count 1377
Iterating global reduction 3 with 5 rules applied. Total rules applied 30 place count 74 transition count 1377
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 3 with 2 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 3 with 2 rules applied. Total rules applied 34 place count 72 transition count 1376
Applied a total of 34 rules in 130 ms. Remains 72 /89 variables (removed 17) and now considering 1376/1442 (removed 66) transitions.
// Phase 1: matrix 1376 rows 72 cols
[2024-05-21 20:37:36] [INFO ] Computed 12 invariants in 7 ms
[2024-05-21 20:37:36] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-21 20:37:36] [INFO ] Invariant cache hit.
[2024-05-21 20:37:37] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-05-21 20:37:37] [INFO ] Implicit Places using invariants and state equation in 1107 ms returned []
Implicit Place search using SMT with State Equation took 1451 ms to find 0 implicit places.
[2024-05-21 20:37:37] [INFO ] Invariant cache hit.
[2024-05-21 20:37:38] [INFO ] Dead Transitions using invariants and state equation in 802 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 72/89 places, 1376/1442 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2384 ms. Remains : 72/89 places, 1376/1442 transitions.
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p3) p2 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={1} source=2 dest: 4}], [{ cond=p1, acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p3) p2 p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p2) p1)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s8 0) (EQ s36 0) (EQ s68 0)), p1:(AND (EQ s1 1) (EQ s5 1) (EQ s48 1) (EQ s68 1)), p3:(AND (EQ s15 1) (EQ s22 1) (EQ s27 1) (EQ s32 1)...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 446 reset in 386 ms.
Product exploration explored 100000 steps with 932 reset in 633 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 p1) (NOT p3) (NOT p2)), (X (AND p0 (NOT p3) (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (NOT (OR (NOT p0) p1))), (X (X (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (OR (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 112 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3)))]
Incomplete random walk after 10000 steps, including 540 resets, run finished after 632 ms. (steps per millisecond=15 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 294675 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{0=1, 1=1, 9=1}
Probabilistic random walk after 294675 steps, saw 43030 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :3
Running SMT prover for 7 properties.
[2024-05-21 20:37:44] [INFO ] Invariant cache hit.
[2024-05-21 20:37:44] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-21 20:37:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 20:37:44] [INFO ] After 593ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2024-05-21 20:37:44] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-05-21 20:37:45] [INFO ] After 217ms SMT Verify possible using 305 Read/Feed constraints in natural domain returned unsat :2 sat :5
[2024-05-21 20:37:45] [INFO ] After 527ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 171 ms.
[2024-05-21 20:37:45] [INFO ] After 1366ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 104 ms.
Support contains 19 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 1376/1376 transitions.
Graph (complete) has 1117 edges and 72 vertex of which 71 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 71 transition count 1373
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 70 transition count 1371
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 70 transition count 1371
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 14 place count 70 transition count 1362
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 93 place count 61 transition count 1292
Applied a total of 93 rules in 212 ms. Remains 61 /72 variables (removed 11) and now considering 1292/1376 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 61/72 places, 1292/1376 transitions.
Incomplete random walk after 10000 steps, including 105 resets, run finished after 449 ms. (steps per millisecond=22 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1292 rows 61 cols
[2024-05-21 20:37:46] [INFO ] Computed 13 invariants in 8 ms
[2024-05-21 20:37:46] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 20:37:46] [INFO ] [Real]Absence check using 12 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:37:46] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:37:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-21 20:37:46] [INFO ] [Nat]Absence check using 12 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 20:37:47] [INFO ] After 516ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:37:47] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-05-21 20:37:47] [INFO ] After 82ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:37:47] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 70 ms.
[2024-05-21 20:37:47] [INFO ] After 826ms 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 32 ms.
Support contains 17 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1292/1292 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 1291
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 60 transition count 1281
Applied a total of 12 rules in 149 ms. Remains 60 /61 variables (removed 1) and now considering 1281/1292 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 60/61 places, 1281/1292 transitions.
Incomplete random walk after 10000 steps, including 121 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 363223 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :{}
Probabilistic random walk after 363223 steps, saw 55218 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1281 rows 60 cols
[2024-05-21 20:37:51] [INFO ] Computed 13 invariants in 7 ms
[2024-05-21 20:37:51] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 20:37:51] [INFO ] [Real]Absence check using 12 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:37:51] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:37:51] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 20:37:51] [INFO ] [Nat]Absence check using 12 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:37:51] [INFO ] After 470ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:37:51] [INFO ] State equation strengthened by 222 read => feed constraints.
[2024-05-21 20:37:51] [INFO ] After 87ms SMT Verify possible using 222 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:37:51] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 66 ms.
[2024-05-21 20:37:51] [INFO ] After 782ms 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 32 ms.
Support contains 17 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1281/1281 transitions.
Applied a total of 0 rules in 73 ms. Remains 60 /60 variables (removed 0) and now considering 1281/1281 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 60/60 places, 1281/1281 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1281/1281 transitions.
Applied a total of 0 rules in 74 ms. Remains 60 /60 variables (removed 0) and now considering 1281/1281 (removed 0) transitions.
[2024-05-21 20:37:52] [INFO ] Invariant cache hit.
[2024-05-21 20:37:52] [INFO ] Implicit Places using invariants in 314 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 317 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/60 places, 1281/1281 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 58 transition count 1280
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 1280
Applied a total of 2 rules in 95 ms. Remains 58 /59 variables (removed 1) and now considering 1280/1281 (removed 1) transitions.
// Phase 1: matrix 1280 rows 58 cols
[2024-05-21 20:37:52] [INFO ] Computed 12 invariants in 6 ms
[2024-05-21 20:37:52] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-21 20:37:52] [INFO ] Invariant cache hit.
[2024-05-21 20:37:53] [INFO ] State equation strengthened by 222 read => feed constraints.
[2024-05-21 20:37:53] [INFO ] Implicit Places using invariants and state equation in 787 ms returned []
Implicit Place search using SMT with State Equation took 1098 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 58/60 places, 1280/1281 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1584 ms. Remains : 58/60 places, 1280/1281 transitions.
Incomplete random walk after 10000 steps, including 101 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 359836 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 359836 steps, saw 54686 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-21 20:37:57] [INFO ] Invariant cache hit.
[2024-05-21 20:37:57] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 20:37:57] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:37:57] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 20:37:57] [INFO ] After 473ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:37:57] [INFO ] State equation strengthened by 222 read => feed constraints.
[2024-05-21 20:37:57] [INFO ] After 84ms SMT Verify possible using 222 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:37:57] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 71 ms.
[2024-05-21 20:37:57] [INFO ] After 787ms 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 31 ms.
Support contains 17 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1280/1280 transitions.
Applied a total of 0 rules in 73 ms. Remains 58 /58 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 58/58 places, 1280/1280 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1280/1280 transitions.
Applied a total of 0 rules in 78 ms. Remains 58 /58 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
[2024-05-21 20:37:58] [INFO ] Invariant cache hit.
[2024-05-21 20:37:58] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-21 20:37:58] [INFO ] Invariant cache hit.
[2024-05-21 20:37:58] [INFO ] State equation strengthened by 222 read => feed constraints.
[2024-05-21 20:37:59] [INFO ] Implicit Places using invariants and state equation in 821 ms returned []
Implicit Place search using SMT with State Equation took 1148 ms to find 0 implicit places.
[2024-05-21 20:37:59] [INFO ] Redundant transitions in 46 ms returned []
[2024-05-21 20:37:59] [INFO ] Invariant cache hit.
[2024-05-21 20:38:00] [INFO ] Dead Transitions using invariants and state equation in 1219 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2500 ms. Remains : 58/58 places, 1280/1280 transitions.
Applied a total of 0 rules in 71 ms. Remains 58 /58 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-21 20:38:00] [INFO ] Invariant cache hit.
[2024-05-21 20:38:00] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 20:38:00] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:38:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 20:38:01] [INFO ] After 466ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:38:01] [INFO ] After 575ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 59 ms.
[2024-05-21 20:38:01] [INFO ] After 672ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (AND p0 (NOT p3) (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (NOT (OR (NOT p0) p1))), (X (X (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (OR (NOT p0) p1)))), (X (X (NOT p1))), (G (NOT (AND p1 p2 (NOT p3)))), (G (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (AND (NOT p1) p2 (NOT p3))), (F (OR (NOT p0) p1)), (F (AND p0 (NOT p1) p2 (NOT p3))), (F (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (F (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))))]
Knowledge based reduction with 14 factoid took 316 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Support contains 19 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 1376/1376 transitions.
Applied a total of 0 rules in 5 ms. Remains 72 /72 variables (removed 0) and now considering 1376/1376 (removed 0) transitions.
// Phase 1: matrix 1376 rows 72 cols
[2024-05-21 20:38:02] [INFO ] Computed 12 invariants in 6 ms
[2024-05-21 20:38:02] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-21 20:38:02] [INFO ] Invariant cache hit.
[2024-05-21 20:38:02] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-05-21 20:38:03] [INFO ] Implicit Places using invariants and state equation in 809 ms returned []
Implicit Place search using SMT with State Equation took 1151 ms to find 0 implicit places.
[2024-05-21 20:38:03] [INFO ] Invariant cache hit.
[2024-05-21 20:38:04] [INFO ] Dead Transitions using invariants and state equation in 1199 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2356 ms. Remains : 72/72 places, 1376/1376 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 p1) p0 (NOT p2) (NOT p3)), (X (NOT (AND (NOT p1) p2 (NOT p3) p0))), (X (NOT (OR p1 (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p3) p0)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) p0)))), (X (X (NOT (OR p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3) p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 125 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Incomplete random walk after 10000 steps, including 534 resets, run finished after 717 ms. (steps per millisecond=13 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 264182 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{0=1, 1=1, 8=1}
Probabilistic random walk after 264182 steps, saw 39733 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :3
Running SMT prover for 6 properties.
[2024-05-21 20:38:09] [INFO ] Invariant cache hit.
[2024-05-21 20:38:09] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 20:38:09] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-21 20:38:09] [INFO ] After 622ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-21 20:38:09] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-05-21 20:38:10] [INFO ] After 237ms SMT Verify possible using 305 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-21 20:38:10] [INFO ] After 598ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 201 ms.
[2024-05-21 20:38:10] [INFO ] After 1499ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 163 ms.
Support contains 19 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 1376/1376 transitions.
Graph (complete) has 1117 edges and 72 vertex of which 71 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 71 transition count 1373
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 70 transition count 1371
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 70 transition count 1371
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 14 place count 70 transition count 1362
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 93 place count 61 transition count 1292
Applied a total of 93 rules in 199 ms. Remains 61 /72 variables (removed 11) and now considering 1292/1376 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 61/72 places, 1292/1376 transitions.
Incomplete random walk after 10000 steps, including 151 resets, run finished after 578 ms. (steps per millisecond=17 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 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 23 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 295574 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 295574 steps, saw 44712 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1292 rows 61 cols
[2024-05-21 20:38:14] [INFO ] Computed 13 invariants in 8 ms
[2024-05-21 20:38:15] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 20:38:15] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 20:38:15] [INFO ] [Nat]Absence check using 12 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:38:15] [INFO ] After 608ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-21 20:38:15] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-05-21 20:38:16] [INFO ] After 231ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-21 20:38:16] [INFO ] After 571ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 189 ms.
[2024-05-21 20:38:16] [INFO ] After 1441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 176 ms.
Support contains 19 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1292/1292 transitions.
Applied a total of 0 rules in 75 ms. Remains 61 /61 variables (removed 0) and now considering 1292/1292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 61/61 places, 1292/1292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1292/1292 transitions.
Applied a total of 0 rules in 76 ms. Remains 61 /61 variables (removed 0) and now considering 1292/1292 (removed 0) transitions.
[2024-05-21 20:38:16] [INFO ] Invariant cache hit.
[2024-05-21 20:38:17] [INFO ] Implicit Places using invariants in 309 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 312 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/61 places, 1292/1292 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 1291
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 1291
Applied a total of 2 rules in 88 ms. Remains 59 /60 variables (removed 1) and now considering 1291/1292 (removed 1) transitions.
// Phase 1: matrix 1291 rows 59 cols
[2024-05-21 20:38:17] [INFO ] Computed 12 invariants in 7 ms
[2024-05-21 20:38:17] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-21 20:38:17] [INFO ] Invariant cache hit.
[2024-05-21 20:38:18] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-05-21 20:38:18] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1077 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 59/61 places, 1291/1292 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1553 ms. Remains : 59/61 places, 1291/1292 transitions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 316913 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{}
Probabilistic random walk after 316913 steps, saw 47570 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-21 20:38:22] [INFO ] Invariant cache hit.
[2024-05-21 20:38:22] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 20:38:22] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 20:38:23] [INFO ] After 586ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-21 20:38:23] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-05-21 20:38:23] [INFO ] After 213ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-21 20:38:23] [INFO ] After 545ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 181 ms.
[2024-05-21 20:38:23] [INFO ] After 1377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 153 ms.
Support contains 19 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 1291/1291 transitions.
Applied a total of 0 rules in 72 ms. Remains 59 /59 variables (removed 0) and now considering 1291/1291 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 59/59 places, 1291/1291 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 1291/1291 transitions.
Applied a total of 0 rules in 71 ms. Remains 59 /59 variables (removed 0) and now considering 1291/1291 (removed 0) transitions.
[2024-05-21 20:38:24] [INFO ] Invariant cache hit.
[2024-05-21 20:38:24] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-21 20:38:24] [INFO ] Invariant cache hit.
[2024-05-21 20:38:24] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-05-21 20:38:25] [INFO ] Implicit Places using invariants and state equation in 727 ms returned []
Implicit Place search using SMT with State Equation took 1017 ms to find 0 implicit places.
[2024-05-21 20:38:25] [INFO ] Redundant transitions in 44 ms returned []
[2024-05-21 20:38:25] [INFO ] Invariant cache hit.
[2024-05-21 20:38:25] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1851 ms. Remains : 59/59 places, 1291/1291 transitions.
Applied a total of 0 rules in 69 ms. Remains 59 /59 variables (removed 0) and now considering 1291/1291 (removed 0) transitions.
Running SMT prover for 6 properties.
[2024-05-21 20:38:26] [INFO ] Invariant cache hit.
[2024-05-21 20:38:26] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 20:38:26] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-21 20:38:26] [INFO ] After 562ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-21 20:38:27] [INFO ] After 879ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 171 ms.
[2024-05-21 20:38:27] [INFO ] After 1106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (NOT (AND (NOT p1) p2 (NOT p3) p0))), (X (NOT (OR p1 (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p3) p0)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) p0)))), (X (X (NOT (OR p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3) p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (OR (NOT p0) p1)), (F (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (F (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))))]
Knowledge based reduction with 12 factoid took 203 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Product exploration explored 100000 steps with 1219 reset in 664 ms.
Product exploration explored 100000 steps with 3686 reset in 1814 ms.
Built C files in :
/tmp/ltsmin13960610787315442392
[2024-05-21 20:38:30] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13960610787315442392
Running compilation step : cd /tmp/ltsmin13960610787315442392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13960610787315442392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13960610787315442392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 19 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 1376/1376 transitions.
Applied a total of 0 rules in 5 ms. Remains 72 /72 variables (removed 0) and now considering 1376/1376 (removed 0) transitions.
// Phase 1: matrix 1376 rows 72 cols
[2024-05-21 20:38:33] [INFO ] Computed 12 invariants in 7 ms
[2024-05-21 20:38:34] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-21 20:38:34] [INFO ] Invariant cache hit.
[2024-05-21 20:38:34] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-05-21 20:38:34] [INFO ] Implicit Places using invariants and state equation in 774 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
[2024-05-21 20:38:34] [INFO ] Invariant cache hit.
[2024-05-21 20:38:35] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1777 ms. Remains : 72/72 places, 1376/1376 transitions.
Built C files in :
/tmp/ltsmin16821271835516078712
[2024-05-21 20:38:35] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16821271835516078712
Running compilation step : cd /tmp/ltsmin16821271835516078712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16821271835516078712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16821271835516078712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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)
[2024-05-21 20:38:38] [INFO ] Flatten gal took : 200 ms
[2024-05-21 20:38:39] [INFO ] Flatten gal took : 196 ms
[2024-05-21 20:38:39] [INFO ] Time to serialize gal into /tmp/LTL10451036792341853363.gal : 22 ms
[2024-05-21 20:38:39] [INFO ] Time to serialize properties into /tmp/LTL8991621495361001233.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10451036792341853363.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4640354372217022138.hoa' '-atoms' '/tmp/LTL8991621495361001233.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8991621495361001233.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4640354372217022138.hoa
Detected timeout of ITS tools.
[2024-05-21 20:38:54] [INFO ] Flatten gal took : 190 ms
[2024-05-21 20:38:54] [INFO ] Flatten gal took : 195 ms
[2024-05-21 20:38:54] [INFO ] Time to serialize gal into /tmp/LTL12351491933260709646.gal : 21 ms
[2024-05-21 20:38:54] [INFO ] Time to serialize properties into /tmp/LTL1472190003681696805.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12351491933260709646.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1472190003681696805.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(((!("(((p1==1)&&(p6==1))&&((p63==1)&&(p89==1)))"))U((G(!("(((p1==1)&&(p6==1))&&((p63==1)&&(p89==1)))")))||((!("(((p1==1)&&(p6==...533
Formula 0 simplified : XG(!"(((p1==0)||(p9==0))||((p47==0)||(p89==0)))" | (("(((p1==1)&&(p11==1))&&((p70==1)&&(p89==1)))" M !"(((((p17==1)&&(p27==1))&&((p3...355
Detected timeout of ITS tools.
[2024-05-21 20:39:09] [INFO ] Flatten gal took : 191 ms
[2024-05-21 20:39:09] [INFO ] Applying decomposition
[2024-05-21 20:39:10] [INFO ] Flatten gal took : 191 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1944521881327956609.txt' '-o' '/tmp/graph1944521881327956609.bin' '-w' '/tmp/graph1944521881327956609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1944521881327956609.bin' '-l' '-1' '-v' '-w' '/tmp/graph1944521881327956609.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:39:10] [INFO ] Decomposing Gal with order
[2024-05-21 20:39:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:39:10] [INFO ] Removed a total of 12319 redundant transitions.
[2024-05-21 20:39:10] [INFO ] Flatten gal took : 227 ms
[2024-05-21 20:39:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 62 ms.
[2024-05-21 20:39:10] [INFO ] Time to serialize gal into /tmp/LTL7023158514218857092.gal : 10 ms
[2024-05-21 20:39:10] [INFO ] Time to serialize properties into /tmp/LTL10118844375164483341.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7023158514218857092.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10118844375164483341.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F(((!("(((i9.u0.p1==1)&&(i9.u0.p6==1))&&((u16.p63==1)&&(i9.u0.p89==1)))"))U((G(!("(((i9.u0.p1==1)&&(i9.u0.p6==1))&&((u16.p63==1)&...744
Formula 0 simplified : XG(!"(((i9.u0.p1==0)||(i9.u0.p9==0))||((i0.u10.p47==0)||(i9.u0.p89==0)))" | (("(((i9.u0.p1==1)&&(i9.u0.p11==1))&&((u18.p70==1)&&(i9....500
Reverse transition relation is NOT exact ! Due to transitions t469, t470, t471, t472, t473, t474, t475, t476, t477, t478, t479, t480, t481, t482, t483, t48...3738
Computing Next relation with stutter on 1.29803e+06 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin178922293484792621
[2024-05-21 20:39:26] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin178922293484792621
Running compilation step : cd /tmp/ltsmin178922293484792621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin178922293484792621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin178922293484792621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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-09 finished in 113272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X((X(X(p1))||G(p2)))))))'
[2024-05-21 20:39:29] [INFO ] Flatten gal took : 143 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12418132603210625760
[2024-05-21 20:39:29] [INFO ] Computing symmetric may disable matrix : 1442 transitions.
[2024-05-21 20:39:29] [INFO ] Applying decomposition
[2024-05-21 20:39:29] [INFO ] Flatten gal took : 150 ms
[2024-05-21 20:39:29] [INFO ] Computation of Complete disable matrix. took 482 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:39:30] [INFO ] Computing symmetric may enable matrix : 1442 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3424096905728874931.txt' '-o' '/tmp/graph3424096905728874931.bin' '-w' '/tmp/graph3424096905728874931.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3424096905728874931.bin' '-l' '-1' '-v' '-w' '/tmp/graph3424096905728874931.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:39:30] [INFO ] Decomposing Gal with order
[2024-05-21 20:39:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:39:30] [INFO ] Computation of Complete enable matrix. took 72 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:39:30] [INFO ] Removed a total of 13033 redundant transitions.
[2024-05-21 20:39:30] [INFO ] Flatten gal took : 249 ms
[2024-05-21 20:39:30] [INFO ] Computing Do-Not-Accords matrix : 1442 transitions.
[2024-05-21 20:39:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 63 ms.
[2024-05-21 20:39:30] [INFO ] Time to serialize gal into /tmp/LTLFireability15123540477020912726.gal : 6 ms
[2024-05-21 20:39:30] [INFO ] Time to serialize properties into /tmp/LTLFireability2666932699325808472.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15123540477020912726.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2666932699325808472.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
[2024-05-21 20:39:30] [INFO ] Computation of Completed DNA matrix. took 135 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Checking formula 0 : !((X(F(("(((i1.u32.p1==0)||(i1.u32.p9==0))||((i3.u16.p47==0)||(i1.u32.p89==0)))")&&((!("(((i1.u32.p1==1)&&(i1.u32.p6==1))&&((i8.u23.p6...803
Formula 0 simplified : XG(!"(((i1.u32.p1==0)||(i1.u32.p9==0))||((i3.u16.p47==0)||(i1.u32.p89==0)))" | (("(((i1.u32.p1==1)&&(i1.u32.p11==1))&&((i9.u26.p70==...541
[2024-05-21 20:39:30] [INFO ] Built C files in 1421ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12418132603210625760
Running compilation step : cd /tmp/ltsmin12418132603210625760;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 16192 ms.
Running link step : cd /tmp/ltsmin12418132603210625760;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 167 ms.
Running LTSmin : cd /tmp/ltsmin12418132603210625760;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)&&(!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&(!(LTLAPp2==true) U ((LTLAPp3==true)||[](!(LTLAPp2==true))))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin12418132603210625760;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)&&(!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&(!(LTLAPp2==true) U ((LTLAPp3==true)||[](!(LTLAPp2==true))))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12418132603210625760;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp4==true))&&[](<>((LTLAPp5==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 21:03:10] [INFO ] Applying decomposition
[2024-05-21 21:03:10] [INFO ] Flatten gal took : 361 ms
[2024-05-21 21:03:10] [INFO ] Decomposing Gal with order
[2024-05-21 21:03:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:03:11] [INFO ] Removed a total of 12601 redundant transitions.
[2024-05-21 21:03:11] [INFO ] Flatten gal took : 693 ms
[2024-05-21 21:03:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 65 labels/synchronizations in 63 ms.
[2024-05-21 21:03:12] [INFO ] Time to serialize gal into /tmp/LTLFireability18191638807362814797.gal : 1 ms
[2024-05-21 21:03:12] [INFO ] Time to serialize properties into /tmp/LTLFireability4438166640879969360.ltl : 13 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18191638807362814797.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4438166640879969360.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((X(F(("(((u1.p1==0)||(u2.p9==0))||((u7.p47==0)||(u13.p89==0)))")&&((!("(((u1.p1==1)&&(u2.p6==1))&&((u10.p63==1)&&(u13.p89==1)))"))U(...667
Formula 0 simplified : XG(!"(((u1.p1==0)||(u2.p9==0))||((u7.p47==0)||(u13.p89==0)))" | (("(((u1.p1==1)&&(u2.p11==1))&&((u11.p70==1)&&(u13.p89==1)))" M !"((...447
Reverse transition relation is NOT exact ! Due to transitions t90, t120, t190, t260, t320, t404, t803, t1440, u2.t402, u3.t46, u3.t47, u4.t41, u4.t42, u4.t...448
Computing Next relation with stutter on 1.29803e+06 deadlock states
1018 unique states visited
25 strongly connected components in search stack
2027 transitions explored
154 items max in DFS search stack
18268 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,182.7,3502980,1,0,7.08635e+06,2307,1029,1.08684e+07,409,21744,8695849
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutonomousCar-PT-10a-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((F("(((((u3.p17==0)||(u4.p27==0))||((u5.p34==0)||(u6.p41==0)))||(((u7.p48==0)||(u8.p52==0))||((u9.p62==0)||(u10.p66==0))))||(((u11....375
Formula 1 simplified : G!"(((((u3.p17==0)||(u4.p27==0))||((u5.p34==0)||(u6.p41==0)))||(((u7.p48==0)||(u8.p52==0))||((u9.p62==0)||(u10.p66==0))))||(((u11.p7...365
Computing Next relation with stutter on 1.29803e+06 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
3918 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,221.884,3498896,1,0,7.08939e+06,2307,470,1.08722e+07,252,21798,6462
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA AutonomousCar-PT-10a-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((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 2 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
122 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,223.11,3499288,1,0,7.08939e+06,2307,645,1.08722e+07,286,21798,170184
an accepting run exists (use option '-e' to print it)
Formula 2 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 2583320 ms.

BK_STOP 1716325897353

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r043-smll-171620180400228"
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 ;