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.r109-tall-171624208600453.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 DES-PT-40b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208600453
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 08:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 08:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 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 115K 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 DES-PT-40b-LTLFireability-00
FORMULA_NAME DES-PT-40b-LTLFireability-01
FORMULA_NAME DES-PT-40b-LTLFireability-02
FORMULA_NAME DES-PT-40b-LTLFireability-03
FORMULA_NAME DES-PT-40b-LTLFireability-04
FORMULA_NAME DES-PT-40b-LTLFireability-05
FORMULA_NAME DES-PT-40b-LTLFireability-06
FORMULA_NAME DES-PT-40b-LTLFireability-07
FORMULA_NAME DES-PT-40b-LTLFireability-08
FORMULA_NAME DES-PT-40b-LTLFireability-09
FORMULA_NAME DES-PT-40b-LTLFireability-10
FORMULA_NAME DES-PT-40b-LTLFireability-11
FORMULA_NAME DES-PT-40b-LTLFireability-12
FORMULA_NAME DES-PT-40b-LTLFireability-13
FORMULA_NAME DES-PT-40b-LTLFireability-14
FORMULA_NAME DES-PT-40b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716338449883

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=DES-PT-40b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 00:40:51] [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-22 00:40:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:40:51] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-22 00:40:51] [INFO ] Transformed 439 places.
[2024-05-22 00:40:51] [INFO ] Transformed 390 transitions.
[2024-05-22 00:40:51] [INFO ] Found NUPN structural information;
[2024-05-22 00:40:51] [INFO ] Parsed PT model containing 439 places and 390 transitions and 1303 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DES-PT-40b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 390/390 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 436 transition count 390
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 414 transition count 368
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 414 transition count 368
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 60 place count 401 transition count 355
Iterating global reduction 1 with 13 rules applied. Total rules applied 73 place count 401 transition count 355
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 83 place count 401 transition count 345
Applied a total of 83 rules in 91 ms. Remains 401 /439 variables (removed 38) and now considering 345/390 (removed 45) transitions.
// Phase 1: matrix 345 rows 401 cols
[2024-05-22 00:40:51] [INFO ] Computed 62 invariants in 43 ms
[2024-05-22 00:40:52] [INFO ] Implicit Places using invariants in 578 ms returned []
[2024-05-22 00:40:52] [INFO ] Invariant cache hit.
[2024-05-22 00:40:52] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 1011 ms to find 0 implicit places.
[2024-05-22 00:40:52] [INFO ] Invariant cache hit.
[2024-05-22 00:40:52] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 401/439 places, 345/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1299 ms. Remains : 401/439 places, 345/390 transitions.
Support contains 49 out of 401 places after structural reductions.
[2024-05-22 00:40:53] [INFO ] Flatten gal took : 51 ms
[2024-05-22 00:40:53] [INFO ] Flatten gal took : 24 ms
[2024-05-22 00:40:53] [INFO ] Input system was already deterministic with 345 transitions.
Support contains 48 out of 401 places (down from 49) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 86 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 35) seen :21
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 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 11 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2024-05-22 00:40:54] [INFO ] Invariant cache hit.
[2024-05-22 00:40:54] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-22 00:40:54] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 23 ms returned sat
[2024-05-22 00:40:54] [INFO ] After 399ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:10
[2024-05-22 00:40:55] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 5 ms to minimize.
[2024-05-22 00:40:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 143 ms
[2024-05-22 00:40:55] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:40:55] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:40:55] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:40:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 286 ms
[2024-05-22 00:40:55] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 0 ms to minimize.
[2024-05-22 00:40:55] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:40:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 251 ms
[2024-05-22 00:40:55] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 1 ms to minimize.
[2024-05-22 00:40:55] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:40:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 249 ms
[2024-05-22 00:40:55] [INFO ] After 1440ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:13
[2024-05-22 00:40:55] [INFO ] After 1748ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:13
[2024-05-22 00:40:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2024-05-22 00:40:56] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 22 ms returned sat
[2024-05-22 00:40:57] [INFO ] After 762ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :13
[2024-05-22 00:40:57] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 0 ms to minimize.
[2024-05-22 00:40:57] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2024-05-22 00:40:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 313 ms
[2024-05-22 00:40:57] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:40:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2024-05-22 00:40:57] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 0 ms to minimize.
[2024-05-22 00:40:57] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:40:57] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 0 ms to minimize.
[2024-05-22 00:40:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 309 ms
[2024-05-22 00:40:58] [INFO ] After 2217ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :13
Attempting to minimize the solution found.
Minimization took 576 ms.
[2024-05-22 00:40:59] [INFO ] After 3084ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :13
Fused 14 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 1309 ms.
Support contains 20 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 395 transition count 327
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 29 place count 382 transition count 327
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 382 transition count 315
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 370 transition count 315
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 368 transition count 313
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 368 transition count 313
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 366 transition count 311
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 366 transition count 311
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 366 transition count 308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 365 transition count 308
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 211 place count 292 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 212 place count 292 transition count 234
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 218 place count 289 transition count 249
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 219 place count 289 transition count 248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 220 place count 288 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 221 place count 287 transition count 247
Applied a total of 221 rules in 130 ms. Remains 287 /401 variables (removed 114) and now considering 247/345 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 287/401 places, 247/345 transitions.
Incomplete random walk after 10000 steps, including 356 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 492882 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{2=1, 3=1, 6=1, 11=1}
Probabilistic random walk after 492882 steps, saw 111812 distinct states, run finished after 3002 ms. (steps per millisecond=164 ) properties seen :4
Running SMT prover for 9 properties.
// Phase 1: matrix 247 rows 287 cols
[2024-05-22 00:41:04] [INFO ] Computed 61 invariants in 7 ms
[2024-05-22 00:41:04] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-22 00:41:04] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-22 00:41:04] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 103 ms returned sat
[2024-05-22 00:41:05] [INFO ] After 379ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-22 00:41:05] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-22 00:41:05] [INFO ] After 275ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-22 00:41:05] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:41:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2024-05-22 00:41:05] [INFO ] After 685ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 291 ms.
[2024-05-22 00:41:06] [INFO ] After 1648ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 553 ms.
Support contains 15 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 247/247 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 286 transition count 246
Applied a total of 1 rules in 30 ms. Remains 286 /287 variables (removed 1) and now considering 246/247 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 286/287 places, 246/247 transitions.
Incomplete random walk after 10000 steps, including 398 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 79 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 67 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 77 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 76 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 66 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 67 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 72 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 77 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 707480 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :{}
Probabilistic random walk after 707480 steps, saw 102167 distinct states, run finished after 3001 ms. (steps per millisecond=235 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 246 rows 286 cols
[2024-05-22 00:41:10] [INFO ] Computed 61 invariants in 7 ms
[2024-05-22 00:41:10] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-22 00:41:10] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-22 00:41:10] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 68 ms returned sat
[2024-05-22 00:41:11] [INFO ] After 429ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-22 00:41:11] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-22 00:41:11] [INFO ] After 252ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-22 00:41:11] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:41:11] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2024-05-22 00:41:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 149 ms
[2024-05-22 00:41:11] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-22 00:41:11] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-05-22 00:41:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 194 ms
[2024-05-22 00:41:12] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:41:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2024-05-22 00:41:12] [INFO ] After 999ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 223 ms.
[2024-05-22 00:41:12] [INFO ] After 1934ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 468 ms.
Support contains 15 out of 286 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 286/286 places, 246/246 transitions.
Applied a total of 0 rules in 10 ms. Remains 286 /286 variables (removed 0) and now considering 246/246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 286/286 places, 246/246 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 286/286 places, 246/246 transitions.
Applied a total of 0 rules in 9 ms. Remains 286 /286 variables (removed 0) and now considering 246/246 (removed 0) transitions.
[2024-05-22 00:41:12] [INFO ] Invariant cache hit.
[2024-05-22 00:41:12] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-22 00:41:13] [INFO ] Invariant cache hit.
[2024-05-22 00:41:13] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-22 00:41:13] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
[2024-05-22 00:41:13] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-22 00:41:13] [INFO ] Invariant cache hit.
[2024-05-22 00:41:13] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 776 ms. Remains : 286/286 places, 246/246 transitions.
Graph (complete) has 909 edges and 286 vertex of which 285 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 285 /286 variables (removed 1) and now considering 246/246 (removed 0) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 246 rows 285 cols
[2024-05-22 00:41:13] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 00:41:13] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-22 00:41:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 00:41:13] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 83 ms returned sat
[2024-05-22 00:41:14] [INFO ] After 472ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-22 00:41:14] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:41:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-05-22 00:41:14] [INFO ] After 878ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 243 ms.
[2024-05-22 00:41:15] [INFO ] After 1394ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 217 stabilizing places and 209 stable transitions
Graph (complete) has 904 edges and 401 vertex of which 395 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.15 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(((p0 U p1)||G(p2))))'
Support contains 5 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 398 transition count 342
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 398 transition count 342
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 395 transition count 339
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 395 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 395 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 394 transition count 335
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 394 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 394 transition count 334
Applied a total of 18 rules in 28 ms. Remains 394 /401 variables (removed 7) and now considering 334/345 (removed 11) transitions.
// Phase 1: matrix 334 rows 394 cols
[2024-05-22 00:41:15] [INFO ] Computed 62 invariants in 11 ms
[2024-05-22 00:41:15] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-22 00:41:15] [INFO ] Invariant cache hit.
[2024-05-22 00:41:16] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
[2024-05-22 00:41:16] [INFO ] Invariant cache hit.
[2024-05-22 00:41:16] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 394/401 places, 334/345 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 731 ms. Remains : 394/401 places, 334/345 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 301 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-40b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(EQ s197 1), p0:(AND (EQ s318 1) (EQ s346 1)), p2:(OR (EQ s143 0) (EQ s182 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 893 reset in 289 ms.
Product exploration explored 100000 steps with 885 reset in 242 ms.
Computed a total of 217 stabilizing places and 209 stable transitions
Graph (complete) has 887 edges and 394 vertex of which 388 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.14 ms
Computed a total of 217 stabilizing places and 209 stable transitions
Detected a total of 217/394 stabilizing places and 209/334 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), true, (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 224 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p2)]
Incomplete random walk after 10000 steps, including 84 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1676892 steps, run timeout after 3001 ms. (steps per millisecond=558 ) properties seen :{}
Probabilistic random walk after 1676892 steps, saw 266746 distinct states, run finished after 3001 ms. (steps per millisecond=558 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 00:41:20] [INFO ] Invariant cache hit.
[2024-05-22 00:41:20] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:41:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-22 00:41:20] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 19 ms returned sat
[2024-05-22 00:41:20] [INFO ] After 275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:41:20] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:41:21] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:41:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 225 ms
[2024-05-22 00:41:21] [INFO ] After 517ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-22 00:41:21] [INFO ] After 636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 334/334 transitions.
Graph (complete) has 887 edges and 394 vertex of which 388 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 388 transition count 314
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 33 place count 373 transition count 314
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 33 place count 373 transition count 301
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 59 place count 360 transition count 301
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 209 place count 285 transition count 226
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
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 215 place count 282 transition count 234
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 282 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 281 transition count 233
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 281 transition count 233
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 280 transition count 232
Applied a total of 219 rules in 55 ms. Remains 280 /394 variables (removed 114) and now considering 232/334 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 280/394 places, 232/334 transitions.
Incomplete random walk after 10000 steps, including 432 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1690816 steps, run timeout after 3001 ms. (steps per millisecond=563 ) properties seen :{}
Probabilistic random walk after 1690816 steps, saw 231448 distinct states, run finished after 3002 ms. (steps per millisecond=563 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 280 cols
[2024-05-22 00:41:24] [INFO ] Computed 61 invariants in 10 ms
[2024-05-22 00:41:24] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:41:24] [INFO ] [Nat]Absence check using 37 positive place invariants in 4 ms returned sat
[2024-05-22 00:41:24] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 85 ms returned sat
[2024-05-22 00:41:24] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:41:24] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 00:41:24] [INFO ] After 22ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 00:41:24] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-22 00:41:24] [INFO ] After 398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 232/232 transitions.
Applied a total of 0 rules in 8 ms. Remains 280 /280 variables (removed 0) and now considering 232/232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 280/280 places, 232/232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 232/232 transitions.
Applied a total of 0 rules in 8 ms. Remains 280 /280 variables (removed 0) and now considering 232/232 (removed 0) transitions.
[2024-05-22 00:41:24] [INFO ] Invariant cache hit.
[2024-05-22 00:41:24] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-22 00:41:24] [INFO ] Invariant cache hit.
[2024-05-22 00:41:25] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 00:41:25] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2024-05-22 00:41:25] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-22 00:41:25] [INFO ] Invariant cache hit.
[2024-05-22 00:41:25] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 646 ms. Remains : 280/280 places, 232/232 transitions.
Graph (complete) has 960 edges and 280 vertex of which 279 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 279 transition count 232
Applied a total of 2 rules in 14 ms. Remains 279 /280 variables (removed 1) and now considering 232/232 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 279 cols
[2024-05-22 00:41:25] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 00:41:25] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:41:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 00:41:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 99 ms returned sat
[2024-05-22 00:41:25] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:41:25] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-22 00:41:25] [INFO ] After 360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), true, (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 202 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 43 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p2)]
Support contains 2 out of 394 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 : 394/394 places, 334/334 transitions.
Graph (complete) has 887 edges and 394 vertex of which 388 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 387 transition count 317
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 374 transition count 317
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 27 place count 374 transition count 305
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 51 place count 362 transition count 305
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 197 place count 289 transition count 232
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 201 place count 287 transition count 234
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 285 transition count 232
Applied a total of 203 rules in 45 ms. Remains 285 /394 variables (removed 109) and now considering 232/334 (removed 102) transitions.
// Phase 1: matrix 232 rows 285 cols
[2024-05-22 00:41:26] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 00:41:26] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-22 00:41:26] [INFO ] Invariant cache hit.
[2024-05-22 00:41:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 00:41:26] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2024-05-22 00:41:26] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-22 00:41:26] [INFO ] Invariant cache hit.
[2024-05-22 00:41:26] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 285/394 places, 232/334 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 709 ms. Remains : 285/394 places, 232/334 transitions.
Computed a total of 179 stabilizing places and 173 stable transitions
Computed a total of 179 stabilizing places and 173 stable transitions
Knowledge obtained : [p2, (X p2), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 71 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 42 ms :[true, (NOT p2)]
Incomplete random walk after 10000 steps, including 407 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1599962 steps, run timeout after 3001 ms. (steps per millisecond=533 ) properties seen :{}
Probabilistic random walk after 1599962 steps, saw 217316 distinct states, run finished after 3004 ms. (steps per millisecond=532 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 00:41:30] [INFO ] Invariant cache hit.
[2024-05-22 00:41:30] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:41:30] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-22 00:41:30] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 33 ms returned sat
[2024-05-22 00:41:30] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:41:30] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 00:41:30] [INFO ] After 45ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 00:41:30] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-22 00:41:30] [INFO ] After 414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 232/232 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 285 transition count 231
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 1 with 6 rules applied. Total rules applied 7 place count 282 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 282 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 281 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 281 transition count 227
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 279 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 278 transition count 225
Applied a total of 13 rules in 31 ms. Remains 278 /285 variables (removed 7) and now considering 225/232 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 278/285 places, 225/232 transitions.
Incomplete random walk after 10000 steps, including 463 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1642922 steps, run timeout after 3001 ms. (steps per millisecond=547 ) properties seen :{}
Probabilistic random walk after 1642922 steps, saw 224877 distinct states, run finished after 3002 ms. (steps per millisecond=547 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 225 rows 278 cols
[2024-05-22 00:41:33] [INFO ] Computed 59 invariants in 7 ms
[2024-05-22 00:41:33] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:41:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:41:33] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 84 ms returned sat
[2024-05-22 00:41:33] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:41:33] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:41:33] [INFO ] After 18ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 00:41:33] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-22 00:41:33] [INFO ] After 348ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 6 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 278/278 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2024-05-22 00:41:34] [INFO ] Invariant cache hit.
[2024-05-22 00:41:34] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-22 00:41:34] [INFO ] Invariant cache hit.
[2024-05-22 00:41:34] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:41:34] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
[2024-05-22 00:41:34] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-22 00:41:34] [INFO ] Invariant cache hit.
[2024-05-22 00:41:34] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 639 ms. Remains : 278/278 places, 225/225 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 278 transition count 225
Applied a total of 1 rules in 10 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 225 rows 278 cols
[2024-05-22 00:41:34] [INFO ] Computed 59 invariants in 4 ms
[2024-05-22 00:41:34] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:41:34] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:41:34] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 83 ms returned sat
[2024-05-22 00:41:34] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:41:34] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-22 00:41:34] [INFO ] After 296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p2, (X p2), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 118 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 39 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p2)]
Product exploration explored 100000 steps with 4283 reset in 212 ms.
Product exploration explored 100000 steps with 4265 reset in 254 ms.
Built C files in :
/tmp/ltsmin8332598908669617447
[2024-05-22 00:41:35] [INFO ] Computing symmetric may disable matrix : 232 transitions.
[2024-05-22 00:41:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:41:35] [INFO ] Computing symmetric may enable matrix : 232 transitions.
[2024-05-22 00:41:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:41:35] [INFO ] Computing Do-Not-Accords matrix : 232 transitions.
[2024-05-22 00:41:35] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:41:35] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8332598908669617447
Running compilation step : cd /tmp/ltsmin8332598908669617447;'/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'
Compilation finished in 585 ms.
Running link step : cd /tmp/ltsmin8332598908669617447;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin8332598908669617447;'/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' '--hoa' '/tmp/stateBased12232866110212102120.hoa' '--buchi-type=spotba'
LTSmin run took 8844 ms.
FORMULA DES-PT-40b-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-40b-LTLFireability-01 finished in 29888 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||(X((p0&&G(p2)))&&p1))))'
Support contains 1 out of 401 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 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 394 transition count 329
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 382 transition count 329
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 25 place count 382 transition count 318
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 47 place count 371 transition count 318
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 367 transition count 314
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 367 transition count 314
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 55 place count 367 transition count 313
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 57 place count 366 transition count 313
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 363 transition count 310
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 363 transition count 310
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 68 place count 363 transition count 305
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 71 place count 361 transition count 304
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 221 place count 286 transition count 229
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 4 with 4 rules applied. Total rules applied 225 place count 284 transition count 231
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 226 place count 283 transition count 230
Applied a total of 226 rules in 56 ms. Remains 283 /401 variables (removed 118) and now considering 230/345 (removed 115) transitions.
// Phase 1: matrix 230 rows 283 cols
[2024-05-22 00:41:45] [INFO ] Computed 59 invariants in 5 ms
[2024-05-22 00:41:45] [INFO ] Implicit Places using invariants in 141 ms returned [174]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 144 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 282/401 places, 230/345 transitions.
Applied a total of 0 rules in 6 ms. Remains 282 /282 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 206 ms. Remains : 282/401 places, 230/345 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s160 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 414 ms.
Product exploration explored 100000 steps with 50000 reset in 385 ms.
Computed a total of 178 stabilizing places and 173 stable transitions
Computed a total of 178 stabilizing places and 173 stable transitions
Detected a total of 178/282 stabilizing places and 173/230 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-40b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-40b-LTLFireability-03 finished in 1082 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&&F(p1)))))'
Support contains 3 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 397 transition count 341
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 394 transition count 338
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 393 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 393 transition count 333
Applied a total of 20 rules in 29 ms. Remains 393 /401 variables (removed 8) and now considering 333/345 (removed 12) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-22 00:41:46] [INFO ] Computed 62 invariants in 12 ms
[2024-05-22 00:41:46] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-22 00:41:46] [INFO ] Invariant cache hit.
[2024-05-22 00:41:47] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
[2024-05-22 00:41:47] [INFO ] Invariant cache hit.
[2024-05-22 00:41:47] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/401 places, 333/345 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 796 ms. Remains : 393/401 places, 333/345 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s41 1) (EQ s249 1)), p0:(EQ s294 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 84 steps with 0 reset in 0 ms.
FORMULA DES-PT-40b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-04 finished in 945 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(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0)))) U (G((X(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0)))))||(!p1&&(X(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0))))))))'
Support contains 4 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 397 transition count 341
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 394 transition count 338
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 393 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 393 transition count 333
Applied a total of 20 rules in 40 ms. Remains 393 /401 variables (removed 8) and now considering 333/345 (removed 12) transitions.
[2024-05-22 00:41:47] [INFO ] Invariant cache hit.
[2024-05-22 00:41:47] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-22 00:41:47] [INFO ] Invariant cache hit.
[2024-05-22 00:41:47] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
[2024-05-22 00:41:47] [INFO ] Invariant cache hit.
[2024-05-22 00:41:48] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/401 places, 333/345 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 798 ms. Remains : 393/401 places, 333/345 transitions.
Stuttering acceptance computed with spot in 251 ms :[true, p1, p0, p0, (AND p0 p1), p0, p0]
Running random walk in product with property : DES-PT-40b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=p1, acceptance={} source=2 dest: 6}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 4}], [{ cond=p0, acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(AND (EQ s157 1) (EQ s182 1)), p0:(AND (EQ s84 1) (EQ s385 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 872 reset in 262 ms.
Product exploration explored 100000 steps with 878 reset in 198 ms.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Detected a total of 216/393 stabilizing places and 208/333 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 120 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 89 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 00:41:49] [INFO ] Invariant cache hit.
[2024-05-22 00:41:49] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-22 00:41:49] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 24 ms returned sat
[2024-05-22 00:41:49] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:41:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-22 00:41:49] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 26 ms returned sat
[2024-05-22 00:41:49] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:41:49] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:41:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2024-05-22 00:41:49] [INFO ] After 330ms 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-22 00:41:49] [INFO ] After 468ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 387 transition count 312
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 371 transition count 312
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 371 transition count 300
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 359 transition count 300
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 211 place count 283 transition count 224
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 281 transition count 226
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 281 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 280 transition count 225
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 280 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 279 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 278 transition count 224
Applied a total of 220 rules in 36 ms. Remains 278 /393 variables (removed 115) and now considering 224/333 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 278/393 places, 224/333 transitions.
Incomplete random walk after 10000 steps, including 440 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1643550 steps, run timeout after 3001 ms. (steps per millisecond=547 ) properties seen :{}
Probabilistic random walk after 1643550 steps, saw 224899 distinct states, run finished after 3003 ms. (steps per millisecond=547 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 278 cols
[2024-05-22 00:41:52] [INFO ] Computed 60 invariants in 7 ms
[2024-05-22 00:41:52] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:41:52] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-22 00:41:52] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:41:53] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:41:53] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 79 ms returned sat
[2024-05-22 00:41:53] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:41:53] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:41:53] [INFO ] After 29ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 00:41:53] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-22 00:41:53] [INFO ] After 357ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 224/224 transitions.
Applied a total of 0 rules in 7 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 278/278 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 224/224 transitions.
Applied a total of 0 rules in 5 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-22 00:41:53] [INFO ] Invariant cache hit.
[2024-05-22 00:41:53] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-22 00:41:53] [INFO ] Invariant cache hit.
[2024-05-22 00:41:53] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:41:53] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2024-05-22 00:41:53] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:41:53] [INFO ] Invariant cache hit.
[2024-05-22 00:41:53] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 614 ms. Remains : 278/278 places, 224/224 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 278 transition count 224
Applied a total of 1 rules in 8 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 278 cols
[2024-05-22 00:41:53] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 00:41:54] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:41:54] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-22 00:41:54] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:41:54] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 00:41:54] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 80 ms returned sat
[2024-05-22 00:41:54] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:41:54] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-22 00:41:54] [INFO ] After 307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 200 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 174 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Support contains 4 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Applied a total of 0 rules in 12 ms. Remains 393 /393 variables (removed 0) and now considering 333/333 (removed 0) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-22 00:41:54] [INFO ] Computed 62 invariants in 12 ms
[2024-05-22 00:41:55] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-22 00:41:55] [INFO ] Invariant cache hit.
[2024-05-22 00:41:55] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
[2024-05-22 00:41:55] [INFO ] Invariant cache hit.
[2024-05-22 00:41:55] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 779 ms. Remains : 393/393 places, 333/333 transitions.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Detected a total of 216/393 stabilizing places and 208/333 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 86 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 00:41:56] [INFO ] Invariant cache hit.
[2024-05-22 00:41:56] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-22 00:41:56] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 23 ms returned sat
[2024-05-22 00:41:56] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:41:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-22 00:41:56] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 26 ms returned sat
[2024-05-22 00:41:56] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:41:56] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2024-05-22 00:41:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2024-05-22 00:41:56] [INFO ] After 331ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-22 00:41:56] [INFO ] After 458ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 387 transition count 312
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 371 transition count 312
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 371 transition count 300
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 359 transition count 300
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 211 place count 283 transition count 224
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 281 transition count 226
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 281 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 280 transition count 225
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 280 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 279 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 278 transition count 224
Applied a total of 220 rules in 47 ms. Remains 278 /393 variables (removed 115) and now considering 224/333 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 278/393 places, 224/333 transitions.
Incomplete random walk after 10000 steps, including 437 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 81 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1658897 steps, run timeout after 3001 ms. (steps per millisecond=552 ) properties seen :{}
Probabilistic random walk after 1658897 steps, saw 226998 distinct states, run finished after 3003 ms. (steps per millisecond=552 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 278 cols
[2024-05-22 00:41:59] [INFO ] Computed 60 invariants in 7 ms
[2024-05-22 00:41:59] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:41:59] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 00:41:59] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:41:59] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:41:59] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 80 ms returned sat
[2024-05-22 00:42:00] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:42:00] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:42:00] [INFO ] After 18ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 00:42:00] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-22 00:42:00] [INFO ] After 318ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 224/224 transitions.
Applied a total of 0 rules in 5 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 278/278 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 224/224 transitions.
Applied a total of 0 rules in 5 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-22 00:42:00] [INFO ] Invariant cache hit.
[2024-05-22 00:42:00] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-22 00:42:00] [INFO ] Invariant cache hit.
[2024-05-22 00:42:00] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:42:00] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2024-05-22 00:42:00] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:42:00] [INFO ] Invariant cache hit.
[2024-05-22 00:42:00] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 621 ms. Remains : 278/278 places, 224/224 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 278 transition count 224
Applied a total of 1 rules in 9 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 278 cols
[2024-05-22 00:42:00] [INFO ] Computed 60 invariants in 5 ms
[2024-05-22 00:42:00] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:42:00] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 00:42:00] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:42:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:42:00] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 78 ms returned sat
[2024-05-22 00:42:01] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:42:01] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-22 00:42:01] [INFO ] After 281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 193 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 204 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 865 reset in 175 ms.
Product exploration explored 100000 steps with 870 reset in 190 ms.
Built C files in :
/tmp/ltsmin6669491540334761387
[2024-05-22 00:42:02] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6669491540334761387
Running compilation step : cd /tmp/ltsmin6669491540334761387;'/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'
Compilation finished in 542 ms.
Running link step : cd /tmp/ltsmin6669491540334761387;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin6669491540334761387;'/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' '--hoa' '/tmp/stateBased13107705067455181151.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Applied a total of 0 rules in 15 ms. Remains 393 /393 variables (removed 0) and now considering 333/333 (removed 0) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-22 00:42:17] [INFO ] Computed 62 invariants in 13 ms
[2024-05-22 00:42:17] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-22 00:42:17] [INFO ] Invariant cache hit.
[2024-05-22 00:42:18] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2024-05-22 00:42:18] [INFO ] Invariant cache hit.
[2024-05-22 00:42:18] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 804 ms. Remains : 393/393 places, 333/333 transitions.
Built C files in :
/tmp/ltsmin3179899706227938155
[2024-05-22 00:42:18] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3179899706227938155
Running compilation step : cd /tmp/ltsmin3179899706227938155;'/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'
Compilation finished in 505 ms.
Running link step : cd /tmp/ltsmin3179899706227938155;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3179899706227938155;'/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' '--hoa' '/tmp/stateBased2552354475187718095.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:42:33] [INFO ] Flatten gal took : 21 ms
[2024-05-22 00:42:33] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:42:33] [INFO ] Time to serialize gal into /tmp/LTL242309981051144595.gal : 5 ms
[2024-05-22 00:42:33] [INFO ] Time to serialize properties into /tmp/LTL13303499108221462193.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/LTL242309981051144595.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11211741094586502749.hoa' '-atoms' '/tmp/LTL13303499108221462193.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/LTL13303499108221462193.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11211741094586502749.hoa
Detected timeout of ITS tools.
[2024-05-22 00:42:48] [INFO ] Flatten gal took : 18 ms
[2024-05-22 00:42:48] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:42:48] [INFO ] Time to serialize gal into /tmp/LTL8666834861931826821.gal : 3 ms
[2024-05-22 00:42:48] [INFO ] Time to serialize properties into /tmp/LTL5090254854903275047.ltl : 3 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/LTL8666834861931826821.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5090254854903275047.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 : !((((X(!("((p85==1)&&(p431==1))")))U((X(G(!("((p85==1)&&(p431==1))"))))||((X(!("((p85==1)&&(p431==1))")))&&(G((!("((p85==1)&&(p431==1)...589
Formula 0 simplified : "((p158==1)&&(p189==1))" U (X"((p85==1)&&(p431==1))" R (XF"((p85==1)&&(p431==1))" & (X"((p85==1)&&(p431==1))" | F("((p85==1)&&(p431=...192
Detected timeout of ITS tools.
[2024-05-22 00:43:03] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:43:03] [INFO ] Applying decomposition
[2024-05-22 00:43:03] [INFO ] Flatten gal took : 14 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/graph6301249528960957574.txt' '-o' '/tmp/graph6301249528960957574.bin' '-w' '/tmp/graph6301249528960957574.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6301249528960957574.bin' '-l' '-1' '-v' '-w' '/tmp/graph6301249528960957574.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:43:03] [INFO ] Decomposing Gal with order
[2024-05-22 00:43:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:43:03] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-22 00:43:03] [INFO ] Flatten gal took : 58 ms
[2024-05-22 00:43:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 10 ms.
[2024-05-22 00:43:04] [INFO ] Time to serialize gal into /tmp/LTL2761109392691592822.gal : 5 ms
[2024-05-22 00:43:04] [INFO ] Time to serialize properties into /tmp/LTL261005355880815727.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/LTL2761109392691592822.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL261005355880815727.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...253
Read 1 LTL properties
Checking formula 0 : !((((X(!("((i10.u76.p85==1)&&(i10.u76.p431==1))")))U((X(G(!("((i10.u76.p85==1)&&(i10.u76.p431==1))"))))||((X(!("((i10.u76.p85==1)&&(i1...829
Formula 0 simplified : "((i1.u8.p158==1)&&(i1.u8.p189==1))" U (X"((i10.u76.p85==1)&&(i10.u76.p431==1))" R (XF"((i10.u76.p85==1)&&(i10.u76.p431==1))" & (X"(...280
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15424965054671225534
[2024-05-22 00:43:19] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15424965054671225534
Running compilation step : cd /tmp/ltsmin15424965054671225534;'/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'
Compilation finished in 520 ms.
Running link step : cd /tmp/ltsmin15424965054671225534;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin15424965054671225534;'/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)) U (X([](!(LTLAPp0==true)))||(X(!(LTLAPp0==true))&&[]((!(LTLAPp0==true)||X(!(LTLAPp1==true))))))) U ([]((X(!(LTLAPp0==true)) U (X([](!(LTLAPp0==true)))||(X(!(LTLAPp0==true))&&[]((!(LTLAPp0==true)||X(!(LTLAPp1==true))))))))||(!(LTLAPp1==true)&&(X(!(LTLAPp0==true)) U (X([](!(LTLAPp0==true)))||(X(!(LTLAPp0==true))&&[]((!(LTLAPp0==true)||X(!(LTLAPp1==true))))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-40b-LTLFireability-05 finished in 106835 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(G((F(p1)||p0)))&&(F(p1)||X(F(p2))))))'
Support contains 9 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 394 transition count 328
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 381 transition count 328
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 27 place count 381 transition count 317
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 49 place count 370 transition count 317
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 366 transition count 313
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 366 transition count 313
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 57 place count 366 transition count 312
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 59 place count 365 transition count 312
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 362 transition count 309
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 362 transition count 309
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 70 place count 362 transition count 304
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 73 place count 360 transition count 303
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 225 place count 284 transition count 227
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 229 place count 282 transition count 229
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 280 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 232 place count 279 transition count 227
Applied a total of 232 rules in 45 ms. Remains 279 /401 variables (removed 122) and now considering 227/345 (removed 118) transitions.
// Phase 1: matrix 227 rows 279 cols
[2024-05-22 00:43:34] [INFO ] Computed 58 invariants in 7 ms
[2024-05-22 00:43:34] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-22 00:43:34] [INFO ] Invariant cache hit.
[2024-05-22 00:43:34] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2024-05-22 00:43:34] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:43:34] [INFO ] Invariant cache hit.
[2024-05-22 00:43:34] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 279/401 places, 227/345 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 723 ms. Remains : 279/401 places, 227/345 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-40b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s202 1) (EQ s204 1) (EQ s206 1) (EQ s208 1) (EQ s210 1) (EQ s212 1) (EQ s214 1) (EQ s216 1)), p0:(OR (EQ s202 0) (EQ s204 0) (EQ s206 0) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 33334 reset in 315 ms.
Product exploration explored 100000 steps with 33147 reset in 325 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/279 stabilizing places and 170/227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 129 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 528 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 00:43:36] [INFO ] Invariant cache hit.
[2024-05-22 00:43:36] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:43:36] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 00:43:36] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 50 ms returned sat
[2024-05-22 00:43:36] [INFO ] After 114ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 239 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 9 out of 279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 6 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-22 00:43:36] [INFO ] Invariant cache hit.
[2024-05-22 00:43:36] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-22 00:43:36] [INFO ] Invariant cache hit.
[2024-05-22 00:43:37] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2024-05-22 00:43:37] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:43:37] [INFO ] Invariant cache hit.
[2024-05-22 00:43:37] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 616 ms. Remains : 279/279 places, 227/227 transitions.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/279 stabilizing places and 170/227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 206 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 67 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 34 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=34 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 142 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 77 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 6132 reset in 220 ms.
Product exploration explored 100000 steps with 6124 reset in 241 ms.
Built C files in :
/tmp/ltsmin12133338282358246019
[2024-05-22 00:43:38] [INFO ] Computing symmetric may disable matrix : 227 transitions.
[2024-05-22 00:43:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:43:38] [INFO ] Computing symmetric may enable matrix : 227 transitions.
[2024-05-22 00:43:38] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:43:38] [INFO ] Computing Do-Not-Accords matrix : 227 transitions.
[2024-05-22 00:43:38] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:43:38] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12133338282358246019
Running compilation step : cd /tmp/ltsmin12133338282358246019;'/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'
Compilation finished in 485 ms.
Running link step : cd /tmp/ltsmin12133338282358246019;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin12133338282358246019;'/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' '--hoa' '/tmp/stateBased3521453584557842602.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 10 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-22 00:43:53] [INFO ] Invariant cache hit.
[2024-05-22 00:43:53] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-22 00:43:53] [INFO ] Invariant cache hit.
[2024-05-22 00:43:53] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2024-05-22 00:43:53] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:43:53] [INFO ] Invariant cache hit.
[2024-05-22 00:43:54] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 612 ms. Remains : 279/279 places, 227/227 transitions.
Built C files in :
/tmp/ltsmin11004434111447331909
[2024-05-22 00:43:54] [INFO ] Computing symmetric may disable matrix : 227 transitions.
[2024-05-22 00:43:54] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:43:54] [INFO ] Computing symmetric may enable matrix : 227 transitions.
[2024-05-22 00:43:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:43:54] [INFO ] Computing Do-Not-Accords matrix : 227 transitions.
[2024-05-22 00:43:54] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:43:54] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11004434111447331909
Running compilation step : cd /tmp/ltsmin11004434111447331909;'/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'
Compilation finished in 455 ms.
Running link step : cd /tmp/ltsmin11004434111447331909;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11004434111447331909;'/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' '--hoa' '/tmp/stateBased15593506776036586787.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:44:09] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:44:09] [INFO ] Flatten gal took : 30 ms
[2024-05-22 00:44:09] [INFO ] Time to serialize gal into /tmp/LTL14961893189824437380.gal : 2 ms
[2024-05-22 00:44:09] [INFO ] Time to serialize properties into /tmp/LTL3808949988310070475.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/LTL14961893189824437380.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11950868228036201789.hoa' '-atoms' '/tmp/LTL3808949988310070475.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/LTL3808949988310070475.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11950868228036201789.hoa
Detected timeout of ITS tools.
[2024-05-22 00:44:24] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:44:24] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:44:24] [INFO ] Time to serialize gal into /tmp/LTL17569691945397257010.gal : 3 ms
[2024-05-22 00:44:24] [INFO ] Time to serialize properties into /tmp/LTL1520906168573594517.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/LTL17569691945397257010.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1520906168573594517.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 : !((G((F(G(("((((p318==0)||(p320==0))||((p322==0)||(p324==0)))||(((p326==0)||(p328==0))||((p330==0)||(p332==0))))")||(F("((((p318==1)&&...382
Formula 0 simplified : F((G!"((((p318==1)&&(p320==1))&&((p322==1)&&(p324==1)))&&(((p326==1)&&(p328==1))&&((p330==1)&&(p332==1))))" & XG!"(p284==0)") | G(F!...367
Detected timeout of ITS tools.
[2024-05-22 00:44:39] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:44:39] [INFO ] Applying decomposition
[2024-05-22 00:44:39] [INFO ] Flatten gal took : 10 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/graph16382207444057316788.txt' '-o' '/tmp/graph16382207444057316788.bin' '-w' '/tmp/graph16382207444057316788.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16382207444057316788.bin' '-l' '-1' '-v' '-w' '/tmp/graph16382207444057316788.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:44:39] [INFO ] Decomposing Gal with order
[2024-05-22 00:44:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:44:39] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-22 00:44:39] [INFO ] Flatten gal took : 34 ms
[2024-05-22 00:44:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 3 ms.
[2024-05-22 00:44:39] [INFO ] Time to serialize gal into /tmp/LTL6237181057352278909.gal : 17 ms
[2024-05-22 00:44:39] [INFO ] Time to serialize properties into /tmp/LTL14699359843474494265.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/LTL6237181057352278909.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14699359843474494265.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 : !((G((F(G(("((((i9.i3.u13.p318==0)||(i6.u14.p320==0))||((i7.u15.p322==0)||(i5.u16.p324==0)))||(((i8.u17.p326==0)||(i9.i0.u18.p328==0))...589
Formula 0 simplified : F((G!"((((i9.i3.u13.p318==1)&&(i6.u14.p320==1))&&((i7.u15.p322==1)&&(i5.u16.p324==1)))&&(((i8.u17.p326==1)&&(i9.i0.u18.p328==1))&&((...574
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14301548036266112202
[2024-05-22 00:44:54] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14301548036266112202
Running compilation step : cd /tmp/ltsmin14301548036266112202;'/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'
Compilation finished in 389 ms.
Running link step : cd /tmp/ltsmin14301548036266112202;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin14301548036266112202;'/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' '[]((<>([]((<>((LTLAPp1==true))||(LTLAPp0==true))))&&(<>((LTLAPp1==true))||X(<>((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-40b-LTLFireability-06 finished in 95689 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(p0)) U (p1||(p1 U p2))))'
Support contains 6 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 394 transition count 329
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 382 transition count 329
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 25 place count 382 transition count 318
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 47 place count 371 transition count 318
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 367 transition count 314
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 367 transition count 314
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 55 place count 367 transition count 313
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 57 place count 366 transition count 313
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 363 transition count 310
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 363 transition count 310
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 68 place count 363 transition count 305
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 71 place count 361 transition count 304
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 219 place count 287 transition count 230
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 4 with 4 rules applied. Total rules applied 223 place count 285 transition count 232
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 225 place count 283 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 226 place count 282 transition count 230
Applied a total of 226 rules in 62 ms. Remains 282 /401 variables (removed 119) and now considering 230/345 (removed 115) transitions.
// Phase 1: matrix 230 rows 282 cols
[2024-05-22 00:45:09] [INFO ] Computed 58 invariants in 8 ms
[2024-05-22 00:45:10] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-22 00:45:10] [INFO ] Invariant cache hit.
[2024-05-22 00:45:10] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:45:10] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2024-05-22 00:45:10] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:45:10] [INFO ] Invariant cache hit.
[2024-05-22 00:45:10] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 282/401 places, 230/345 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 807 ms. Remains : 282/401 places, 230/345 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s110 1) (EQ s192 1)), p2:(AND (EQ s136 1) (EQ s164 1)), p0:(OR (AND (EQ s26 1) (EQ s195 1)) (AND (EQ s136 1) (EQ s164 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA DES-PT-40b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-07 finished in 925 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 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(F(p2)&&F(p3)&&(!p0 U (p1||G(!p0)))))))'
Support contains 6 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 394 transition count 331
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 384 transition count 331
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 21 place count 384 transition count 319
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 45 place count 372 transition count 319
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 370 transition count 317
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 370 transition count 317
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 368 transition count 315
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 368 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 368 transition count 312
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 367 transition count 312
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 211 place count 290 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 212 place count 290 transition count 234
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 218 place count 287 transition count 249
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 220 place count 285 transition count 247
Applied a total of 220 rules in 54 ms. Remains 285 /401 variables (removed 116) and now considering 247/345 (removed 98) transitions.
// Phase 1: matrix 247 rows 285 cols
[2024-05-22 00:45:10] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 00:45:11] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-22 00:45:11] [INFO ] Invariant cache hit.
[2024-05-22 00:45:11] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-22 00:45:11] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
[2024-05-22 00:45:11] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:45:11] [INFO ] Invariant cache hit.
[2024-05-22 00:45:11] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 285/401 places, 247/345 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 812 ms. Remains : 285/401 places, 247/345 transitions.
Stuttering acceptance computed with spot in 320 ms :[(AND p0 (NOT p1)), true, (AND (NOT p2) (NOT p1) p0), (AND (NOT p3) (NOT p1) p0), (AND (NOT p1) p0), (NOT p2), (NOT p3)]
Running random walk in product with property : DES-PT-40b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 2}, { cond=(OR (AND p1 (NOT p3)) (AND (NOT p0) (NOT p3))), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND p1 (NOT p3)) (AND (NOT p0) (NOT p3))), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s153 1) (EQ s164 1) (EQ s166 1))) (NOT (AND (EQ s3 1) (EQ s197 1)))), p0:(AND (EQ s3 1) (EQ s197 1)), p2:(EQ s238 1), p3:(NEQ s166 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 5188 reset in 268 ms.
Product exploration explored 100000 steps with 5179 reset in 291 ms.
Computed a total of 178 stabilizing places and 183 stable transitions
Computed a total of 178 stabilizing places and 183 stable transitions
Detected a total of 178/285 stabilizing places and 183/247 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2) p3), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p3)) (AND (NOT p0) (NOT p3))))), true, (X (X p3)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND (NOT p0) (NOT p3)))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 137 ms. Reduced automaton from 7 states, 13 edges and 4 AP (stutter insensitive) to 7 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 484 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10000 steps, including 100 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-22 00:45:13] [INFO ] Invariant cache hit.
[2024-05-22 00:45:13] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-22 00:45:13] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 00:45:13] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-22 00:45:13] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2024-05-22 00:45:13] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 22 ms returned sat
[2024-05-22 00:45:13] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-05-22 00:45:13] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-22 00:45:13] [INFO ] After 39ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2024-05-22 00:45:13] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-22 00:45:13] [INFO ] After 410ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 51 ms.
Support contains 3 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 247/247 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 285 transition count 246
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 1 with 4 rules applied. Total rules applied 5 place count 283 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 282 transition count 243
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 282 transition count 243
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 282 transition count 235
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 282 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 281 transition count 234
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 281 transition count 234
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 280 transition count 233
Applied a total of 19 rules in 25 ms. Remains 280 /285 variables (removed 5) and now considering 233/247 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 280/285 places, 233/247 transitions.
Incomplete random walk after 10000 steps, including 537 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 564299 steps, run timeout after 3011 ms. (steps per millisecond=187 ) properties seen :{}
Probabilistic random walk after 564299 steps, saw 84161 distinct states, run finished after 3012 ms. (steps per millisecond=187 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 233 rows 280 cols
[2024-05-22 00:45:17] [INFO ] Computed 60 invariants in 2 ms
[2024-05-22 00:45:17] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 00:45:17] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2024-05-22 00:45:17] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 00:45:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 00:45:17] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 97 ms returned sat
[2024-05-22 00:45:17] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 00:45:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 00:45:17] [INFO ] After 28ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 00:45:17] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-22 00:45:17] [INFO ] After 432ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 63 ms.
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 233/233 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 280/280 places, 233/233 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 233/233 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 233/233 (removed 0) transitions.
[2024-05-22 00:45:17] [INFO ] Invariant cache hit.
[2024-05-22 00:45:17] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-22 00:45:17] [INFO ] Invariant cache hit.
[2024-05-22 00:45:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 00:45:18] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
[2024-05-22 00:45:18] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:45:18] [INFO ] Invariant cache hit.
[2024-05-22 00:45:18] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 621 ms. Remains : 280/280 places, 233/233 transitions.
Graph (complete) has 912 edges and 280 vertex of which 279 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 279 transition count 233
Applied a total of 2 rules in 18 ms. Remains 279 /280 variables (removed 1) and now considering 233/233 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 233 rows 279 cols
[2024-05-22 00:45:18] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 00:45:18] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:45:18] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 00:45:18] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 00:45:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:45:18] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 111 ms returned sat
[2024-05-22 00:45:18] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 00:45:18] [INFO ] After 207ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-22 00:45:18] [INFO ] After 439ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2) p3), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p3)) (AND (NOT p0) (NOT p3))))), true, (X (X p3)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND (NOT p0) (NOT p3)))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 p2 p0))), (G (NOT (AND (NOT p1) p2 (NOT p0))))]
False Knowledge obtained : [(F (AND p1 p2 (NOT p0))), (F p2), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 19 factoid took 280 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter insensitive) to 7 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (NOT p2)]
Support contains 6 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 247/247 transitions.
Applied a total of 0 rules in 9 ms. Remains 285 /285 variables (removed 0) and now considering 247/247 (removed 0) transitions.
// Phase 1: matrix 247 rows 285 cols
[2024-05-22 00:45:19] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 00:45:19] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-22 00:45:19] [INFO ] Invariant cache hit.
[2024-05-22 00:45:20] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-22 00:45:20] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2024-05-22 00:45:20] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:45:20] [INFO ] Invariant cache hit.
[2024-05-22 00:45:20] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 747 ms. Remains : 285/285 places, 247/247 transitions.
Computed a total of 178 stabilizing places and 183 stable transitions
Computed a total of 178 stabilizing places and 183 stable transitions
Detected a total of 178/285 stabilizing places and 183/247 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p1) p2))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 212 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter insensitive) to 7 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (NOT p2)]
Incomplete random walk after 10000 steps, including 462 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-22 00:45:21] [INFO ] Invariant cache hit.
[2024-05-22 00:45:21] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2024-05-22 00:45:21] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-22 00:45:21] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2024-05-22 00:45:21] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-22 00:45:21] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 56 ms returned sat
[2024-05-22 00:45:21] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-05-22 00:45:21] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-22 00:45:21] [INFO ] After 42ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2024-05-22 00:45:21] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-22 00:45:21] [INFO ] After 427ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 43 ms.
Support contains 3 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 247/247 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 285 transition count 246
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 1 with 4 rules applied. Total rules applied 5 place count 283 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 282 transition count 243
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 282 transition count 243
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 282 transition count 235
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 282 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 281 transition count 234
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 281 transition count 234
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 280 transition count 233
Applied a total of 19 rules in 27 ms. Remains 280 /285 variables (removed 5) and now considering 233/247 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 280/285 places, 233/247 transitions.
Incomplete random walk after 10000 steps, including 516 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 608094 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 608094 steps, saw 91216 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 233 rows 280 cols
[2024-05-22 00:45:24] [INFO ] Computed 60 invariants in 2 ms
[2024-05-22 00:45:24] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 00:45:24] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 00:45:24] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 00:45:24] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:45:24] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 90 ms returned sat
[2024-05-22 00:45:25] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 00:45:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 00:45:25] [INFO ] After 49ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 00:45:25] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-22 00:45:25] [INFO ] After 460ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 58 ms.
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 233/233 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 280/280 places, 233/233 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 233/233 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 233/233 (removed 0) transitions.
[2024-05-22 00:45:25] [INFO ] Invariant cache hit.
[2024-05-22 00:45:25] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-22 00:45:25] [INFO ] Invariant cache hit.
[2024-05-22 00:45:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 00:45:25] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2024-05-22 00:45:25] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:45:25] [INFO ] Invariant cache hit.
[2024-05-22 00:45:26] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 662 ms. Remains : 280/280 places, 233/233 transitions.
Graph (complete) has 912 edges and 280 vertex of which 279 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 279 transition count 233
Applied a total of 2 rules in 8 ms. Remains 279 /280 variables (removed 1) and now considering 233/233 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 233 rows 279 cols
[2024-05-22 00:45:26] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 00:45:26] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:45:26] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-22 00:45:26] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 00:45:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:45:26] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 31 ms returned sat
[2024-05-22 00:45:26] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 00:45:26] [INFO ] After 240ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-22 00:45:26] [INFO ] After 507ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p1) p2))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p0 p2 p1))), (G (NOT (AND (NOT p0) p2 (NOT p1))))]
False Knowledge obtained : [(F p2), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (F (AND (NOT p0) p2 p1))]
Knowledge based reduction with 18 factoid took 650 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter insensitive) to 7 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 259 ms :[(NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), false, (AND (NOT p2) p0 (NOT p1)), false, false]
Stuttering acceptance computed with spot in 267 ms :[(NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), false, (AND (NOT p2) p0 (NOT p1)), false, false]
Stuttering acceptance computed with spot in 371 ms :[(NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), false, (AND (NOT p2) p0 (NOT p1)), false, false]
Product exploration explored 100000 steps with 5180 reset in 282 ms.
Product exploration explored 100000 steps with 5121 reset in 299 ms.
Built C files in :
/tmp/ltsmin14373170138701819976
[2024-05-22 00:45:28] [INFO ] Computing symmetric may disable matrix : 247 transitions.
[2024-05-22 00:45:28] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:45:28] [INFO ] Computing symmetric may enable matrix : 247 transitions.
[2024-05-22 00:45:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:45:28] [INFO ] Computing Do-Not-Accords matrix : 247 transitions.
[2024-05-22 00:45:28] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:45:28] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14373170138701819976
Running compilation step : cd /tmp/ltsmin14373170138701819976;'/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'
Compilation finished in 505 ms.
Running link step : cd /tmp/ltsmin14373170138701819976;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14373170138701819976;'/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' '--hoa' '/tmp/stateBased17207420052886812399.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 247/247 transitions.
Applied a total of 0 rules in 5 ms. Remains 285 /285 variables (removed 0) and now considering 247/247 (removed 0) transitions.
// Phase 1: matrix 247 rows 285 cols
[2024-05-22 00:45:43] [INFO ] Computed 59 invariants in 4 ms
[2024-05-22 00:45:44] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-22 00:45:44] [INFO ] Invariant cache hit.
[2024-05-22 00:45:44] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-22 00:45:44] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
[2024-05-22 00:45:44] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:45:44] [INFO ] Invariant cache hit.
[2024-05-22 00:45:44] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 743 ms. Remains : 285/285 places, 247/247 transitions.
Built C files in :
/tmp/ltsmin1251000775450455166
[2024-05-22 00:45:44] [INFO ] Computing symmetric may disable matrix : 247 transitions.
[2024-05-22 00:45:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:45:44] [INFO ] Computing symmetric may enable matrix : 247 transitions.
[2024-05-22 00:45:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:45:44] [INFO ] Computing Do-Not-Accords matrix : 247 transitions.
[2024-05-22 00:45:44] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:45:44] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1251000775450455166
Running compilation step : cd /tmp/ltsmin1251000775450455166;'/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'
Compilation finished in 523 ms.
Running link step : cd /tmp/ltsmin1251000775450455166;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1251000775450455166;'/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' '--hoa' '/tmp/stateBased15394455140370201494.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:45:59] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:45:59] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:45:59] [INFO ] Time to serialize gal into /tmp/LTL2497114103550823147.gal : 2 ms
[2024-05-22 00:45:59] [INFO ] Time to serialize properties into /tmp/LTL11173973311242325577.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/LTL2497114103550823147.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17913371562591922869.hoa' '-atoms' '/tmp/LTL11173973311242325577.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/LTL11173973311242325577.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17913371562591922869.hoa
Detected timeout of ITS tools.
[2024-05-22 00:46:14] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:46:14] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:46:14] [INFO ] Time to serialize gal into /tmp/LTL7629684995382795242.gal : 2 ms
[2024-05-22 00:46:14] [INFO ] Time to serialize properties into /tmp/LTL15863130784865663821.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/LTL7629684995382795242.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15863130784865663821.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 : !((((!("((p9==1)&&(p290==1))"))U((G(!("((p9==1)&&(p290==1))")))||("((!(((p162==1)&&(p189==1))&&(p197==1)))&&(!((p9==1)&&(p290==1))))")...473
Formula 0 simplified : ("((p9==1)&&(p290==1))" M !"((!(((p162==1)&&(p189==1))&&(p197==1)))&&(!((p9==1)&&(p290==1))))") R (F(!"((!(((p162==1)&&(p189==1))&&(...351
Detected timeout of ITS tools.
[2024-05-22 00:46:29] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:46:29] [INFO ] Applying decomposition
[2024-05-22 00:46:29] [INFO ] Flatten gal took : 10 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/graph7741577471200045863.txt' '-o' '/tmp/graph7741577471200045863.bin' '-w' '/tmp/graph7741577471200045863.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7741577471200045863.bin' '-l' '-1' '-v' '-w' '/tmp/graph7741577471200045863.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:46:29] [INFO ] Decomposing Gal with order
[2024-05-22 00:46:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:46:29] [INFO ] Removed a total of 36 redundant transitions.
[2024-05-22 00:46:29] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:46:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 3 ms.
[2024-05-22 00:46:30] [INFO ] Time to serialize gal into /tmp/LTL8479863774416043768.gal : 3 ms
[2024-05-22 00:46:30] [INFO ] Time to serialize properties into /tmp/LTL3385787011179760010.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/LTL8479863774416043768.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3385787011179760010.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...254
Read 1 LTL properties
Checking formula 0 : !((((!("((u7.p9==1)&&(u7.p290==1))"))U((G(!("((u7.p9==1)&&(u7.p290==1))")))||("((!(((u0.p162==1)&&(u0.p189==1))&&(u0.p197==1)))&&(!((u...567
Formula 0 simplified : ("((u7.p9==1)&&(u7.p290==1))" M !"((!(((u0.p162==1)&&(u0.p189==1))&&(u0.p197==1)))&&(!((u7.p9==1)&&(u7.p290==1))))") R (F(!"((!(((u0...427
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1793161588733590702
[2024-05-22 00:46:45] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1793161588733590702
Running compilation step : cd /tmp/ltsmin1793161588733590702;'/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'
Compilation finished in 404 ms.
Running link step : cd /tmp/ltsmin1793161588733590702;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin1793161588733590702;'/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' '((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(LTLAPp1==true))) U ([]((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))||(<>((LTLAPp2==true))&&<>((LTLAPp3==true))&&(!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-40b-LTLFireability-08 finished in 109352 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&&F((!p1&&F(G(!p2)))))||G((F(G(!p2))&&F(!p1))))))'
Support contains 5 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 394 transition count 328
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 381 transition count 328
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 27 place count 381 transition count 317
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 49 place count 370 transition count 317
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 368 transition count 315
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 368 transition count 315
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 366 transition count 313
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 366 transition count 313
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 366 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 365 transition count 310
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 211 place count 290 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 212 place count 290 transition count 234
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 218 place count 287 transition count 249
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 220 place count 285 transition count 247
Applied a total of 220 rules in 42 ms. Remains 285 /401 variables (removed 116) and now considering 247/345 (removed 98) transitions.
// Phase 1: matrix 247 rows 285 cols
[2024-05-22 00:47:00] [INFO ] Computed 59 invariants in 5 ms
[2024-05-22 00:47:00] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-22 00:47:00] [INFO ] Invariant cache hit.
[2024-05-22 00:47:00] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 00:47:00] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2024-05-22 00:47:00] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:47:00] [INFO ] Invariant cache hit.
[2024-05-22 00:47:00] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 285/401 places, 247/345 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 819 ms. Remains : 285/401 places, 247/345 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR p2 p1), p2, p1]
Running random walk in product with property : DES-PT-40b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(OR p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s164 1) (AND (EQ s84 1) (EQ s194 1))), p2:(AND (EQ s84 1) (EQ s194 1)), p1:(AND (EQ s202 1) (EQ s206 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4700 reset in 251 ms.
Product exploration explored 100000 steps with 4715 reset in 271 ms.
Computed a total of 178 stabilizing places and 183 stable transitions
Computed a total of 178 stabilizing places and 183 stable transitions
Detected a total of 178/285 stabilizing places and 183/247 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR p2 (NOT p0))), (X (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (OR p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 144 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[p2]
Incomplete random walk after 10000 steps, including 472 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1591559 steps, run timeout after 3001 ms. (steps per millisecond=530 ) properties seen :{}
Probabilistic random walk after 1591559 steps, saw 202518 distinct states, run finished after 3001 ms. (steps per millisecond=530 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 00:47:04] [INFO ] Invariant cache hit.
[2024-05-22 00:47:04] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2024-05-22 00:47:04] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 00:47:04] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:47:04] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2024-05-22 00:47:05] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 29 ms returned sat
[2024-05-22 00:47:05] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:47:05] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 00:47:05] [INFO ] After 16ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 00:47:05] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2024-05-22 00:47:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-22 00:47:05] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-22 00:47:05] [INFO ] After 417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 247/247 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 285 transition count 246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 285 transition count 245
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 284 transition count 245
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 1 with 2 rules applied. Total rules applied 5 place count 283 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 282 transition count 243
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 282 transition count 243
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 282 transition count 235
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 17 place count 281 transition count 234
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 281 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 280 transition count 233
Applied a total of 19 rules in 22 ms. Remains 280 /285 variables (removed 5) and now considering 233/247 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 280/285 places, 233/247 transitions.
Incomplete random walk after 10000 steps, including 492 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 95 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1602788 steps, run timeout after 3001 ms. (steps per millisecond=534 ) properties seen :{}
Probabilistic random walk after 1602788 steps, saw 215666 distinct states, run finished after 3001 ms. (steps per millisecond=534 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 233 rows 280 cols
[2024-05-22 00:47:08] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 00:47:08] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:47:08] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 00:47:08] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:47:08] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 00:47:08] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-22 00:47:08] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:47:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 00:47:08] [INFO ] After 28ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 00:47:08] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-22 00:47:08] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 233/233 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 280/280 places, 233/233 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 233/233 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 233/233 (removed 0) transitions.
[2024-05-22 00:47:08] [INFO ] Invariant cache hit.
[2024-05-22 00:47:08] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-22 00:47:08] [INFO ] Invariant cache hit.
[2024-05-22 00:47:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 00:47:09] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2024-05-22 00:47:09] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:47:09] [INFO ] Invariant cache hit.
[2024-05-22 00:47:09] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 655 ms. Remains : 280/280 places, 233/233 transitions.
Graph (complete) has 964 edges and 280 vertex of which 279 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 279 /280 variables (removed 1) and now considering 233/233 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 233 rows 279 cols
[2024-05-22 00:47:09] [INFO ] Computed 59 invariants in 7 ms
[2024-05-22 00:47:09] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:47:09] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 00:47:09] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:47:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:47:09] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 78 ms returned sat
[2024-05-22 00:47:09] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:47:09] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-22 00:47:09] [INFO ] After 320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR p2 (NOT p0))), (X (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (OR p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[p2]
Stuttering acceptance computed with spot in 32 ms :[p2]
Support contains 2 out of 285 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 : 285/285 places, 247/247 transitions.
Applied a total of 0 rules in 12 ms. Remains 285 /285 variables (removed 0) and now considering 247/247 (removed 0) transitions.
// Phase 1: matrix 247 rows 285 cols
[2024-05-22 00:47:10] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 00:47:10] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-22 00:47:10] [INFO ] Invariant cache hit.
[2024-05-22 00:47:10] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 00:47:10] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
[2024-05-22 00:47:10] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:47:10] [INFO ] Invariant cache hit.
[2024-05-22 00:47:10] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 749 ms. Remains : 285/285 places, 247/247 transitions.
Computed a total of 178 stabilizing places and 183 stable transitions
Computed a total of 178 stabilizing places and 183 stable transitions
Detected a total of 178/285 stabilizing places and 183/247 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[p2]
Incomplete random walk after 10000 steps, including 470 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1566335 steps, run timeout after 3001 ms. (steps per millisecond=521 ) properties seen :{}
Probabilistic random walk after 1566335 steps, saw 199640 distinct states, run finished after 3001 ms. (steps per millisecond=521 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 00:47:13] [INFO ] Invariant cache hit.
[2024-05-22 00:47:13] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-22 00:47:13] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 00:47:14] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:47:14] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2024-05-22 00:47:14] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 29 ms returned sat
[2024-05-22 00:47:14] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:47:14] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 00:47:14] [INFO ] After 18ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 00:47:14] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2024-05-22 00:47:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2024-05-22 00:47:14] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-22 00:47:14] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 247/247 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 285 transition count 246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 285 transition count 245
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 284 transition count 245
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 1 with 2 rules applied. Total rules applied 5 place count 283 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 282 transition count 243
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 282 transition count 243
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 282 transition count 235
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 281 transition count 234
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 281 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 280 transition count 233
Applied a total of 19 rules in 20 ms. Remains 280 /285 variables (removed 5) and now considering 233/247 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 280/285 places, 233/247 transitions.
Incomplete random walk after 10000 steps, including 491 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1564919 steps, run timeout after 3001 ms. (steps per millisecond=521 ) properties seen :{}
Probabilistic random walk after 1564919 steps, saw 211091 distinct states, run finished after 3001 ms. (steps per millisecond=521 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 233 rows 280 cols
[2024-05-22 00:47:17] [INFO ] Computed 60 invariants in 11 ms
[2024-05-22 00:47:17] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:47:17] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 00:47:17] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:47:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 00:47:17] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 00:47:17] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:47:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 00:47:17] [INFO ] After 32ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 00:47:17] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-22 00:47:17] [INFO ] After 240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 233/233 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 280/280 places, 233/233 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 233/233 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 233/233 (removed 0) transitions.
[2024-05-22 00:47:17] [INFO ] Invariant cache hit.
[2024-05-22 00:47:17] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-22 00:47:17] [INFO ] Invariant cache hit.
[2024-05-22 00:47:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 00:47:18] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2024-05-22 00:47:18] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:47:18] [INFO ] Invariant cache hit.
[2024-05-22 00:47:18] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 665 ms. Remains : 280/280 places, 233/233 transitions.
Graph (complete) has 964 edges and 280 vertex of which 279 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 279 /280 variables (removed 1) and now considering 233/233 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 233 rows 279 cols
[2024-05-22 00:47:18] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 00:47:18] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:47:18] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 00:47:18] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:47:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:47:18] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 79 ms returned sat
[2024-05-22 00:47:18] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:47:18] [INFO ] After 174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-22 00:47:18] [INFO ] After 329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[p2]
Stuttering acceptance computed with spot in 35 ms :[p2]
Stuttering acceptance computed with spot in 41 ms :[p2]
Product exploration explored 100000 steps with 4744 reset in 263 ms.
Product exploration explored 100000 steps with 4678 reset in 275 ms.
Built C files in :
/tmp/ltsmin10790854805520590962
[2024-05-22 00:47:19] [INFO ] Computing symmetric may disable matrix : 247 transitions.
[2024-05-22 00:47:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:47:19] [INFO ] Computing symmetric may enable matrix : 247 transitions.
[2024-05-22 00:47:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:47:19] [INFO ] Computing Do-Not-Accords matrix : 247 transitions.
[2024-05-22 00:47:19] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:47:19] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10790854805520590962
Running compilation step : cd /tmp/ltsmin10790854805520590962;'/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'
Compilation finished in 549 ms.
Running link step : cd /tmp/ltsmin10790854805520590962;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin10790854805520590962;'/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' '--hoa' '/tmp/stateBased425723800720019467.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 247/247 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 285 transition count 246
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 284 transition count 246
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 283 transition count 245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 282 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 282 transition count 244
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 14 place count 282 transition count 236
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 1 with 2 rules applied. Total rules applied 16 place count 281 transition count 235
Applied a total of 16 rules in 25 ms. Remains 281 /285 variables (removed 4) and now considering 235/247 (removed 12) transitions.
// Phase 1: matrix 235 rows 281 cols
[2024-05-22 00:47:34] [INFO ] Computed 59 invariants in 5 ms
[2024-05-22 00:47:34] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-22 00:47:34] [INFO ] Invariant cache hit.
[2024-05-22 00:47:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 00:47:35] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2024-05-22 00:47:35] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:47:35] [INFO ] Invariant cache hit.
[2024-05-22 00:47:35] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 281/285 places, 235/247 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 700 ms. Remains : 281/285 places, 235/247 transitions.
Built C files in :
/tmp/ltsmin10842238145532554048
[2024-05-22 00:47:35] [INFO ] Computing symmetric may disable matrix : 235 transitions.
[2024-05-22 00:47:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:47:35] [INFO ] Computing symmetric may enable matrix : 235 transitions.
[2024-05-22 00:47:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:47:35] [INFO ] Computing Do-Not-Accords matrix : 235 transitions.
[2024-05-22 00:47:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:47:35] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10842238145532554048
Running compilation step : cd /tmp/ltsmin10842238145532554048;'/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'
Compilation finished in 509 ms.
Running link step : cd /tmp/ltsmin10842238145532554048;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10842238145532554048;'/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' '--hoa' '/tmp/stateBased17677424187882317110.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:47:50] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:47:50] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:47:50] [INFO ] Time to serialize gal into /tmp/LTL1682126346496828481.gal : 1 ms
[2024-05-22 00:47:50] [INFO ] Time to serialize properties into /tmp/LTL11928638842780441326.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/LTL1682126346496828481.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15393678002586520874.hoa' '-atoms' '/tmp/LTL11928638842780441326.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/LTL11928638842780441326.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15393678002586520874.hoa
Detected timeout of ITS tools.
[2024-05-22 00:48:05] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:48:05] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:48:05] [INFO ] Time to serialize gal into /tmp/LTL12584022325769271022.gal : 1 ms
[2024-05-22 00:48:05] [INFO ] Time to serialize properties into /tmp/LTL7108586707335514406.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/LTL12584022325769271022.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7108586707335514406.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 : !((F((G((F(G("((p92!=1)||(p283!=1))")))&&(F("((p301!=1)||(p310!=1))"))))||((("(p190!=1)")&&(F(("((p301!=1)||(p310!=1))")&&(F(G("((p92!...208
Formula 0 simplified : G(F(GF!"((p92!=1)||(p283!=1))" | G!"((p301!=1)||(p310!=1))") & (!"((p92!=1)||(p283!=1))" | !"(p190!=1)" | GF!"((p92!=1)||(p283!=1))"...186
Detected timeout of ITS tools.
[2024-05-22 00:48:20] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:48:20] [INFO ] Applying decomposition
[2024-05-22 00:48:20] [INFO ] Flatten gal took : 10 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/graph12676127145890198340.txt' '-o' '/tmp/graph12676127145890198340.bin' '-w' '/tmp/graph12676127145890198340.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12676127145890198340.bin' '-l' '-1' '-v' '-w' '/tmp/graph12676127145890198340.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:48:20] [INFO ] Decomposing Gal with order
[2024-05-22 00:48:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:48:20] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-22 00:48:20] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:48:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 2 ms.
[2024-05-22 00:48:20] [INFO ] Time to serialize gal into /tmp/LTL4525714365183459327.gal : 2 ms
[2024-05-22 00:48:20] [INFO ] Time to serialize properties into /tmp/LTL9435208393023183381.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/LTL4525714365183459327.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9435208393023183381.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...254
Read 1 LTL properties
Checking formula 0 : !((F((G((F(G("((u5.p92!=1)||(u5.p283!=1))")))&&(F("((i8.u7.p301!=1)||(i4.i4.u8.p310!=1))"))))||((("(u0.p190!=1)")&&(F(("((i8.u7.p301!=...259
Formula 0 simplified : G(F(GF!"((u5.p92!=1)||(u5.p283!=1))" | G!"((i8.u7.p301!=1)||(i4.i4.u8.p310!=1))") & (!"((u5.p92!=1)||(u5.p283!=1))" | !"(u0.p190!=1)...237
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10631580444953020278
[2024-05-22 00:48:35] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10631580444953020278
Running compilation step : cd /tmp/ltsmin10631580444953020278;'/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'
Compilation finished in 442 ms.
Running link step : cd /tmp/ltsmin10631580444953020278;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin10631580444953020278;'/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' '<>(([]((<>([]((LTLAPp0==true)))&&<>((LTLAPp1==true))))||(<>(((LTLAPp1==true)&&<>([]((LTLAPp0==true)))))&&(LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-40b-LTLFireability-09 finished in 110806 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((X(X(F(p1)))||p0))))'
Support contains 4 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 394 transition count 329
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 382 transition count 329
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 25 place count 382 transition count 316
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 51 place count 369 transition count 316
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 365 transition count 312
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 365 transition count 312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 59 place count 365 transition count 311
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 61 place count 364 transition count 311
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 362 transition count 309
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 362 transition count 309
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 362 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 361 transition count 306
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 219 place count 286 transition count 231
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 223 place count 284 transition count 236
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 227 place count 284 transition count 232
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 282 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 230 place count 281 transition count 230
Applied a total of 230 rules in 58 ms. Remains 281 /401 variables (removed 120) and now considering 230/345 (removed 115) transitions.
// Phase 1: matrix 230 rows 281 cols
[2024-05-22 00:48:51] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 00:48:51] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-22 00:48:51] [INFO ] Invariant cache hit.
[2024-05-22 00:48:51] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2024-05-22 00:48:51] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:48:51] [INFO ] Invariant cache hit.
[2024-05-22 00:48:51] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 281/401 places, 230/345 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 625 ms. Remains : 281/401 places, 230/345 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s71 0) (EQ s276 0)), p1:(OR (EQ s166 0) (EQ s190 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4629 reset in 219 ms.
Product exploration explored 100000 steps with 4626 reset in 242 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/281 stabilizing places and 170/230 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 161 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 467 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 00:48:52] [INFO ] Invariant cache hit.
[2024-05-22 00:48:52] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:48:52] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 00:48:52] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 33 ms returned sat
[2024-05-22 00:48:52] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:48:52] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-22 00:48:52] [INFO ] After 295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 230/230 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 281 transition count 229
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 281 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 280 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 280 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 279 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 279 transition count 227
Applied a total of 6 rules in 20 ms. Remains 279 /281 variables (removed 2) and now considering 227/230 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 279/281 places, 227/230 transitions.
Incomplete random walk after 10000 steps, including 469 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1552218 steps, run timeout after 3001 ms. (steps per millisecond=517 ) properties seen :{}
Probabilistic random walk after 1552218 steps, saw 200019 distinct states, run finished after 3004 ms. (steps per millisecond=516 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 227 rows 279 cols
[2024-05-22 00:48:55] [INFO ] Computed 59 invariants in 8 ms
[2024-05-22 00:48:55] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:48:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:48:56] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 48 ms returned sat
[2024-05-22 00:48:56] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:48:56] [INFO ] After 226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-22 00:48:56] [INFO ] After 355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 10 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 279/279 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 6 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-22 00:48:56] [INFO ] Invariant cache hit.
[2024-05-22 00:48:56] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-22 00:48:56] [INFO ] Invariant cache hit.
[2024-05-22 00:48:56] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2024-05-22 00:48:56] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:48:56] [INFO ] Invariant cache hit.
[2024-05-22 00:48:56] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 585 ms. Remains : 279/279 places, 227/227 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 279 transition count 227
Applied a total of 1 rules in 8 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 227 rows 279 cols
[2024-05-22 00:48:56] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 00:48:56] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:48:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:48:57] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 46 ms returned sat
[2024-05-22 00:48:57] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:48:57] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-22 00:48:57] [INFO ] After 344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 119 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 230/230 transitions.
Applied a total of 0 rules in 8 ms. Remains 281 /281 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 281 cols
[2024-05-22 00:48:57] [INFO ] Computed 58 invariants in 8 ms
[2024-05-22 00:48:57] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-22 00:48:57] [INFO ] Invariant cache hit.
[2024-05-22 00:48:58] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2024-05-22 00:48:58] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:48:58] [INFO ] Invariant cache hit.
[2024-05-22 00:48:58] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 589 ms. Remains : 281/281 places, 230/230 transitions.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/281 stabilizing places and 170/230 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 83 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 439 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 00:48:58] [INFO ] Invariant cache hit.
[2024-05-22 00:48:58] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:48:58] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 00:48:58] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 34 ms returned sat
[2024-05-22 00:48:58] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:48:58] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-22 00:48:58] [INFO ] After 288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 230/230 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 281 transition count 229
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 281 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 280 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 280 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 279 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 279 transition count 227
Applied a total of 6 rules in 19 ms. Remains 279 /281 variables (removed 2) and now considering 227/230 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 279/281 places, 227/230 transitions.
Incomplete random walk after 10000 steps, including 442 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1626500 steps, run timeout after 3001 ms. (steps per millisecond=541 ) properties seen :{}
Probabilistic random walk after 1626500 steps, saw 209325 distinct states, run finished after 3001 ms. (steps per millisecond=541 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 227 rows 279 cols
[2024-05-22 00:49:01] [INFO ] Computed 59 invariants in 6 ms
[2024-05-22 00:49:01] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:49:01] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:49:01] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 48 ms returned sat
[2024-05-22 00:49:02] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:49:02] [INFO ] After 221ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-22 00:49:02] [INFO ] After 338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 5 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 279/279 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 5 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-22 00:49:02] [INFO ] Invariant cache hit.
[2024-05-22 00:49:02] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-22 00:49:02] [INFO ] Invariant cache hit.
[2024-05-22 00:49:02] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2024-05-22 00:49:02] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:49:02] [INFO ] Invariant cache hit.
[2024-05-22 00:49:02] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 593 ms. Remains : 279/279 places, 227/227 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 279 transition count 227
Applied a total of 1 rules in 9 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 227 rows 279 cols
[2024-05-22 00:49:02] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 00:49:02] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:49:02] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:49:02] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 47 ms returned sat
[2024-05-22 00:49:03] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:49:03] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-22 00:49:03] [INFO ] After 338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 119 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4634 reset in 219 ms.
Product exploration explored 100000 steps with 4689 reset in 235 ms.
Built C files in :
/tmp/ltsmin18318531431196366735
[2024-05-22 00:49:04] [INFO ] Computing symmetric may disable matrix : 230 transitions.
[2024-05-22 00:49:04] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:49:04] [INFO ] Computing symmetric may enable matrix : 230 transitions.
[2024-05-22 00:49:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:49:04] [INFO ] Computing Do-Not-Accords matrix : 230 transitions.
[2024-05-22 00:49:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:49:04] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18318531431196366735
Running compilation step : cd /tmp/ltsmin18318531431196366735;'/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'
Compilation finished in 493 ms.
Running link step : cd /tmp/ltsmin18318531431196366735;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin18318531431196366735;'/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' '--hoa' '/tmp/stateBased869160417949730234.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 230/230 transitions.
Applied a total of 0 rules in 12 ms. Remains 281 /281 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 281 cols
[2024-05-22 00:49:19] [INFO ] Computed 58 invariants in 6 ms
[2024-05-22 00:49:19] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-22 00:49:19] [INFO ] Invariant cache hit.
[2024-05-22 00:49:19] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2024-05-22 00:49:19] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 00:49:19] [INFO ] Invariant cache hit.
[2024-05-22 00:49:19] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 616 ms. Remains : 281/281 places, 230/230 transitions.
Built C files in :
/tmp/ltsmin4405002965993933592
[2024-05-22 00:49:19] [INFO ] Computing symmetric may disable matrix : 230 transitions.
[2024-05-22 00:49:19] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:49:19] [INFO ] Computing symmetric may enable matrix : 230 transitions.
[2024-05-22 00:49:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:49:19] [INFO ] Computing Do-Not-Accords matrix : 230 transitions.
[2024-05-22 00:49:19] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:49:19] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4405002965993933592
Running compilation step : cd /tmp/ltsmin4405002965993933592;'/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'
Compilation finished in 482 ms.
Running link step : cd /tmp/ltsmin4405002965993933592;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4405002965993933592;'/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' '--hoa' '/tmp/stateBased16144232979618375596.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:49:34] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:49:34] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:49:34] [INFO ] Time to serialize gal into /tmp/LTL13874666891568790997.gal : 2 ms
[2024-05-22 00:49:34] [INFO ] Time to serialize properties into /tmp/LTL13869707195755927254.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/LTL13874666891568790997.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15967589825662209587.hoa' '-atoms' '/tmp/LTL13869707195755927254.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...320
Loading property file /tmp/LTL13869707195755927254.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15967589825662209587.hoa
Detected timeout of ITS tools.
[2024-05-22 00:49:49] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:49:49] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:49:50] [INFO ] Time to serialize gal into /tmp/LTL18115487888876649429.gal : 2 ms
[2024-05-22 00:49:50] [INFO ] Time to serialize properties into /tmp/LTL6221699829470461002.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/LTL18115487888876649429.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6221699829470461002.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 : !((F(G(("((p78==0)||(p431==0))")||(X(X(F("((p198==0)||(p281==0))"))))))))
Formula 0 simplified : G(F!"((p78==0)||(p431==0))" & FG!"((p198==0)||(p281==0))")
Detected timeout of ITS tools.
[2024-05-22 00:50:05] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:50:05] [INFO ] Applying decomposition
[2024-05-22 00:50:05] [INFO ] Flatten gal took : 8 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/graph15329463720834921126.txt' '-o' '/tmp/graph15329463720834921126.bin' '-w' '/tmp/graph15329463720834921126.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15329463720834921126.bin' '-l' '-1' '-v' '-w' '/tmp/graph15329463720834921126.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:50:05] [INFO ] Decomposing Gal with order
[2024-05-22 00:50:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:50:05] [INFO ] Removed a total of 49 redundant transitions.
[2024-05-22 00:50:05] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:50:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 3 ms.
[2024-05-22 00:50:05] [INFO ] Time to serialize gal into /tmp/LTL15691688329539009933.gal : 2 ms
[2024-05-22 00:50:05] [INFO ] Time to serialize properties into /tmp/LTL4276271779235675004.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/LTL15691688329539009933.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4276271779235675004.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(G(("((u43.p78==0)||(u43.p431==0))")||(X(X(F("((i1.i1.u3.p198==0)||(i1.i1.u9.p281==0))"))))))))
Formula 0 simplified : G(F!"((u43.p78==0)||(u43.p431==0))" & FG!"((i1.i1.u3.p198==0)||(i1.i1.u9.p281==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4105999121462497254
[2024-05-22 00:50:20] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4105999121462497254
Running compilation step : cd /tmp/ltsmin4105999121462497254;'/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'
Compilation finished in 394 ms.
Running link step : cd /tmp/ltsmin4105999121462497254;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4105999121462497254;'/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(X(<>((LTLAPp1==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-40b-LTLFireability-10 finished in 104313 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||G(p1)))))'
Support contains 2 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 397 transition count 341
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 394 transition count 338
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 393 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 393 transition count 333
Applied a total of 20 rules in 33 ms. Remains 393 /401 variables (removed 8) and now considering 333/345 (removed 12) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-22 00:50:35] [INFO ] Computed 62 invariants in 8 ms
[2024-05-22 00:50:35] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-22 00:50:35] [INFO ] Invariant cache hit.
[2024-05-22 00:50:35] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
[2024-05-22 00:50:35] [INFO ] Invariant cache hit.
[2024-05-22 00:50:36] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/401 places, 333/345 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 814 ms. Remains : 393/401 places, 333/345 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-40b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s306 0), p0:(EQ s383 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 308 ms.
Product exploration explored 100000 steps with 50000 reset in 325 ms.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-40b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-40b-LTLFireability-11 finished in 1656 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(G(p0))))'
Support contains 3 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 397 transition count 341
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 394 transition count 338
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 393 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 393 transition count 333
Applied a total of 20 rules in 29 ms. Remains 393 /401 variables (removed 8) and now considering 333/345 (removed 12) transitions.
[2024-05-22 00:50:36] [INFO ] Invariant cache hit.
[2024-05-22 00:50:37] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-22 00:50:37] [INFO ] Invariant cache hit.
[2024-05-22 00:50:37] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
[2024-05-22 00:50:37] [INFO ] Invariant cache hit.
[2024-05-22 00:50:37] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/401 places, 333/345 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 822 ms. Remains : 393/401 places, 333/345 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s235 1) (AND (EQ s109 1) (EQ s242 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DES-PT-40b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-12 finished in 966 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((p0||(G(p2)&&p1)))))'
Support contains 4 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 394 transition count 328
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 381 transition count 328
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 27 place count 381 transition count 317
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 49 place count 370 transition count 317
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 367 transition count 314
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 367 transition count 314
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 55 place count 367 transition count 313
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 57 place count 366 transition count 313
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 364 transition count 311
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 364 transition count 311
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 65 place count 364 transition count 307
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 68 place count 362 transition count 306
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 218 place count 287 transition count 231
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 222 place count 285 transition count 236
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 224 place count 283 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 225 place count 282 transition count 234
Applied a total of 225 rules in 52 ms. Remains 282 /401 variables (removed 119) and now considering 234/345 (removed 111) transitions.
// Phase 1: matrix 234 rows 282 cols
[2024-05-22 00:50:37] [INFO ] Computed 58 invariants in 7 ms
[2024-05-22 00:50:38] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-22 00:50:38] [INFO ] Invariant cache hit.
[2024-05-22 00:50:38] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2024-05-22 00:50:38] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 00:50:38] [INFO ] Invariant cache hit.
[2024-05-22 00:50:38] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 282/401 places, 234/345 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 660 ms. Remains : 282/401 places, 234/345 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-40b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s198 1) (EQ s202 1)), p0:(EQ s260 1), p2:(EQ s163 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA DES-PT-40b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-14 finished in 790 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(((F((!p0&&X(F(p1))))&&G(!p2))||G((F(p1)&&F(!p0)))))))'
Support contains 5 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 397 transition count 341
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 394 transition count 338
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 393 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 393 transition count 333
Applied a total of 20 rules in 22 ms. Remains 393 /401 variables (removed 8) and now considering 333/345 (removed 12) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-22 00:50:38] [INFO ] Computed 62 invariants in 8 ms
[2024-05-22 00:50:38] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-22 00:50:38] [INFO ] Invariant cache hit.
[2024-05-22 00:50:39] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
[2024-05-22 00:50:39] [INFO ] Invariant cache hit.
[2024-05-22 00:50:39] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/401 places, 333/345 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 817 ms. Remains : 393/401 places, 333/345 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Running random walk in product with property : DES-PT-40b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(OR (NOT p1) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s284 1) (EQ s313 1) (EQ s151 1) (EQ s182 1)), p1:(NEQ s315 1), p0:(AND (EQ s284 1) (EQ s313 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1727 reset in 195 ms.
Product exploration explored 100000 steps with 1664 reset in 222 ms.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (NOT p1) (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (NOT p1) (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 133 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Incomplete random walk after 10000 steps, including 83 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 00:50:40] [INFO ] Invariant cache hit.
[2024-05-22 00:50:40] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-22 00:50:40] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 22 ms returned sat
[2024-05-22 00:50:40] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:50:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-22 00:50:41] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 26 ms returned sat
[2024-05-22 00:50:41] [INFO ] After 277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 00:50:41] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:50:41] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:50:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2024-05-22 00:50:41] [INFO ] After 536ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 76 ms.
[2024-05-22 00:50:41] [INFO ] After 739ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 48 ms.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 387 transition count 312
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 371 transition count 312
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 371 transition count 300
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 359 transition count 300
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 207 place count 285 transition count 226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 211 place count 283 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 212 place count 283 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 213 place count 282 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 214 place count 282 transition count 227
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 215 place count 281 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 216 place count 280 transition count 226
Applied a total of 216 rules in 33 ms. Remains 280 /393 variables (removed 113) and now considering 226/333 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 280/393 places, 226/333 transitions.
Incomplete random walk after 10000 steps, including 402 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1040384 steps, run timeout after 3001 ms. (steps per millisecond=346 ) properties seen :{}
Probabilistic random walk after 1040384 steps, saw 142164 distinct states, run finished after 3001 ms. (steps per millisecond=346 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 226 rows 280 cols
[2024-05-22 00:50:44] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 00:50:45] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:50:45] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 00:50:45] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:50:45] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:50:45] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 38 ms returned sat
[2024-05-22 00:50:45] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 00:50:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:50:45] [INFO ] After 55ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 00:50:45] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 59 ms.
[2024-05-22 00:50:45] [INFO ] After 524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 37 ms.
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 226/226 transitions.
Applied a total of 0 rules in 13 ms. Remains 280 /280 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 280/280 places, 226/226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 226/226 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2024-05-22 00:50:45] [INFO ] Invariant cache hit.
[2024-05-22 00:50:45] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-22 00:50:45] [INFO ] Invariant cache hit.
[2024-05-22 00:50:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:50:46] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2024-05-22 00:50:46] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:50:46] [INFO ] Invariant cache hit.
[2024-05-22 00:50:46] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 563 ms. Remains : 280/280 places, 226/226 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 280 transition count 226
Applied a total of 1 rules in 8 ms. Remains 280 /280 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 226 rows 280 cols
[2024-05-22 00:50:46] [INFO ] Computed 60 invariants in 6 ms
[2024-05-22 00:50:46] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:50:46] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-22 00:50:46] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:50:46] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:50:46] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 38 ms returned sat
[2024-05-22 00:50:46] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 00:50:46] [INFO ] After 233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 52 ms.
[2024-05-22 00:50:46] [INFO ] After 434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (NOT p1) (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (NOT p1) (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p0 (NOT p2))), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 302 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Applied a total of 0 rules in 10 ms. Remains 393 /393 variables (removed 0) and now considering 333/333 (removed 0) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-22 00:50:47] [INFO ] Computed 62 invariants in 9 ms
[2024-05-22 00:50:47] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-22 00:50:47] [INFO ] Invariant cache hit.
[2024-05-22 00:50:48] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
[2024-05-22 00:50:48] [INFO ] Invariant cache hit.
[2024-05-22 00:50:48] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 795 ms. Remains : 393/393 places, 333/333 transitions.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (NOT p1))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 146 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Incomplete random walk after 10000 steps, including 80 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 00:50:48] [INFO ] Invariant cache hit.
[2024-05-22 00:50:48] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-22 00:50:49] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 23 ms returned sat
[2024-05-22 00:50:49] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:50:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-22 00:50:49] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 27 ms returned sat
[2024-05-22 00:50:49] [INFO ] After 286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 00:50:49] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-22 00:50:49] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:50:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 155 ms
[2024-05-22 00:50:49] [INFO ] After 540ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 82 ms.
[2024-05-22 00:50:49] [INFO ] After 752ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 41 ms.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 387 transition count 312
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 371 transition count 312
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 371 transition count 300
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 359 transition count 300
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 207 place count 285 transition count 226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 211 place count 283 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 212 place count 283 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 213 place count 282 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 214 place count 282 transition count 227
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 215 place count 281 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 216 place count 280 transition count 226
Applied a total of 216 rules in 32 ms. Remains 280 /393 variables (removed 113) and now considering 226/333 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 280/393 places, 226/333 transitions.
Incomplete random walk after 10000 steps, including 410 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 88 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 87 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1010525 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :{}
Probabilistic random walk after 1010525 steps, saw 138525 distinct states, run finished after 3001 ms. (steps per millisecond=336 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 226 rows 280 cols
[2024-05-22 00:50:53] [INFO ] Computed 60 invariants in 2 ms
[2024-05-22 00:50:53] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-22 00:50:53] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-22 00:50:53] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:50:53] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:50:53] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 38 ms returned sat
[2024-05-22 00:50:53] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 00:50:53] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:50:53] [INFO ] After 58ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 00:50:53] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 55 ms.
[2024-05-22 00:50:53] [INFO ] After 514ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 37 ms.
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 226/226 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 280/280 places, 226/226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 226/226 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2024-05-22 00:50:53] [INFO ] Invariant cache hit.
[2024-05-22 00:50:53] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-22 00:50:53] [INFO ] Invariant cache hit.
[2024-05-22 00:50:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:50:54] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2024-05-22 00:50:54] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:50:54] [INFO ] Invariant cache hit.
[2024-05-22 00:50:54] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 572 ms. Remains : 280/280 places, 226/226 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 280 transition count 226
Applied a total of 1 rules in 8 ms. Remains 280 /280 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 226 rows 280 cols
[2024-05-22 00:50:54] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 00:50:54] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 00:50:54] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-22 00:50:54] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:50:54] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:50:54] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 38 ms returned sat
[2024-05-22 00:50:54] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 00:50:54] [INFO ] After 243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 45 ms.
[2024-05-22 00:50:54] [INFO ] After 436ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (NOT p1))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p0 (NOT p2))), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 340 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Product exploration explored 100000 steps with 1721 reset in 208 ms.
Product exploration explored 100000 steps with 1740 reset in 222 ms.
Applying partial POR strategy [false, false, true, false, true, false]
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 387 transition count 330
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 15 place count 387 transition count 332
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 23 place count 387 transition count 332
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 382 transition count 327
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 382 transition count 327
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 92 places in 0 ms
Iterating global reduction 1 with 75 rules applied. Total rules applied 108 place count 382 transition count 330
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 118 place count 372 transition count 320
Deduced a syphon composed of 82 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 128 place count 372 transition count 320
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 134 place count 372 transition count 348
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 136 place count 370 transition count 342
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 138 place count 370 transition count 342
Deduced a syphon composed of 86 places in 0 ms
Applied a total of 138 rules in 76 ms. Remains 370 /393 variables (removed 23) and now considering 342/333 (removed -9) transitions.
[2024-05-22 00:50:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 342 rows 370 cols
[2024-05-22 00:50:56] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 00:50:56] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 370/393 places, 342/333 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 261 ms. Remains : 370/393 places, 342/333 transitions.
Built C files in :
/tmp/ltsmin7505086875537822012
[2024-05-22 00:50:56] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7505086875537822012
Running compilation step : cd /tmp/ltsmin7505086875537822012;'/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'
Compilation finished in 531 ms.
Running link step : cd /tmp/ltsmin7505086875537822012;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7505086875537822012;'/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' '--hoa' '/tmp/stateBased9573937663449650277.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Applied a total of 0 rules in 22 ms. Remains 393 /393 variables (removed 0) and now considering 333/333 (removed 0) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-22 00:51:12] [INFO ] Computed 62 invariants in 11 ms
[2024-05-22 00:51:12] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-22 00:51:12] [INFO ] Invariant cache hit.
[2024-05-22 00:51:12] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
[2024-05-22 00:51:12] [INFO ] Invariant cache hit.
[2024-05-22 00:51:12] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 811 ms. Remains : 393/393 places, 333/333 transitions.
Built C files in :
/tmp/ltsmin1867745016456354032
[2024-05-22 00:51:12] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1867745016456354032
Running compilation step : cd /tmp/ltsmin1867745016456354032;'/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'
Compilation finished in 516 ms.
Running link step : cd /tmp/ltsmin1867745016456354032;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1867745016456354032;'/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' '--hoa' '/tmp/stateBased8000736085892906606.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:51:28] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:51:28] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:51:28] [INFO ] Time to serialize gal into /tmp/LTL10730198758813079600.gal : 2 ms
[2024-05-22 00:51:28] [INFO ] Time to serialize properties into /tmp/LTL17554527948283569630.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/LTL10730198758813079600.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5601266267110899843.hoa' '-atoms' '/tmp/LTL17554527948283569630.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/LTL17554527948283569630.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5601266267110899843.hoa
Detected timeout of ITS tools.
[2024-05-22 00:51:43] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:51:43] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:51:43] [INFO ] Time to serialize gal into /tmp/LTL3059898569120075224.gal : 2 ms
[2024-05-22 00:51:43] [INFO ] Time to serialize properties into /tmp/LTL2437285729232113186.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/LTL3059898569120075224.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2437285729232113186.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 : !((X(F((G((F("(p356!=1)"))&&(F("((p325!=1)||(p354!=1))"))))||((F(("((p325!=1)||(p354!=1))")&&(X(F("(p356!=1)")))))&&(G("(((p325!=1)||(...197
Formula 0 simplified : XG(F(G!"(p356!=1)" | G!"((p325!=1)||(p354!=1))") & (G(!"((p325!=1)||(p354!=1))" | XG!"(p356!=1)") | F!"(((p325!=1)||(p354!=1))||((p1...177
Detected timeout of ITS tools.
[2024-05-22 00:51:58] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:51:58] [INFO ] Applying decomposition
[2024-05-22 00:51:58] [INFO ] Flatten gal took : 13 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/graph9639179239849782448.txt' '-o' '/tmp/graph9639179239849782448.bin' '-w' '/tmp/graph9639179239849782448.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9639179239849782448.bin' '-l' '-1' '-v' '-w' '/tmp/graph9639179239849782448.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:51:58] [INFO ] Decomposing Gal with order
[2024-05-22 00:51:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:51:58] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-22 00:51:58] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:51:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-22 00:51:58] [INFO ] Time to serialize gal into /tmp/LTL2940309780950477666.gal : 3 ms
[2024-05-22 00:51:58] [INFO ] Time to serialize properties into /tmp/LTL4361891548170963522.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/LTL2940309780950477666.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4361891548170963522.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...254
Read 1 LTL properties
Checking formula 0 : !((X(F((G((F("(i6.i2.u53.p356!=1)"))&&(F("((i6.i0.u43.p325!=1)||(i6.i1.u52.p354!=1))"))))||((F(("((i6.i0.u43.p325!=1)||(i6.i1.u52.p354...289
Formula 0 simplified : XG(F(G!"(i6.i2.u53.p356!=1)" | G!"((i6.i0.u43.p325!=1)||(i6.i1.u52.p354!=1))") & (G(!"((i6.i0.u43.p325!=1)||(i6.i1.u52.p354!=1))" | ...269
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10144209090743140289
[2024-05-22 00:52:13] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10144209090743140289
Running compilation step : cd /tmp/ltsmin10144209090743140289;'/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'
Compilation finished in 540 ms.
Running link step : cd /tmp/ltsmin10144209090743140289;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10144209090743140289;'/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))))||(<>(((LTLAPp1==true)&&X(<>((LTLAPp0==true)))))&&[]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-40b-LTLFireability-15 finished in 109745 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(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0)))) U (G((X(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0)))))||(!p1&&(X(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0))))))))'
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(G((F(p1)||p0)))&&(F(p1)||X(F(p2))))))'
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 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(F(p2)&&F(p3)&&(!p0 U (p1||G(!p0)))))))'
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&&F((!p1&&F(G(!p2)))))||G((F(G(!p2))&&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' '!(F(G((X(X(F(p1)))||p0))))'
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(((F((!p0&&X(F(p1))))&&G(!p2))||G((F(p1)&&F(!p0)))))))'
Found a Shortening insensitive property : DES-PT-40b-LTLFireability-15
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Support contains 5 out of 401 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 394 transition count 329
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 382 transition count 329
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 25 place count 382 transition count 317
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 49 place count 370 transition count 317
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 366 transition count 313
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 366 transition count 313
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 57 place count 366 transition count 312
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 59 place count 365 transition count 312
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 362 transition count 309
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 362 transition count 309
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 70 place count 362 transition count 304
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 73 place count 360 transition count 303
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 221 place count 286 transition count 229
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 4 with 4 rules applied. Total rules applied 225 place count 284 transition count 231
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 227 place count 282 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 228 place count 281 transition count 229
Applied a total of 228 rules in 60 ms. Remains 281 /401 variables (removed 120) and now considering 229/345 (removed 116) transitions.
// Phase 1: matrix 229 rows 281 cols
[2024-05-22 00:52:29] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 00:52:29] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-22 00:52:29] [INFO ] Invariant cache hit.
[2024-05-22 00:52:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:52:29] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2024-05-22 00:52:29] [INFO ] Invariant cache hit.
[2024-05-22 00:52:29] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 281/401 places, 229/345 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 630 ms. Remains : 281/401 places, 229/345 transitions.
Running random walk in product with property : DES-PT-40b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(OR (NOT p1) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s210 1) (EQ s227 1) (EQ s143 1) (EQ s164 1)), p1:(NEQ s229 1), p0:(AND (EQ s210 1) (EQ s227 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8195 reset in 246 ms.
Product exploration explored 100000 steps with 8164 reset in 298 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (NOT p1) (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (NOT p1) (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 166 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Incomplete random walk after 10000 steps, including 444 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 00:52:31] [INFO ] Invariant cache hit.
[2024-05-22 00:52:31] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 00:52:31] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-22 00:52:31] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:52:31] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 00:52:31] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 62 ms returned sat
[2024-05-22 00:52:31] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 00:52:31] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:52:31] [INFO ] After 77ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 00:52:31] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 49 ms.
[2024-05-22 00:52:31] [INFO ] After 504ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 5 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 229/229 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 281 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 281 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 280 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 280 transition count 227
Applied a total of 4 rules in 15 ms. Remains 280 /281 variables (removed 1) and now considering 227/229 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 280/281 places, 227/229 transitions.
Incomplete random walk after 10000 steps, including 438 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 939501 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :{}
Probabilistic random walk after 939501 steps, saw 129738 distinct states, run finished after 3001 ms. (steps per millisecond=313 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 227 rows 280 cols
[2024-05-22 00:52:34] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 00:52:34] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:52:34] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 00:52:34] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:52:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:52:35] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 89 ms returned sat
[2024-05-22 00:52:35] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 00:52:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:52:35] [INFO ] After 52ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 00:52:35] [INFO ] After 127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 51 ms.
[2024-05-22 00:52:35] [INFO ] After 530ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 52 ms.
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 227/227 transitions.
Applied a total of 0 rules in 6 ms. Remains 280 /280 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 280/280 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-22 00:52:35] [INFO ] Invariant cache hit.
[2024-05-22 00:52:35] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-22 00:52:35] [INFO ] Invariant cache hit.
[2024-05-22 00:52:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:52:36] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2024-05-22 00:52:36] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:52:36] [INFO ] Invariant cache hit.
[2024-05-22 00:52:36] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 560 ms. Remains : 280/280 places, 227/227 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 280 transition count 227
Applied a total of 1 rules in 8 ms. Remains 280 /280 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 227 rows 280 cols
[2024-05-22 00:52:36] [INFO ] Computed 59 invariants in 4 ms
[2024-05-22 00:52:36] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:52:36] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 00:52:36] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:52:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:52:36] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 90 ms returned sat
[2024-05-22 00:52:36] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 00:52:36] [INFO ] After 251ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-05-22 00:52:36] [INFO ] After 456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (NOT p1) (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (NOT p1) (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p0 (NOT p2))), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 356 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Support contains 5 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 229/229 transitions.
Applied a total of 0 rules in 4 ms. Remains 281 /281 variables (removed 0) and now considering 229/229 (removed 0) transitions.
// Phase 1: matrix 229 rows 281 cols
[2024-05-22 00:52:37] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 00:52:37] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-22 00:52:37] [INFO ] Invariant cache hit.
[2024-05-22 00:52:37] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:52:38] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2024-05-22 00:52:38] [INFO ] Invariant cache hit.
[2024-05-22 00:52:38] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 581 ms. Remains : 281/281 places, 229/229 transitions.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (NOT p1))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 251 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Incomplete random walk after 10000 steps, including 451 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 98 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 00:52:38] [INFO ] Invariant cache hit.
[2024-05-22 00:52:38] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 00:52:38] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-22 00:52:38] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:52:39] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 00:52:39] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 62 ms returned sat
[2024-05-22 00:52:39] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 00:52:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:52:39] [INFO ] After 74ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 00:52:39] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-05-22 00:52:39] [INFO ] After 501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 5 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 229/229 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 281 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 281 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 280 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 280 transition count 227
Applied a total of 4 rules in 12 ms. Remains 280 /281 variables (removed 1) and now considering 227/229 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 280/281 places, 227/229 transitions.
Incomplete random walk after 10000 steps, including 463 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 86 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 987043 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :{}
Probabilistic random walk after 987043 steps, saw 135792 distinct states, run finished after 3001 ms. (steps per millisecond=328 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 227 rows 280 cols
[2024-05-22 00:52:42] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 00:52:42] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:52:42] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 00:52:42] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:52:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:52:42] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 90 ms returned sat
[2024-05-22 00:52:43] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 00:52:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:52:43] [INFO ] After 63ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 00:52:43] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 54 ms.
[2024-05-22 00:52:43] [INFO ] After 567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 54 ms.
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 280/280 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-22 00:52:43] [INFO ] Invariant cache hit.
[2024-05-22 00:52:43] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-22 00:52:43] [INFO ] Invariant cache hit.
[2024-05-22 00:52:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:52:43] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2024-05-22 00:52:43] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:52:43] [INFO ] Invariant cache hit.
[2024-05-22 00:52:44] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 589 ms. Remains : 280/280 places, 227/227 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 280 transition count 227
Applied a total of 1 rules in 7 ms. Remains 280 /280 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 227 rows 280 cols
[2024-05-22 00:52:44] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 00:52:44] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2024-05-22 00:52:44] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 00:52:44] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:52:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:52:44] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 89 ms returned sat
[2024-05-22 00:52:44] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 00:52:44] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-22 00:52:44] [INFO ] After 449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (NOT p1))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p0 (NOT p2))), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 347 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Product exploration explored 100000 steps with 8222 reset in 253 ms.
Product exploration explored 100000 steps with 8233 reset in 271 ms.
Applying partial POR strategy [false, false, true, false, true, false]
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Support contains 5 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 229/229 transitions.
Applied a total of 0 rules in 10 ms. Remains 281 /281 variables (removed 0) and now considering 229/229 (removed 0) transitions.
[2024-05-22 00:52:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 229 rows 281 cols
[2024-05-22 00:52:46] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 00:52:46] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 281/281 places, 229/229 transitions.
Built C files in :
/tmp/ltsmin13501201253048476072
[2024-05-22 00:52:46] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13501201253048476072
Running compilation step : cd /tmp/ltsmin13501201253048476072;'/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'
Compilation finished in 406 ms.
Running link step : cd /tmp/ltsmin13501201253048476072;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin13501201253048476072;'/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' '--hoa' '/tmp/stateBased5128406149334761349.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 229/229 transitions.
Applied a total of 0 rules in 18 ms. Remains 281 /281 variables (removed 0) and now considering 229/229 (removed 0) transitions.
[2024-05-22 00:53:01] [INFO ] Invariant cache hit.
[2024-05-22 00:53:02] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-22 00:53:02] [INFO ] Invariant cache hit.
[2024-05-22 00:53:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:53:02] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2024-05-22 00:53:02] [INFO ] Invariant cache hit.
[2024-05-22 00:53:02] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 588 ms. Remains : 281/281 places, 229/229 transitions.
Built C files in :
/tmp/ltsmin17848123017125634212
[2024-05-22 00:53:02] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17848123017125634212
Running compilation step : cd /tmp/ltsmin17848123017125634212;'/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'
Compilation finished in 401 ms.
Running link step : cd /tmp/ltsmin17848123017125634212;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17848123017125634212;'/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' '--hoa' '/tmp/stateBased13949724524081824143.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:53:17] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:53:17] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:53:17] [INFO ] Time to serialize gal into /tmp/LTL1571537418224106862.gal : 1 ms
[2024-05-22 00:53:17] [INFO ] Time to serialize properties into /tmp/LTL16015501968578859101.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/LTL1571537418224106862.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9591599157154154099.hoa' '-atoms' '/tmp/LTL16015501968578859101.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/LTL16015501968578859101.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9591599157154154099.hoa
Detected timeout of ITS tools.
[2024-05-22 00:53:32] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:53:32] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:53:32] [INFO ] Time to serialize gal into /tmp/LTL4138686880911742049.gal : 2 ms
[2024-05-22 00:53:32] [INFO ] Time to serialize properties into /tmp/LTL6273555662670262427.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/LTL4138686880911742049.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6273555662670262427.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 : !((X(F((G((F("(p356!=1)"))&&(F("((p325!=1)||(p354!=1))"))))||((F(("((p325!=1)||(p354!=1))")&&(X(F("(p356!=1)")))))&&(G("(((p325!=1)||(...197
Formula 0 simplified : XG(F(G!"(p356!=1)" | G!"((p325!=1)||(p354!=1))") & (G(!"((p325!=1)||(p354!=1))" | XG!"(p356!=1)") | F!"(((p325!=1)||(p354!=1))||((p1...177
Detected timeout of ITS tools.
[2024-05-22 00:53:47] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:53:47] [INFO ] Applying decomposition
[2024-05-22 00:53:47] [INFO ] Flatten gal took : 8 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/graph7802984153322137021.txt' '-o' '/tmp/graph7802984153322137021.bin' '-w' '/tmp/graph7802984153322137021.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7802984153322137021.bin' '-l' '-1' '-v' '-w' '/tmp/graph7802984153322137021.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:53:47] [INFO ] Decomposing Gal with order
[2024-05-22 00:53:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:53:47] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-22 00:53:47] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:53:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 2 ms.
[2024-05-22 00:53:47] [INFO ] Time to serialize gal into /tmp/LTL15770524398868175723.gal : 2 ms
[2024-05-22 00:53:47] [INFO ] Time to serialize properties into /tmp/LTL12112146951187111874.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/LTL15770524398868175723.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12112146951187111874.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((G((F("(i5.u26.p356!=1)"))&&(F("((i6.i2.u17.p325!=1)||(i6.i2.u25.p354!=1))"))))||((F(("((i6.i2.u17.p325!=1)||(i6.i2.u25.p354!=1...277
Formula 0 simplified : XG(F(G!"(i5.u26.p356!=1)" | G!"((i6.i2.u17.p325!=1)||(i6.i2.u25.p354!=1))") & (G(!"((i6.i2.u17.p325!=1)||(i6.i2.u25.p354!=1))" | XG!...257
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9724683345464594281
[2024-05-22 00:54:02] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9724683345464594281
Running compilation step : cd /tmp/ltsmin9724683345464594281;'/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'
Compilation finished in 387 ms.
Running link step : cd /tmp/ltsmin9724683345464594281;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9724683345464594281;'/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))))||(<>(((LTLAPp1==true)&&X(<>((LTLAPp0==true)))))&&[]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-40b-LTLFireability-15 finished in 108968 ms.
[2024-05-22 00:54:17] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14395157606013024745
[2024-05-22 00:54:17] [INFO ] Computing symmetric may disable matrix : 345 transitions.
[2024-05-22 00:54:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:54:17] [INFO ] Computing symmetric may enable matrix : 345 transitions.
[2024-05-22 00:54:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:54:17] [INFO ] Applying decomposition
[2024-05-22 00:54:17] [INFO ] Flatten gal took : 27 ms
[2024-05-22 00:54:17] [INFO ] Computing Do-Not-Accords matrix : 345 transitions.
[2024-05-22 00:54:17] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:54:17] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14395157606013024745
Running compilation step : cd /tmp/ltsmin14395157606013024745;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '120' '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'
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/graph389928497826292098.txt' '-o' '/tmp/graph389928497826292098.bin' '-w' '/tmp/graph389928497826292098.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph389928497826292098.bin' '-l' '-1' '-v' '-w' '/tmp/graph389928497826292098.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:54:18] [INFO ] Decomposing Gal with order
[2024-05-22 00:54:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:54:18] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-22 00:54:18] [INFO ] Flatten gal took : 31 ms
[2024-05-22 00:54:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 00:54:18] [INFO ] Time to serialize gal into /tmp/LTLFireability7094707284939218831.gal : 3 ms
[2024-05-22 00:54:18] [INFO ] Time to serialize properties into /tmp/LTLFireability15738229656298481598.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/LTLFireability7094707284939218831.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15738229656298481598.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 6 LTL properties
Checking formula 0 : !((((X(!("((i11.u83.p85==1)&&(i11.u83.p431==1))")))U(((X(!("((i11.u83.p85==1)&&(i11.u83.p431==1))")))&&(G((!("((i11.u83.p85==1)&&(i11....813
Formula 0 simplified : "((u10.p158==1)&&(u10.p189==1))" U (X"((i11.u83.p85==1)&&(i11.u83.p431==1))" R (XF"((i11.u83.p85==1)&&(i11.u83.p431==1))" & (X"((i11...272
Compilation finished in 867 ms.
Running link step : cd /tmp/ltsmin14395157606013024745;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin14395157606013024745;'/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)) U ((X(!(LTLAPp0==true))&&[]((!(LTLAPp0==true)||X(!(LTLAPp1==true)))))||X([](!(LTLAPp0==true))))) U ([]((X(!(LTLAPp0==true)) U ((X(!(LTLAPp0==true))&&[]((!(LTLAPp0==true)||X(!(LTLAPp1==true)))))||X([](!(LTLAPp0==true))))))||(!(LTLAPp1==true)&&(X(!(LTLAPp0==true)) U ((X(!(LTLAPp0==true))&&[]((!(LTLAPp0==true)||X(!(LTLAPp1==true)))))||X([](!(LTLAPp0==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin14395157606013024745;'/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)) U ((X(!(LTLAPp0==true))&&[]((!(LTLAPp0==true)||X(!(LTLAPp1==true)))))||X([](!(LTLAPp0==true))))) U ([]((X(!(LTLAPp0==true)) U ((X(!(LTLAPp0==true))&&[]((!(LTLAPp0==true)||X(!(LTLAPp1==true)))))||X([](!(LTLAPp0==true))))))||(!(LTLAPp1==true)&&(X(!(LTLAPp0==true)) U ((X(!(LTLAPp0==true))&&[]((!(LTLAPp0==true)||X(!(LTLAPp1==true)))))||X([](!(LTLAPp0==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14395157606013024745;'/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' '[]((<>([]((<>((LTLAPp3==true))||(LTLAPp2==true))))&&(<>((LTLAPp3==true))||X(<>((LTLAPp4==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.022: LTL layer: formula: []((<>([]((<>((LTLAPp3==true))||(LTLAPp2==true))))&&(<>((LTLAPp3==true))||X(<>((LTLAPp4==true))))))
pins2lts-mc-linux64( 0/ 8), 0.022: "[]((<>([]((<>((LTLAPp3==true))||(LTLAPp2==true))))&&(<>((LTLAPp3==true))||X(<>((LTLAPp4==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.023: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.046: buchi has 4 states
pins2lts-mc-linux64( 4/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.125: There are 363 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.125: State length is 402, there are 353 groups
pins2lts-mc-linux64( 0/ 8), 0.125: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.125: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.125: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.125: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.176: [Blue] ~65 levels ~960 states ~4832 transitions
pins2lts-mc-linux64( 5/ 8), 0.208: [Blue] ~114 levels ~1920 states ~8240 transitions
pins2lts-mc-linux64( 3/ 8), 0.241: [Blue] ~113 levels ~3840 states ~13360 transitions
pins2lts-mc-linux64( 3/ 8), 0.291: [Blue] ~113 levels ~7680 states ~26016 transitions
pins2lts-mc-linux64( 5/ 8), 0.400: [Blue] ~114 levels ~15360 states ~54528 transitions
pins2lts-mc-linux64( 5/ 8), 0.610: [Blue] ~114 levels ~30720 states ~116560 transitions
pins2lts-mc-linux64( 5/ 8), 1.043: [Blue] ~114 levels ~61440 states ~259552 transitions
pins2lts-mc-linux64( 6/ 8), 1.833: [Blue] ~127 levels ~122880 states ~347336 transitions
pins2lts-mc-linux64( 2/ 8), 3.327: [Blue] ~120 levels ~245760 states ~1125264 transitions
pins2lts-mc-linux64( 6/ 8), 5.801: [Blue] ~130 levels ~491520 states ~1464816 transitions
pins2lts-mc-linux64( 2/ 8), 10.177: [Blue] ~121 levels ~983040 states ~4979424 transitions
pins2lts-mc-linux64( 2/ 8), 20.840: [Blue] ~121 levels ~1966080 states ~10732496 transitions
pins2lts-mc-linux64( 7/ 8), 43.570: [Blue] ~119 levels ~3932160 states ~23151520 transitions
pins2lts-mc-linux64( 2/ 8), 87.057: [Blue] ~161 levels ~7864320 states ~44327360 transitions
pins2lts-mc-linux64( 2/ 8), 175.988: [Blue] ~161 levels ~15728640 states ~96453808 transitions
pins2lts-mc-linux64( 2/ 8), 337.823: [Blue] ~161 levels ~31457280 states ~211829136 transitions
pins2lts-mc-linux64( 3/ 8), 496.892: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 496.913:
pins2lts-mc-linux64( 0/ 8), 496.913: Explored 47358215 states 233589033 transitions, fanout: 4.932
pins2lts-mc-linux64( 0/ 8), 496.913: Total exploration time 496.770 sec (496.740 sec minimum, 496.755 sec on average)
pins2lts-mc-linux64( 0/ 8), 496.914: States per second: 95332, Transitions per second: 470216
pins2lts-mc-linux64( 0/ 8), 496.914:
pins2lts-mc-linux64( 0/ 8), 496.914: State space has 47310274 states, 41085805 are accepting
pins2lts-mc-linux64( 0/ 8), 496.914: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 496.914: blue states: 47358215 (100.10%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 496.914: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 496.914: all-red states: 41085805 (86.84%), bogus 54414 (0.12%)
pins2lts-mc-linux64( 0/ 8), 496.914:
pins2lts-mc-linux64( 0/ 8), 496.914: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 496.914:
pins2lts-mc-linux64( 0/ 8), 496.914: Queue width: 8B, total height: 1364, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 496.914: Tree memory: 616.9MB, 13.7 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 496.914: Tree fill ratio (roots/leafs): 35.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 496.914: Stored 390 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 496.914: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 496.914: Est. total memory use: 617.0MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14395157606013024745;'/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' '[]((<>([]((<>((LTLAPp3==true))||(LTLAPp2==true))))&&(<>((LTLAPp3==true))||X(<>((LTLAPp4==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14395157606013024745;'/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' '[]((<>([]((<>((LTLAPp3==true))||(LTLAPp2==true))))&&(<>((LTLAPp3==true))||X(<>((LTLAPp4==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t116, t256, t306, t307, t339, u36.t79, u10.t217, u10.t218, u10.t219, u10.t220, u10.t...1206
Computing Next relation with stutter on 2.99194e+08 deadlock states
Detected timeout of ITS tools.
[2024-05-22 01:18:46] [INFO ] Applying decomposition
[2024-05-22 01:18:46] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:18:46] [INFO ] Decomposing Gal with order
[2024-05-22 01:18:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:18:46] [INFO ] Removed a total of 166 redundant transitions.
[2024-05-22 01:18:46] [INFO ] Flatten gal took : 37 ms
[2024-05-22 01:18:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 561 labels/synchronizations in 12 ms.
[2024-05-22 01:18:46] [INFO ] Time to serialize gal into /tmp/LTLFireability16018174022119171206.gal : 4 ms
[2024-05-22 01:18:46] [INFO ] Time to serialize properties into /tmp/LTLFireability8527178501765216372.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/LTLFireability16018174022119171206.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8527178501765216372.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 6 LTL properties
Checking formula 0 : !((((X(!("((i0.i0.i0.u5.p85==1)&&(i1.i1.i1.u118.p431==1))")))U(((X(!("((i0.i0.i0.u5.p85==1)&&(i1.i1.i1.u118.p431==1))")))&&(G((!("((i0...1013
Formula 0 simplified : "((i0.u7.p158==1)&&(i1.i0.i0.i0.i0.i0.u17.p189==1))" U (X"((i0.i0.i0.u5.p85==1)&&(i1.i1.i1.u118.p431==1))" R (XF"((i0.i0.i0.u5.p85==...352
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5644172 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16037872 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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="DES-PT-40b"
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 DES-PT-40b, 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 r109-tall-171624208600453"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40b.tgz
mv DES-PT-40b 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 ;