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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 12 08:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 08:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 08:27 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 139K 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-60b-LTLFireability-00
FORMULA_NAME DES-PT-60b-LTLFireability-01
FORMULA_NAME DES-PT-60b-LTLFireability-02
FORMULA_NAME DES-PT-60b-LTLFireability-03
FORMULA_NAME DES-PT-60b-LTLFireability-04
FORMULA_NAME DES-PT-60b-LTLFireability-05
FORMULA_NAME DES-PT-60b-LTLFireability-06
FORMULA_NAME DES-PT-60b-LTLFireability-07
FORMULA_NAME DES-PT-60b-LTLFireability-08
FORMULA_NAME DES-PT-60b-LTLFireability-09
FORMULA_NAME DES-PT-60b-LTLFireability-10
FORMULA_NAME DES-PT-60b-LTLFireability-11
FORMULA_NAME DES-PT-60b-LTLFireability-12
FORMULA_NAME DES-PT-60b-LTLFireability-13
FORMULA_NAME DES-PT-60b-LTLFireability-14
FORMULA_NAME DES-PT-60b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716342465904

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-60b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 01:47:47] [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 01:47:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 01:47:47] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-05-22 01:47:47] [INFO ] Transformed 519 places.
[2024-05-22 01:47:47] [INFO ] Transformed 470 transitions.
[2024-05-22 01:47:47] [INFO ] Found NUPN structural information;
[2024-05-22 01:47:47] [INFO ] Parsed PT model containing 519 places and 470 transitions and 1623 arcs in 140 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 4 formulas.
FORMULA DES-PT-60b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 519 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 519/519 places, 470/470 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 516 transition count 470
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 27 place count 492 transition count 446
Iterating global reduction 1 with 24 rules applied. Total rules applied 51 place count 492 transition count 446
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 65 place count 478 transition count 432
Iterating global reduction 1 with 14 rules applied. Total rules applied 79 place count 478 transition count 432
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 89 place count 478 transition count 422
Applied a total of 89 rules in 101 ms. Remains 478 /519 variables (removed 41) and now considering 422/470 (removed 48) transitions.
// Phase 1: matrix 422 rows 478 cols
[2024-05-22 01:47:47] [INFO ] Computed 62 invariants in 50 ms
[2024-05-22 01:47:48] [INFO ] Implicit Places using invariants in 576 ms returned []
[2024-05-22 01:47:48] [INFO ] Invariant cache hit.
[2024-05-22 01:47:48] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 1193 ms to find 0 implicit places.
[2024-05-22 01:47:48] [INFO ] Invariant cache hit.
[2024-05-22 01:47:49] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 478/519 places, 422/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1507 ms. Remains : 478/519 places, 422/470 transitions.
Support contains 35 out of 478 places after structural reductions.
[2024-05-22 01:47:49] [INFO ] Flatten gal took : 58 ms
[2024-05-22 01:47:49] [INFO ] Flatten gal took : 29 ms
[2024-05-22 01:47:49] [INFO ] Input system was already deterministic with 422 transitions.
Incomplete random walk after 10000 steps, including 85 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 24) seen :13
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2024-05-22 01:47:50] [INFO ] Invariant cache hit.
[2024-05-22 01:47:50] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2024-05-22 01:47:50] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 38 ms returned sat
[2024-05-22 01:47:50] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-22 01:47:50] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-22 01:47:50] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 44 ms returned sat
[2024-05-22 01:47:52] [INFO ] After 1648ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-22 01:47:52] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 4 ms to minimize.
[2024-05-22 01:47:53] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 1 ms to minimize.
[2024-05-22 01:47:53] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2024-05-22 01:47:53] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-05-22 01:47:53] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2024-05-22 01:47:53] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2024-05-22 01:47:53] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-05-22 01:47:53] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 0 ms to minimize.
[2024-05-22 01:47:53] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1052 ms
[2024-05-22 01:47:54] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 0 ms to minimize.
[2024-05-22 01:47:54] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-22 01:47:54] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2024-05-22 01:47:54] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-22 01:47:54] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2024-05-22 01:47:54] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2024-05-22 01:47:54] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2024-05-22 01:47:54] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 1 ms to minimize.
[2024-05-22 01:47:54] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 01:47:54] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 0 ms to minimize.
[2024-05-22 01:47:54] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-22 01:47:54] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1080 ms
[2024-05-22 01:47:55] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 0 ms to minimize.
[2024-05-22 01:47:55] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 0 ms to minimize.
[2024-05-22 01:47:55] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 1 ms to minimize.
[2024-05-22 01:47:56] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 0 ms to minimize.
[2024-05-22 01:47:56] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-22 01:47:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 543 ms
[2024-05-22 01:47:56] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 0 ms to minimize.
[2024-05-22 01:47:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2024-05-22 01:47:56] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2024-05-22 01:47:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2024-05-22 01:47:56] [INFO ] After 5811ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1393 ms.
[2024-05-22 01:47:58] [INFO ] After 7542ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 1527 ms.
Support contains 19 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 422/422 transitions.
Graph (complete) has 1139 edges and 478 vertex of which 472 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 472 transition count 405
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 27 place count 460 transition count 405
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 460 transition count 394
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 49 place count 449 transition count 394
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 446 transition count 391
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 446 transition count 391
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 58 place count 446 transition count 388
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 445 transition count 387
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 60 place count 445 transition count 386
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 62 place count 444 transition count 386
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 443 transition count 385
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 443 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 66 place count 443 transition count 383
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 67 place count 442 transition count 383
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 6 with 146 rules applied. Total rules applied 213 place count 369 transition count 310
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 6 with 4 rules applied. Total rules applied 217 place count 367 transition count 312
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 218 place count 367 transition count 311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 219 place count 366 transition count 311
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 220 place count 365 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 221 place count 364 transition count 310
Applied a total of 221 rules in 174 ms. Remains 364 /478 variables (removed 114) and now considering 310/422 (removed 112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 364/478 places, 310/422 transitions.
Incomplete random walk after 10000 steps, including 390 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 83 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 94 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 77 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 72 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 646141 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 646141 steps, saw 98804 distinct states, run finished after 3002 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 310 rows 364 cols
[2024-05-22 01:48:03] [INFO ] Computed 60 invariants in 11 ms
[2024-05-22 01:48:03] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 01:48:03] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:48:03] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-22 01:48:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:48:04] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 106 ms returned sat
[2024-05-22 01:48:05] [INFO ] After 844ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-22 01:48:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:48:05] [INFO ] After 464ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2024-05-22 01:48:05] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 0 ms to minimize.
[2024-05-22 01:48:06] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-22 01:48:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 180 ms
[2024-05-22 01:48:06] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-22 01:48:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2024-05-22 01:48:06] [INFO ] After 1465ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 539 ms.
[2024-05-22 01:48:07] [INFO ] After 3200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 545 ms.
Support contains 19 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 310/310 transitions.
Applied a total of 0 rules in 16 ms. Remains 364 /364 variables (removed 0) and now considering 310/310 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 364/364 places, 310/310 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 310/310 transitions.
Applied a total of 0 rules in 13 ms. Remains 364 /364 variables (removed 0) and now considering 310/310 (removed 0) transitions.
[2024-05-22 01:48:07] [INFO ] Invariant cache hit.
[2024-05-22 01:48:07] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-22 01:48:07] [INFO ] Invariant cache hit.
[2024-05-22 01:48:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:48:08] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2024-05-22 01:48:08] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-22 01:48:08] [INFO ] Invariant cache hit.
[2024-05-22 01:48:08] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 732 ms. Remains : 364/364 places, 310/310 transitions.
Applied a total of 0 rules in 11 ms. Remains 364 /364 variables (removed 0) and now considering 310/310 (removed 0) transitions.
Running SMT prover for 11 properties.
[2024-05-22 01:48:08] [INFO ] Invariant cache hit.
[2024-05-22 01:48:08] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:48:08] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-22 01:48:08] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-22 01:48:08] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 01:48:08] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 143 ms returned sat
[2024-05-22 01:48:10] [INFO ] After 967ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-22 01:48:10] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-22 01:48:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2024-05-22 01:48:10] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-22 01:48:10] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 3 ms to minimize.
[2024-05-22 01:48:11] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-22 01:48:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 349 ms
[2024-05-22 01:48:11] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2024-05-22 01:48:11] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2024-05-22 01:48:11] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-05-22 01:48:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 360 ms
[2024-05-22 01:48:11] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-22 01:48:11] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2024-05-22 01:48:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 251 ms
[2024-05-22 01:48:12] [INFO ] After 2870ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 733 ms.
[2024-05-22 01:48:12] [INFO ] After 4214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Computed a total of 296 stabilizing places and 288 stable transitions
Graph (complete) has 1139 edges and 478 vertex of which 472 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.18 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(X(F(p0)))||G(p1))))'
Support contains 2 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 422/422 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 475 transition count 419
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 475 transition count 419
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 475 transition count 417
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 473 transition count 415
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 473 transition count 415
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 473 transition count 413
Applied a total of 14 rules in 20 ms. Remains 473 /478 variables (removed 5) and now considering 413/422 (removed 9) transitions.
// Phase 1: matrix 413 rows 473 cols
[2024-05-22 01:48:13] [INFO ] Computed 62 invariants in 12 ms
[2024-05-22 01:48:13] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-22 01:48:13] [INFO ] Invariant cache hit.
[2024-05-22 01:48:13] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 814 ms to find 0 implicit places.
[2024-05-22 01:48:13] [INFO ] Invariant cache hit.
[2024-05-22 01:48:14] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/478 places, 413/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1049 ms. Remains : 473/478 places, 413/422 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 324 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-60b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(EQ s272 0), p1:(OR (NEQ s312 1) (NEQ s272 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 364 ms.
Product exploration explored 100000 steps with 25000 reset in 254 ms.
Computed a total of 296 stabilizing places and 288 stable transitions
Graph (complete) has 1126 edges and 473 vertex of which 467 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.11 ms
Computed a total of 296 stabilizing places and 288 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 73 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1828 steps, including 16 resets, run visited all 3 properties in 7 ms. (steps per millisecond=261 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 473 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 473/473 places, 413/413 transitions.
Applied a total of 0 rules in 11 ms. Remains 473 /473 variables (removed 0) and now considering 413/413 (removed 0) transitions.
[2024-05-22 01:48:15] [INFO ] Invariant cache hit.
[2024-05-22 01:48:15] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-22 01:48:15] [INFO ] Invariant cache hit.
[2024-05-22 01:48:16] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 818 ms to find 0 implicit places.
[2024-05-22 01:48:16] [INFO ] Invariant cache hit.
[2024-05-22 01:48:16] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1023 ms. Remains : 473/473 places, 413/413 transitions.
Computed a total of 296 stabilizing places and 288 stable transitions
Graph (complete) has 1126 edges and 473 vertex of which 467 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.8 ms
Computed a total of 296 stabilizing places and 288 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1186 steps, including 12 resets, run visited all 3 properties in 7 ms. (steps per millisecond=169 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 198 ms.
Product exploration explored 100000 steps with 25000 reset in 279 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 473 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 473/473 places, 413/413 transitions.
Graph (complete) has 1126 edges and 473 vertex of which 467 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
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 467 transition count 410
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 16 place count 467 transition count 412
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 23 place count 467 transition count 412
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 462 transition count 407
Deduced a syphon composed of 17 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 462 transition count 407
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 462 transition count 410
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 117 place count 453 transition count 401
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 126 place count 453 transition count 401
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 89 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 132 place count 453 transition count 427
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 451 transition count 421
Deduced a syphon composed of 87 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 451 transition count 421
Deduced a syphon composed of 87 places in 0 ms
Applied a total of 136 rules in 138 ms. Remains 451 /473 variables (removed 22) and now considering 421/413 (removed -8) transitions.
[2024-05-22 01:48:18] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 421 rows 451 cols
[2024-05-22 01:48:18] [INFO ] Computed 59 invariants in 6 ms
[2024-05-22 01:48:19] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 451/473 places, 421/413 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 381 ms. Remains : 451/473 places, 421/413 transitions.
Built C files in :
/tmp/ltsmin9222187938519959755
[2024-05-22 01:48:19] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9222187938519959755
Running compilation step : cd /tmp/ltsmin9222187938519959755;'/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 725 ms.
Running link step : cd /tmp/ltsmin9222187938519959755;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin9222187938519959755;'/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/stateBased5663447282885047991.hoa' '--buchi-type=spotba'
LTSmin run took 172 ms.
FORMULA DES-PT-60b-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-60b-LTLFireability-00 finished in 7222 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(X((X(X((X(p1)||p0))) U p2)))))'
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 422/422 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 476 transition count 420
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 476 transition count 420
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 476 transition count 419
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 475 transition count 418
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 475 transition count 418
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 475 transition count 417
Applied a total of 8 rules in 29 ms. Remains 475 /478 variables (removed 3) and now considering 417/422 (removed 5) transitions.
// Phase 1: matrix 417 rows 475 cols
[2024-05-22 01:48:20] [INFO ] Computed 62 invariants in 15 ms
[2024-05-22 01:48:20] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-22 01:48:20] [INFO ] Invariant cache hit.
[2024-05-22 01:48:20] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
[2024-05-22 01:48:20] [INFO ] Invariant cache hit.
[2024-05-22 01:48:21] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 475/478 places, 417/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 963 ms. Remains : 475/478 places, 417/422 transitions.
Stuttering acceptance computed with spot in 340 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : DES-PT-60b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(AND (EQ s265 1) (EQ s322 1)), p0:(OR (AND (EQ s19 1) (EQ s331 1)) (AND (EQ s265 1) (EQ s322 1))), p1:(AND (EQ s19 1) (EQ s331 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA DES-PT-60b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-01 finished in 1323 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 (G(!p0)||(!p0&&(!p1 U (p2||G(!p1)))))))))'
Support contains 8 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 422/422 transitions.
Graph (complete) has 1139 edges and 478 vertex of which 472 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 471 transition count 406
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 459 transition count 406
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 459 transition count 395
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 448 transition count 395
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 445 transition count 392
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 445 transition count 392
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 445 transition count 389
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 444 transition count 388
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 58 place count 444 transition count 387
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 443 transition count 387
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 442 transition count 386
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 442 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 63 place count 442 transition count 385
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 63 place count 442 transition count 384
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 65 place count 441 transition count 384
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 5 with 144 rules applied. Total rules applied 209 place count 369 transition count 312
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 5 with 4 rules applied. Total rules applied 213 place count 367 transition count 314
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 215 place count 365 transition count 312
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 216 place count 364 transition count 312
Applied a total of 216 rules in 84 ms. Remains 364 /478 variables (removed 114) and now considering 312/422 (removed 110) transitions.
// Phase 1: matrix 312 rows 364 cols
[2024-05-22 01:48:21] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 01:48:21] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-22 01:48:21] [INFO ] Invariant cache hit.
[2024-05-22 01:48:22] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2024-05-22 01:48:22] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:48:22] [INFO ] Invariant cache hit.
[2024-05-22 01:48:22] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 364/478 places, 312/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 760 ms. Remains : 364/478 places, 312/422 transitions.
Stuttering acceptance computed with spot in 196 ms :[p0, p0, (AND (NOT p2) p1 p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NOT (AND (EQ s170 1) (EQ s273 1))) (NOT (OR (AND (EQ s33 1) (EQ s277 1)) (AND (EQ s66 1) (EQ s359 1))))), p1:(OR (AND (EQ s33 1) (EQ s277 1)) (AN...], nbAcceptance=2, 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 4709 reset in 279 ms.
Product exploration explored 100000 steps with 4682 reset in 366 ms.
Computed a total of 259 stabilizing places and 254 stable transitions
Computed a total of 259 stabilizing places and 254 stable transitions
Detected a total of 259/364 stabilizing places and 254/312 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 243 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[p0, p0, (AND (NOT p2) p1 p0)]
Incomplete random walk after 10000 steps, including 464 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-22 01:48:23] [INFO ] Invariant cache hit.
[2024-05-22 01:48:23] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:48:23] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 01:48:23] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 01:48:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:48:24] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 121 ms returned sat
[2024-05-22 01:48:25] [INFO ] After 945ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 01:48:25] [INFO ] After 1434ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 404 ms.
[2024-05-22 01:48:26] [INFO ] After 2123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 87 ms.
Support contains 8 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 312/312 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 364 transition count 311
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 364 transition count 309
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 362 transition count 309
Applied a total of 5 rules in 18 ms. Remains 362 /364 variables (removed 2) and now considering 309/312 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 362/364 places, 309/312 transitions.
Incomplete random walk after 10000 steps, including 440 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 96 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 906846 steps, run timeout after 3001 ms. (steps per millisecond=302 ) properties seen :{}
Probabilistic random walk after 906846 steps, saw 117121 distinct states, run finished after 3001 ms. (steps per millisecond=302 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 309 rows 362 cols
[2024-05-22 01:48:29] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 01:48:29] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:48:29] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:48:29] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 01:48:29] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:48:29] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 88 ms returned sat
[2024-05-22 01:48:30] [INFO ] After 940ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 01:48:31] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-05-22 01:48:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2024-05-22 01:48:31] [INFO ] After 1629ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 418 ms.
[2024-05-22 01:48:31] [INFO ] After 2373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 105 ms.
Support contains 8 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 309/309 transitions.
Applied a total of 0 rules in 8 ms. Remains 362 /362 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 362/362 places, 309/309 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 309/309 transitions.
Applied a total of 0 rules in 7 ms. Remains 362 /362 variables (removed 0) and now considering 309/309 (removed 0) transitions.
[2024-05-22 01:48:32] [INFO ] Invariant cache hit.
[2024-05-22 01:48:32] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-22 01:48:32] [INFO ] Invariant cache hit.
[2024-05-22 01:48:32] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2024-05-22 01:48:32] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:48:32] [INFO ] Invariant cache hit.
[2024-05-22 01:48:32] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 710 ms. Remains : 362/362 places, 309/309 transitions.
Applied a total of 0 rules in 7 ms. Remains 362 /362 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-22 01:48:32] [INFO ] Invariant cache hit.
[2024-05-22 01:48:32] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:48:32] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-22 01:48:32] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 01:48:32] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:48:33] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 208 ms returned sat
[2024-05-22 01:48:34] [INFO ] After 1174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 01:48:34] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-22 01:48:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2024-05-22 01:48:34] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-22 01:48:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2024-05-22 01:48:35] [INFO ] After 2068ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 497 ms.
[2024-05-22 01:48:35] [INFO ] After 2970ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (OR (AND (NOT p2) p1) p0)), (F p0)]
Knowledge based reduction with 11 factoid took 358 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[p0, p0, (AND (NOT p2) p1 p0)]
Stuttering acceptance computed with spot in 138 ms :[p0, p0, (AND (NOT p2) p1 p0)]
Support contains 8 out of 364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 364/364 places, 312/312 transitions.
Applied a total of 0 rules in 15 ms. Remains 364 /364 variables (removed 0) and now considering 312/312 (removed 0) transitions.
// Phase 1: matrix 312 rows 364 cols
[2024-05-22 01:48:36] [INFO ] Computed 58 invariants in 7 ms
[2024-05-22 01:48:36] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-22 01:48:36] [INFO ] Invariant cache hit.
[2024-05-22 01:48:36] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2024-05-22 01:48:36] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:48:36] [INFO ] Invariant cache hit.
[2024-05-22 01:48:37] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 674 ms. Remains : 364/364 places, 312/312 transitions.
Computed a total of 259 stabilizing places and 254 stable transitions
Computed a total of 259 stabilizing places and 254 stable transitions
Detected a total of 259/364 stabilizing places and 254/312 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 247 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[p0, p0, (AND (NOT p2) p1 p0)]
Incomplete random walk after 10000 steps, including 464 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 99 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-22 01:48:37] [INFO ] Invariant cache hit.
[2024-05-22 01:48:37] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:48:37] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 01:48:37] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 01:48:38] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:48:38] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 120 ms returned sat
[2024-05-22 01:48:39] [INFO ] After 944ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 01:48:39] [INFO ] After 1440ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 408 ms.
[2024-05-22 01:48:40] [INFO ] After 2145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 87 ms.
Support contains 8 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 312/312 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 364 transition count 311
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 364 transition count 309
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 362 transition count 309
Applied a total of 5 rules in 21 ms. Remains 362 /364 variables (removed 2) and now considering 309/312 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 362/364 places, 309/312 transitions.
Incomplete random walk after 10000 steps, including 430 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 909678 steps, run timeout after 3001 ms. (steps per millisecond=303 ) properties seen :{}
Probabilistic random walk after 909678 steps, saw 117473 distinct states, run finished after 3001 ms. (steps per millisecond=303 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 309 rows 362 cols
[2024-05-22 01:48:43] [INFO ] Computed 59 invariants in 7 ms
[2024-05-22 01:48:43] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:48:43] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:48:43] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 01:48:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:48:43] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 80 ms returned sat
[2024-05-22 01:48:44] [INFO ] After 935ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 01:48:45] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-05-22 01:48:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2024-05-22 01:48:45] [INFO ] After 1612ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 396 ms.
[2024-05-22 01:48:46] [INFO ] After 2339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 182 ms.
Support contains 8 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 309/309 transitions.
Applied a total of 0 rules in 12 ms. Remains 362 /362 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 362/362 places, 309/309 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 309/309 transitions.
Applied a total of 0 rules in 21 ms. Remains 362 /362 variables (removed 0) and now considering 309/309 (removed 0) transitions.
[2024-05-22 01:48:46] [INFO ] Invariant cache hit.
[2024-05-22 01:48:46] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-22 01:48:46] [INFO ] Invariant cache hit.
[2024-05-22 01:48:46] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2024-05-22 01:48:46] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:48:46] [INFO ] Invariant cache hit.
[2024-05-22 01:48:46] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 711 ms. Remains : 362/362 places, 309/309 transitions.
Applied a total of 0 rules in 6 ms. Remains 362 /362 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-22 01:48:46] [INFO ] Invariant cache hit.
[2024-05-22 01:48:47] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:48:47] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-22 01:48:47] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 01:48:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:48:47] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 209 ms returned sat
[2024-05-22 01:48:48] [INFO ] After 1178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 01:48:48] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-05-22 01:48:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2024-05-22 01:48:49] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-22 01:48:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2024-05-22 01:48:49] [INFO ] After 2087ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 490 ms.
[2024-05-22 01:48:50] [INFO ] After 2971ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (OR (AND (NOT p2) p1) p0)), (F p0)]
Knowledge based reduction with 11 factoid took 352 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[p0, p0, (AND (NOT p2) p1 p0)]
Stuttering acceptance computed with spot in 114 ms :[p0, p0, (AND (NOT p2) p1 p0)]
Stuttering acceptance computed with spot in 133 ms :[p0, p0, (AND (NOT p2) p1 p0)]
Product exploration explored 100000 steps with 4663 reset in 251 ms.
Product exploration explored 100000 steps with 4697 reset in 260 ms.
Built C files in :
/tmp/ltsmin3084334587467420739
[2024-05-22 01:48:51] [INFO ] Computing symmetric may disable matrix : 312 transitions.
[2024-05-22 01:48:51] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:48:51] [INFO ] Computing symmetric may enable matrix : 312 transitions.
[2024-05-22 01:48:51] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:48:51] [INFO ] Computing Do-Not-Accords matrix : 312 transitions.
[2024-05-22 01:48:51] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:48:51] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3084334587467420739
Running compilation step : cd /tmp/ltsmin3084334587467420739;'/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 653 ms.
Running link step : cd /tmp/ltsmin3084334587467420739;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3084334587467420739;'/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/stateBased5519649183187403201.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 364/364 places, 312/312 transitions.
Applied a total of 0 rules in 12 ms. Remains 364 /364 variables (removed 0) and now considering 312/312 (removed 0) transitions.
// Phase 1: matrix 312 rows 364 cols
[2024-05-22 01:49:06] [INFO ] Computed 58 invariants in 7 ms
[2024-05-22 01:49:06] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-22 01:49:06] [INFO ] Invariant cache hit.
[2024-05-22 01:49:06] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2024-05-22 01:49:06] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:49:06] [INFO ] Invariant cache hit.
[2024-05-22 01:49:07] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 684 ms. Remains : 364/364 places, 312/312 transitions.
Built C files in :
/tmp/ltsmin152886752870445405
[2024-05-22 01:49:07] [INFO ] Computing symmetric may disable matrix : 312 transitions.
[2024-05-22 01:49:07] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:49:07] [INFO ] Computing symmetric may enable matrix : 312 transitions.
[2024-05-22 01:49:07] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:49:07] [INFO ] Computing Do-Not-Accords matrix : 312 transitions.
[2024-05-22 01:49:07] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:49:07] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin152886752870445405
Running compilation step : cd /tmp/ltsmin152886752870445405;'/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 660 ms.
Running link step : cd /tmp/ltsmin152886752870445405;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin152886752870445405;'/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/stateBased10536554179114063726.hoa' '--buchi-type=spotba'
LTSmin run took 12158 ms.
FORMULA DES-PT-60b-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-60b-LTLFireability-03 finished in 58554 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)))'
Support contains 7 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 422/422 transitions.
Graph (complete) has 1139 edges and 478 vertex of which 472 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 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 471 transition count 406
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 459 transition count 406
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 459 transition count 395
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 448 transition count 395
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 445 transition count 392
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 445 transition count 392
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 445 transition count 389
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 444 transition count 388
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 58 place count 444 transition count 387
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 443 transition count 387
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 442 transition count 386
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 442 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 63 place count 442 transition count 385
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 63 place count 442 transition count 384
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 65 place count 441 transition count 384
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 5 with 150 rules applied. Total rules applied 215 place count 366 transition count 309
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 5 with 4 rules applied. Total rules applied 219 place count 364 transition count 311
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 362 transition count 309
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 222 place count 361 transition count 309
Applied a total of 222 rules in 60 ms. Remains 361 /478 variables (removed 117) and now considering 309/422 (removed 113) transitions.
// Phase 1: matrix 309 rows 361 cols
[2024-05-22 01:49:20] [INFO ] Computed 58 invariants in 6 ms
[2024-05-22 01:49:20] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-22 01:49:20] [INFO ] Invariant cache hit.
[2024-05-22 01:49:20] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:49:20] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2024-05-22 01:49:20] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:49:20] [INFO ] Invariant cache hit.
[2024-05-22 01:49:20] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 361/478 places, 309/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 850 ms. Remains : 361/478 places, 309/422 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s213 1) (EQ s244 1)) (AND (OR (EQ s81 0) (EQ s356 0)) (OR (EQ s51 0) (EQ s274 0)) (OR (EQ s98 0) (EQ s356 0))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4671 reset in 273 ms.
Product exploration explored 100000 steps with 4671 reset in 280 ms.
Computed a total of 257 stabilizing places and 252 stable transitions
Computed a total of 257 stabilizing places and 252 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 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 71 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 475 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1360111 steps, run timeout after 3001 ms. (steps per millisecond=453 ) properties seen :{}
Probabilistic random walk after 1360111 steps, saw 194193 distinct states, run finished after 3002 ms. (steps per millisecond=453 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:49:24] [INFO ] Invariant cache hit.
[2024-05-22 01:49:24] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:49:24] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:49:24] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 126 ms returned sat
[2024-05-22 01:49:25] [INFO ] After 352ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:49:25] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:49:25] [INFO ] After 112ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:49:25] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 107 ms.
[2024-05-22 01:49:25] [INFO ] After 858ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 7 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 309/309 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 361 transition count 308
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 361 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 360 transition count 307
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 360 transition count 307
Applied a total of 4 rules in 25 ms. Remains 360 /361 variables (removed 1) and now considering 307/309 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 360/361 places, 307/309 transitions.
Incomplete random walk after 10000 steps, including 449 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 82 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1389379 steps, run timeout after 3001 ms. (steps per millisecond=462 ) properties seen :{}
Probabilistic random walk after 1389379 steps, saw 191679 distinct states, run finished after 3001 ms. (steps per millisecond=462 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 307 rows 360 cols
[2024-05-22 01:49:28] [INFO ] Computed 59 invariants in 19 ms
[2024-05-22 01:49:28] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:49:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:49:28] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 18 ms returned sat
[2024-05-22 01:49:29] [INFO ] After 661ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:49:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:49:29] [INFO ] After 207ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:49:29] [INFO ] After 305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 105 ms.
[2024-05-22 01:49:29] [INFO ] After 1158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 7 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 307/307 transitions.
Applied a total of 0 rules in 6 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 360/360 places, 307/307 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 307/307 transitions.
Applied a total of 0 rules in 6 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2024-05-22 01:49:30] [INFO ] Invariant cache hit.
[2024-05-22 01:49:30] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-22 01:49:30] [INFO ] Invariant cache hit.
[2024-05-22 01:49:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:49:30] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
[2024-05-22 01:49:30] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:49:30] [INFO ] Invariant cache hit.
[2024-05-22 01:49:30] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 816 ms. Remains : 360/360 places, 307/307 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 360 transition count 307
Applied a total of 1 rules in 13 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 307 rows 360 cols
[2024-05-22 01:49:30] [INFO ] Computed 59 invariants in 5 ms
[2024-05-22 01:49:30] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:49:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:49:30] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 17 ms returned sat
[2024-05-22 01:49:31] [INFO ] After 506ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:49:31] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-05-22 01:49:31] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 0 ms to minimize.
[2024-05-22 01:49:31] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 0 ms to minimize.
[2024-05-22 01:49:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 317 ms
[2024-05-22 01:49:31] [INFO ] After 955ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 141 ms.
[2024-05-22 01:49:32] [INFO ] After 1175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 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 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Support contains 7 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 309/309 transitions.
Applied a total of 0 rules in 15 ms. Remains 361 /361 variables (removed 0) and now considering 309/309 (removed 0) transitions.
// Phase 1: matrix 309 rows 361 cols
[2024-05-22 01:49:32] [INFO ] Computed 58 invariants in 10 ms
[2024-05-22 01:49:32] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-22 01:49:32] [INFO ] Invariant cache hit.
[2024-05-22 01:49:32] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:49:32] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
[2024-05-22 01:49:32] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:49:32] [INFO ] Invariant cache hit.
[2024-05-22 01:49:33] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 812 ms. Remains : 361/361 places, 309/309 transitions.
Computed a total of 257 stabilizing places and 252 stable transitions
Computed a total of 257 stabilizing places and 252 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 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 58 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 455 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 98 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1367670 steps, run timeout after 3001 ms. (steps per millisecond=455 ) properties seen :{}
Probabilistic random walk after 1367670 steps, saw 195752 distinct states, run finished after 3001 ms. (steps per millisecond=455 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:49:36] [INFO ] Invariant cache hit.
[2024-05-22 01:49:36] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:49:36] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:49:36] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 117 ms returned sat
[2024-05-22 01:49:36] [INFO ] After 358ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:49:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:49:37] [INFO ] After 111ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:49:37] [INFO ] After 198ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 102 ms.
[2024-05-22 01:49:37] [INFO ] After 836ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 7 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 309/309 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 361 transition count 308
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 361 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 360 transition count 307
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 360 transition count 307
Applied a total of 4 rules in 31 ms. Remains 360 /361 variables (removed 1) and now considering 307/309 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 360/361 places, 307/309 transitions.
Incomplete random walk after 10000 steps, including 479 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1397406 steps, run timeout after 3001 ms. (steps per millisecond=465 ) properties seen :{}
Probabilistic random walk after 1397406 steps, saw 192775 distinct states, run finished after 3001 ms. (steps per millisecond=465 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 307 rows 360 cols
[2024-05-22 01:49:40] [INFO ] Computed 59 invariants in 10 ms
[2024-05-22 01:49:40] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:49:40] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:49:40] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 17 ms returned sat
[2024-05-22 01:49:41] [INFO ] After 663ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:49:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:49:41] [INFO ] After 210ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:49:41] [INFO ] After 308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 105 ms.
[2024-05-22 01:49:41] [INFO ] After 1157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 7 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 307/307 transitions.
Applied a total of 0 rules in 5 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 360/360 places, 307/307 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 307/307 transitions.
Applied a total of 0 rules in 5 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2024-05-22 01:49:41] [INFO ] Invariant cache hit.
[2024-05-22 01:49:41] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-22 01:49:41] [INFO ] Invariant cache hit.
[2024-05-22 01:49:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:49:42] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2024-05-22 01:49:42] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:49:42] [INFO ] Invariant cache hit.
[2024-05-22 01:49:42] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 789 ms. Remains : 360/360 places, 307/307 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 360 transition count 307
Applied a total of 1 rules in 10 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 307 rows 360 cols
[2024-05-22 01:49:42] [INFO ] Computed 59 invariants in 6 ms
[2024-05-22 01:49:42] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:49:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:49:42] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 17 ms returned sat
[2024-05-22 01:49:42] [INFO ] After 503ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:49:43] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2024-05-22 01:49:43] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-05-22 01:49:43] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 ms to minimize.
[2024-05-22 01:49:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 317 ms
[2024-05-22 01:49:43] [INFO ] After 957ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 138 ms.
[2024-05-22 01:49:43] [INFO ] After 1168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 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 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4725 reset in 230 ms.
Product exploration explored 100000 steps with 4655 reset in 248 ms.
Built C files in :
/tmp/ltsmin432166740997832590
[2024-05-22 01:49:44] [INFO ] Computing symmetric may disable matrix : 309 transitions.
[2024-05-22 01:49:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:49:44] [INFO ] Computing symmetric may enable matrix : 309 transitions.
[2024-05-22 01:49:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:49:44] [INFO ] Computing Do-Not-Accords matrix : 309 transitions.
[2024-05-22 01:49:44] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:49:44] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin432166740997832590
Running compilation step : cd /tmp/ltsmin432166740997832590;'/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 733 ms.
Running link step : cd /tmp/ltsmin432166740997832590;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin432166740997832590;'/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/stateBased710639673637512331.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 309/309 transitions.
Applied a total of 0 rules in 6 ms. Remains 361 /361 variables (removed 0) and now considering 309/309 (removed 0) transitions.
// Phase 1: matrix 309 rows 361 cols
[2024-05-22 01:49:59] [INFO ] Computed 58 invariants in 11 ms
[2024-05-22 01:49:59] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-22 01:49:59] [INFO ] Invariant cache hit.
[2024-05-22 01:49:59] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:50:00] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
[2024-05-22 01:50:00] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:50:00] [INFO ] Invariant cache hit.
[2024-05-22 01:50:00] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 812 ms. Remains : 361/361 places, 309/309 transitions.
Built C files in :
/tmp/ltsmin7378201471242224579
[2024-05-22 01:50:00] [INFO ] Computing symmetric may disable matrix : 309 transitions.
[2024-05-22 01:50:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:50:00] [INFO ] Computing symmetric may enable matrix : 309 transitions.
[2024-05-22 01:50:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:50:00] [INFO ] Computing Do-Not-Accords matrix : 309 transitions.
[2024-05-22 01:50:00] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:50:00] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7378201471242224579
Running compilation step : cd /tmp/ltsmin7378201471242224579;'/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 645 ms.
Running link step : cd /tmp/ltsmin7378201471242224579;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7378201471242224579;'/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/stateBased538286214864370579.hoa' '--buchi-type=spotba'
LTSmin run took 12201 ms.
FORMULA DES-PT-60b-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-60b-LTLFireability-04 finished in 53177 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||X((p1||G((F(p0)&&F((G(p2)||G(p0))))))))))'
Support contains 6 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 422/422 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 475 transition count 419
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 475 transition count 419
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 475 transition count 417
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 473 transition count 415
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 473 transition count 415
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 473 transition count 413
Applied a total of 14 rules in 27 ms. Remains 473 /478 variables (removed 5) and now considering 413/422 (removed 9) transitions.
// Phase 1: matrix 413 rows 473 cols
[2024-05-22 01:50:13] [INFO ] Computed 62 invariants in 12 ms
[2024-05-22 01:50:13] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-22 01:50:13] [INFO ] Invariant cache hit.
[2024-05-22 01:50:14] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
[2024-05-22 01:50:14] [INFO ] Invariant cache hit.
[2024-05-22 01:50:14] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/478 places, 413/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 986 ms. Remains : 473/478 places, 413/422 transitions.
Stuttering acceptance computed with spot in 264 ms :[false, false, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (NEQ s62 1) (NEQ s329 1)), p1:(AND (EQ s182 1) (EQ s322 1)), p2:(OR (NEQ s196 1) (NEQ s262 1))], nbAcceptance=2, 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 880 reset in 185 ms.
Product exploration explored 100000 steps with 884 reset in 202 ms.
Computed a total of 296 stabilizing places and 288 stable transitions
Graph (complete) has 1126 edges and 473 vertex of which 467 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Computed a total of 296 stabilizing places and 288 stable transitions
Detected a total of 296/473 stabilizing places and 288/413 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 154 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 649034 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 649034 steps, saw 108801 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-22 01:50:18] [INFO ] Invariant cache hit.
[2024-05-22 01:50:18] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-22 01:50:18] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 37 ms returned sat
[2024-05-22 01:50:18] [INFO ] After 399ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2024-05-22 01:50:18] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-22 01:50:19] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 36 ms returned sat
[2024-05-22 01:50:19] [INFO ] After 646ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2024-05-22 01:50:19] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-22 01:50:19] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-22 01:50:19] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-22 01:50:20] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-22 01:50:20] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 01:50:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 433 ms
[2024-05-22 01:50:20] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-22 01:50:20] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-22 01:50:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
[2024-05-22 01:50:20] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-22 01:50:20] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-05-22 01:50:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
[2024-05-22 01:50:21] [INFO ] After 1980ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 326 ms.
[2024-05-22 01:50:21] [INFO ] After 2476ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 283 ms.
Support contains 4 out of 473 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 473/473 places, 413/413 transitions.
Graph (complete) has 1126 edges and 473 vertex of which 467 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 467 transition count 392
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 451 transition count 392
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 35 place count 451 transition count 381
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 57 place count 440 transition count 381
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 209 place count 364 transition count 305
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 213 place count 362 transition count 307
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 214 place count 362 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 215 place count 361 transition count 306
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 216 place count 361 transition count 306
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 217 place count 360 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 218 place count 359 transition count 305
Applied a total of 218 rules in 41 ms. Remains 359 /473 variables (removed 114) and now considering 305/413 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 359/473 places, 305/413 transitions.
Incomplete random walk after 10000 steps, including 437 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 843485 steps, run timeout after 3001 ms. (steps per millisecond=281 ) properties seen :{}
Probabilistic random walk after 843485 steps, saw 116477 distinct states, run finished after 3001 ms. (steps per millisecond=281 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 305 rows 359 cols
[2024-05-22 01:50:24] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 01:50:25] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:50:25] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:50:25] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 01:50:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:50:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 137 ms returned sat
[2024-05-22 01:50:25] [INFO ] After 464ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 01:50:25] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:50:26] [INFO ] After 212ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-22 01:50:26] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-22 01:50:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-05-22 01:50:26] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2024-05-22 01:50:26] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-22 01:50:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 420 ms
[2024-05-22 01:50:26] [INFO ] After 967ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 241 ms.
[2024-05-22 01:50:27] [INFO ] After 1995ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 82 ms.
Support contains 4 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 305/305 transitions.
Applied a total of 0 rules in 5 ms. Remains 359 /359 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 359/359 places, 305/305 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 305/305 transitions.
Applied a total of 0 rules in 5 ms. Remains 359 /359 variables (removed 0) and now considering 305/305 (removed 0) transitions.
[2024-05-22 01:50:27] [INFO ] Invariant cache hit.
[2024-05-22 01:50:27] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-22 01:50:27] [INFO ] Invariant cache hit.
[2024-05-22 01:50:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:50:27] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
[2024-05-22 01:50:27] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:50:27] [INFO ] Invariant cache hit.
[2024-05-22 01:50:27] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 780 ms. Remains : 359/359 places, 305/305 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 359 transition count 305
Applied a total of 1 rules in 10 ms. Remains 359 /359 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 305 rows 359 cols
[2024-05-22 01:50:27] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 01:50:28] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:50:28] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2024-05-22 01:50:28] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 01:50:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:50:28] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 137 ms returned sat
[2024-05-22 01:50:28] [INFO ] After 411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 01:50:28] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 0 ms to minimize.
[2024-05-22 01:50:28] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 0 ms to minimize.
[2024-05-22 01:50:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2024-05-22 01:50:29] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-05-22 01:50:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2024-05-22 01:50:29] [INFO ] After 892ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 168 ms.
[2024-05-22 01:50:29] [INFO ] After 1368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 182 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 473 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 : 473/473 places, 413/413 transitions.
Graph (complete) has 1126 edges and 473 vertex of which 467 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 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 466 transition count 395
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 452 transition count 395
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 452 transition count 384
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 51 place count 441 transition count 384
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 199 place count 367 transition count 310
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 203 place count 365 transition count 312
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 205 place count 363 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 206 place count 362 transition count 310
Applied a total of 206 rules in 42 ms. Remains 362 /473 variables (removed 111) and now considering 310/413 (removed 103) transitions.
// Phase 1: matrix 310 rows 362 cols
[2024-05-22 01:50:29] [INFO ] Computed 58 invariants in 8 ms
[2024-05-22 01:50:30] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-22 01:50:30] [INFO ] Invariant cache hit.
[2024-05-22 01:50:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:50:30] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
[2024-05-22 01:50:30] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:50:30] [INFO ] Invariant cache hit.
[2024-05-22 01:50:30] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 362/473 places, 310/413 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 811 ms. Remains : 362/473 places, 310/413 transitions.
Computed a total of 258 stabilizing places and 253 stable transitions
Computed a total of 258 stabilizing places and 253 stable transitions
Detected a total of 258/362 stabilizing places and 253/310 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 100 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 77 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 458 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 102 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1405907 steps, run timeout after 3001 ms. (steps per millisecond=468 ) properties seen :{}
Probabilistic random walk after 1405907 steps, saw 189184 distinct states, run finished after 3001 ms. (steps per millisecond=468 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:50:33] [INFO ] Invariant cache hit.
[2024-05-22 01:50:33] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:50:33] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 01:50:33] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:50:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:50:34] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 25 ms returned sat
[2024-05-22 01:50:34] [INFO ] After 235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:50:34] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:50:34] [INFO ] After 44ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:50:34] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-22 01:50:34] [INFO ] After 418ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 310/310 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 362 transition count 309
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 360 transition count 307
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 360 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 359 transition count 306
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 359 transition count 306
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 357 transition count 304
Applied a total of 10 rules in 29 ms. Remains 357 /362 variables (removed 5) and now considering 304/310 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 357/362 places, 304/310 transitions.
Incomplete random walk after 10000 steps, including 524 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1376237 steps, run timeout after 3001 ms. (steps per millisecond=458 ) properties seen :{}
Probabilistic random walk after 1376237 steps, saw 207475 distinct states, run finished after 3001 ms. (steps per millisecond=458 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 304 rows 357 cols
[2024-05-22 01:50:37] [INFO ] Computed 59 invariants in 7 ms
[2024-05-22 01:50:37] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:50:37] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 01:50:37] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:50:37] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:50:37] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 01:50:38] [INFO ] After 335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:50:38] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-22 01:50:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-05-22 01:50:38] [INFO ] After 440ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-22 01:50:38] [INFO ] After 641ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 304/304 transitions.
Applied a total of 0 rules in 7 ms. Remains 357 /357 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 357/357 places, 304/304 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 304/304 transitions.
Applied a total of 0 rules in 5 ms. Remains 357 /357 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-05-22 01:50:38] [INFO ] Invariant cache hit.
[2024-05-22 01:50:38] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-22 01:50:38] [INFO ] Invariant cache hit.
[2024-05-22 01:50:38] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
[2024-05-22 01:50:38] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:50:38] [INFO ] Invariant cache hit.
[2024-05-22 01:50:38] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 723 ms. Remains : 357/357 places, 304/304 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 357 transition count 304
Applied a total of 1 rules in 9 ms. Remains 357 /357 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 304 rows 357 cols
[2024-05-22 01:50:38] [INFO ] Computed 59 invariants in 9 ms
[2024-05-22 01:50:38] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:50:38] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 01:50:39] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:50:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:50:39] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 01:50:39] [INFO ] After 294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:50:39] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-22 01:50:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-05-22 01:50:39] [INFO ] After 395ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-22 01:50:39] [INFO ] After 601ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 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 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4585 reset in 215 ms.
Product exploration explored 100000 steps with 4630 reset in 231 ms.
Built C files in :
/tmp/ltsmin4210880808888818196
[2024-05-22 01:50:40] [INFO ] Computing symmetric may disable matrix : 310 transitions.
[2024-05-22 01:50:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:50:40] [INFO ] Computing symmetric may enable matrix : 310 transitions.
[2024-05-22 01:50:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:50:40] [INFO ] Computing Do-Not-Accords matrix : 310 transitions.
[2024-05-22 01:50:40] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:50:40] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4210880808888818196
Running compilation step : cd /tmp/ltsmin4210880808888818196;'/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 702 ms.
Running link step : cd /tmp/ltsmin4210880808888818196;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4210880808888818196;'/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/stateBased17188315641174022157.hoa' '--buchi-type=spotba'
LTSmin run took 7697 ms.
FORMULA DES-PT-60b-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-60b-LTLFireability-06 finished in 35627 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(p0)||X(F((X(G(p2))&&p1)))))'
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 477 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 477 transition count 421
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 477 transition count 420
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 476 transition count 419
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 476 transition count 419
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 476 transition count 418
Applied a total of 6 rules in 25 ms. Remains 476 /478 variables (removed 2) and now considering 418/422 (removed 4) transitions.
// Phase 1: matrix 418 rows 476 cols
[2024-05-22 01:50:48] [INFO ] Computed 62 invariants in 13 ms
[2024-05-22 01:50:49] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-22 01:50:49] [INFO ] Invariant cache hit.
[2024-05-22 01:50:49] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 787 ms to find 0 implicit places.
[2024-05-22 01:50:49] [INFO ] Invariant cache hit.
[2024-05-22 01:50:49] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 476/478 places, 418/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1010 ms. Remains : 476/478 places, 418/422 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-60b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=4 dest: 3}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s316 0), p1:(AND (EQ s276 1) (EQ s458 1) (EQ s316 1)), p2:(EQ s300 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1099 steps with 8 reset in 3 ms.
FORMULA DES-PT-60b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-07 finished in 1234 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(p0)))'
Support contains 2 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 422/422 transitions.
Graph (complete) has 1139 edges and 478 vertex of which 472 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 471 transition count 405
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 458 transition count 405
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 458 transition count 393
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 446 transition count 393
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 443 transition count 390
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 443 transition count 390
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 443 transition count 387
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 442 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 62 place count 442 transition count 385
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 441 transition count 385
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 440 transition count 384
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 440 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 67 place count 440 transition count 383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 67 place count 440 transition count 382
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 69 place count 439 transition count 382
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 5 with 152 rules applied. Total rules applied 221 place count 363 transition count 306
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 5 with 4 rules applied. Total rules applied 225 place count 361 transition count 308
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 227 place count 359 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 228 place count 358 transition count 306
Applied a total of 228 rules in 63 ms. Remains 358 /478 variables (removed 120) and now considering 306/422 (removed 116) transitions.
// Phase 1: matrix 306 rows 358 cols
[2024-05-22 01:50:50] [INFO ] Computed 58 invariants in 8 ms
[2024-05-22 01:50:50] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-22 01:50:50] [INFO ] Invariant cache hit.
[2024-05-22 01:50:50] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2024-05-22 01:50:50] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:50:50] [INFO ] Invariant cache hit.
[2024-05-22 01:50:50] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 358/478 places, 306/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 792 ms. Remains : 358/478 places, 306/422 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s71 0) (EQ s353 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5190 reset in 212 ms.
Product exploration explored 100000 steps with 5175 reset in 234 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/358 stabilizing places and 250/306 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 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 38 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 541 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 93 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1398376 steps, run timeout after 3001 ms. (steps per millisecond=465 ) properties seen :{}
Probabilistic random walk after 1398376 steps, saw 193332 distinct states, run finished after 3001 ms. (steps per millisecond=465 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:50:54] [INFO ] Invariant cache hit.
[2024-05-22 01:50:54] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:50:54] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:50:54] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 109 ms returned sat
[2024-05-22 01:50:55] [INFO ] After 308ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:50:55] [INFO ] After 338ms 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 01:50:55] [INFO ] After 567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 306/306 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 358 transition count 305
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 358 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 357 transition count 304
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 357 transition count 304
Applied a total of 4 rules in 16 ms. Remains 357 /358 variables (removed 1) and now considering 304/306 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 357/358 places, 304/306 transitions.
Incomplete random walk after 10000 steps, including 499 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 93 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1400634 steps, run timeout after 3001 ms. (steps per millisecond=466 ) properties seen :{}
Probabilistic random walk after 1400634 steps, saw 193726 distinct states, run finished after 3001 ms. (steps per millisecond=466 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 304 rows 357 cols
[2024-05-22 01:50:58] [INFO ] Computed 59 invariants in 10 ms
[2024-05-22 01:50:58] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:50:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:50:58] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 18 ms returned sat
[2024-05-22 01:50:58] [INFO ] After 392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:50:58] [INFO ] After 444ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-22 01:50:58] [INFO ] After 652ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 304/304 transitions.
Applied a total of 0 rules in 5 ms. Remains 357 /357 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 357/357 places, 304/304 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 304/304 transitions.
Applied a total of 0 rules in 5 ms. Remains 357 /357 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-05-22 01:50:58] [INFO ] Invariant cache hit.
[2024-05-22 01:50:59] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-22 01:50:59] [INFO ] Invariant cache hit.
[2024-05-22 01:50:59] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
[2024-05-22 01:50:59] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:50:59] [INFO ] Invariant cache hit.
[2024-05-22 01:50:59] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 739 ms. Remains : 357/357 places, 304/304 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 357 transition count 304
Applied a total of 1 rules in 9 ms. Remains 357 /357 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 304 rows 357 cols
[2024-05-22 01:50:59] [INFO ] Computed 59 invariants in 7 ms
[2024-05-22 01:50:59] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:50:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:50:59] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:51:00] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:51:00] [INFO ] After 368ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-22 01:51:00] [INFO ] After 555ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 70 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 :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 2 out of 358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 358/358 places, 306/306 transitions.
Applied a total of 0 rules in 9 ms. Remains 358 /358 variables (removed 0) and now considering 306/306 (removed 0) transitions.
// Phase 1: matrix 306 rows 358 cols
[2024-05-22 01:51:00] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 01:51:00] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-22 01:51:00] [INFO ] Invariant cache hit.
[2024-05-22 01:51:01] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
[2024-05-22 01:51:01] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:51:01] [INFO ] Invariant cache hit.
[2024-05-22 01:51:01] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 725 ms. Remains : 358/358 places, 306/306 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/358 stabilizing places and 250/306 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 69 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 :[(NOT p0)]
Incomplete random walk after 10000 steps, including 522 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 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1395953 steps, run timeout after 3001 ms. (steps per millisecond=465 ) properties seen :{}
Probabilistic random walk after 1395953 steps, saw 193003 distinct states, run finished after 3001 ms. (steps per millisecond=465 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:51:04] [INFO ] Invariant cache hit.
[2024-05-22 01:51:04] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:51:04] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:51:04] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 109 ms returned sat
[2024-05-22 01:51:04] [INFO ] After 309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:51:04] [INFO ] After 344ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-22 01:51:04] [INFO ] After 553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 306/306 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 358 transition count 305
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 358 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 357 transition count 304
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 357 transition count 304
Applied a total of 4 rules in 15 ms. Remains 357 /358 variables (removed 1) and now considering 304/306 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 357/358 places, 304/306 transitions.
Incomplete random walk after 10000 steps, including 509 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1393633 steps, run timeout after 3001 ms. (steps per millisecond=464 ) properties seen :{}
Probabilistic random walk after 1393633 steps, saw 192626 distinct states, run finished after 3001 ms. (steps per millisecond=464 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 304 rows 357 cols
[2024-05-22 01:51:08] [INFO ] Computed 59 invariants in 9 ms
[2024-05-22 01:51:08] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:51:08] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:51:08] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 01:51:08] [INFO ] After 390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:51:08] [INFO ] After 454ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-22 01:51:08] [INFO ] After 641ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 304/304 transitions.
Applied a total of 0 rules in 5 ms. Remains 357 /357 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 357/357 places, 304/304 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 304/304 transitions.
Applied a total of 0 rules in 5 ms. Remains 357 /357 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-05-22 01:51:08] [INFO ] Invariant cache hit.
[2024-05-22 01:51:08] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-22 01:51:08] [INFO ] Invariant cache hit.
[2024-05-22 01:51:09] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2024-05-22 01:51:09] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:51:09] [INFO ] Invariant cache hit.
[2024-05-22 01:51:09] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 721 ms. Remains : 357/357 places, 304/304 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 357 transition count 304
Applied a total of 1 rules in 9 ms. Remains 357 /357 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 304 rows 357 cols
[2024-05-22 01:51:09] [INFO ] Computed 59 invariants in 4 ms
[2024-05-22 01:51:09] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:51:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:51:09] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 01:51:10] [INFO ] After 326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:51:10] [INFO ] After 362ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-22 01:51:10] [INFO ] After 556ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 103 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 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5153 reset in 216 ms.
Product exploration explored 100000 steps with 5114 reset in 233 ms.
Built C files in :
/tmp/ltsmin3763298638180871260
[2024-05-22 01:51:10] [INFO ] Computing symmetric may disable matrix : 306 transitions.
[2024-05-22 01:51:10] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:51:10] [INFO ] Computing symmetric may enable matrix : 306 transitions.
[2024-05-22 01:51:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:51:10] [INFO ] Computing Do-Not-Accords matrix : 306 transitions.
[2024-05-22 01:51:10] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:51:10] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3763298638180871260
Running compilation step : cd /tmp/ltsmin3763298638180871260;'/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 656 ms.
Running link step : cd /tmp/ltsmin3763298638180871260;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3763298638180871260;'/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/stateBased5256318305100955947.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 358/358 places, 306/306 transitions.
Applied a total of 0 rules in 8 ms. Remains 358 /358 variables (removed 0) and now considering 306/306 (removed 0) transitions.
// Phase 1: matrix 306 rows 358 cols
[2024-05-22 01:51:25] [INFO ] Computed 58 invariants in 8 ms
[2024-05-22 01:51:26] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-22 01:51:26] [INFO ] Invariant cache hit.
[2024-05-22 01:51:26] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
[2024-05-22 01:51:26] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:51:26] [INFO ] Invariant cache hit.
[2024-05-22 01:51:26] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 735 ms. Remains : 358/358 places, 306/306 transitions.
Built C files in :
/tmp/ltsmin12191899228058121394
[2024-05-22 01:51:26] [INFO ] Computing symmetric may disable matrix : 306 transitions.
[2024-05-22 01:51:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:51:26] [INFO ] Computing symmetric may enable matrix : 306 transitions.
[2024-05-22 01:51:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:51:26] [INFO ] Computing Do-Not-Accords matrix : 306 transitions.
[2024-05-22 01:51:26] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:51:26] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12191899228058121394
Running compilation step : cd /tmp/ltsmin12191899228058121394;'/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 664 ms.
Running link step : cd /tmp/ltsmin12191899228058121394;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12191899228058121394;'/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/stateBased12621426600136899641.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:51:41] [INFO ] Flatten gal took : 24 ms
[2024-05-22 01:51:41] [INFO ] Flatten gal took : 23 ms
[2024-05-22 01:51:41] [INFO ] Time to serialize gal into /tmp/LTL10523692195502460744.gal : 6 ms
[2024-05-22 01:51:41] [INFO ] Time to serialize properties into /tmp/LTL4388859555699418069.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/LTL10523692195502460744.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8124455704849309366.hoa' '-atoms' '/tmp/LTL4388859555699418069.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/LTL4388859555699418069.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8124455704849309366.hoa
Detected timeout of ITS tools.
[2024-05-22 01:51:56] [INFO ] Flatten gal took : 20 ms
[2024-05-22 01:51:56] [INFO ] Flatten gal took : 18 ms
[2024-05-22 01:51:56] [INFO ] Time to serialize gal into /tmp/LTL4740744248028638060.gal : 3 ms
[2024-05-22 01:51:56] [INFO ] Time to serialize properties into /tmp/LTL8440252893117970979.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4740744248028638060.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8440252893117970979.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((p78==0)||(p511==0))"))))
Formula 0 simplified : GF!"((p78==0)||(p511==0))"
Detected timeout of ITS tools.
[2024-05-22 01:52:12] [INFO ] Flatten gal took : 22 ms
[2024-05-22 01:52:12] [INFO ] Applying decomposition
[2024-05-22 01:52:12] [INFO ] Flatten gal took : 19 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/graph10869241745781184650.txt' '-o' '/tmp/graph10869241745781184650.bin' '-w' '/tmp/graph10869241745781184650.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10869241745781184650.bin' '-l' '-1' '-v' '-w' '/tmp/graph10869241745781184650.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:52:12] [INFO ] Decomposing Gal with order
[2024-05-22 01:52:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:52:12] [INFO ] Removed a total of 49 redundant transitions.
[2024-05-22 01:52:12] [INFO ] Flatten gal took : 57 ms
[2024-05-22 01:52:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 7 ms.
[2024-05-22 01:52:12] [INFO ] Time to serialize gal into /tmp/LTL2830468591591897697.gal : 5 ms
[2024-05-22 01:52:12] [INFO ] Time to serialize properties into /tmp/LTL1209766022160105002.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/LTL2830468591591897697.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1209766022160105002.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("((u45.p78==0)||(u45.p511==0))"))))
Formula 0 simplified : GF!"((u45.p78==0)||(u45.p511==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17252010738126054266
[2024-05-22 01:52:27] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17252010738126054266
Running compilation step : cd /tmp/ltsmin17252010738126054266;'/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 496 ms.
Running link step : cd /tmp/ltsmin17252010738126054266;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17252010738126054266;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-60b-LTLFireability-08 finished in 112333 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)))'
Support contains 3 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 422/422 transitions.
Graph (complete) has 1139 edges and 478 vertex of which 472 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 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 471 transition count 407
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 460 transition count 407
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 23 place count 460 transition count 396
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 45 place count 449 transition count 396
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 48 place count 446 transition count 393
Iterating global reduction 2 with 3 rules applied. Total rules applied 51 place count 446 transition count 393
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 54 place count 446 transition count 390
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 56 place count 445 transition count 389
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 56 place count 445 transition count 388
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 58 place count 444 transition count 388
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 59 place count 443 transition count 387
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 443 transition count 387
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 62 place count 443 transition count 385
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 63 place count 442 transition count 385
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 6 with 152 rules applied. Total rules applied 215 place count 366 transition count 309
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 6 with 4 rules applied. Total rules applied 219 place count 364 transition count 311
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 221 place count 362 transition count 309
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 222 place count 361 transition count 309
Applied a total of 222 rules in 53 ms. Remains 361 /478 variables (removed 117) and now considering 309/422 (removed 113) transitions.
// Phase 1: matrix 309 rows 361 cols
[2024-05-22 01:52:42] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 01:52:42] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-22 01:52:42] [INFO ] Invariant cache hit.
[2024-05-22 01:52:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:52:43] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
[2024-05-22 01:52:43] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:52:43] [INFO ] Invariant cache hit.
[2024-05-22 01:52:43] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 361/478 places, 309/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 908 ms. Remains : 361/478 places, 309/422 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s223 0) (EQ s244 0) (EQ s268 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4801 reset in 203 ms.
Product exploration explored 100000 steps with 4760 reset in 227 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 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 73 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 483 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 99 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1404179 steps, run timeout after 3001 ms. (steps per millisecond=467 ) properties seen :{}
Probabilistic random walk after 1404179 steps, saw 193410 distinct states, run finished after 3001 ms. (steps per millisecond=467 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:52:47] [INFO ] Invariant cache hit.
[2024-05-22 01:52:47] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:52:47] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:52:47] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 109 ms returned sat
[2024-05-22 01:52:47] [INFO ] After 660ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:52:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:52:48] [INFO ] After 30ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:52:48] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-22 01:52:48] [INFO ] After 927ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 309/309 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 361 transition count 308
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 361 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 360 transition count 307
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 360 transition count 307
Applied a total of 4 rules in 16 ms. Remains 360 /361 variables (removed 1) and now considering 307/309 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 360/361 places, 307/309 transitions.
Incomplete random walk after 10000 steps, including 462 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 88 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1410362 steps, run timeout after 3001 ms. (steps per millisecond=469 ) properties seen :{}
Probabilistic random walk after 1410362 steps, saw 194131 distinct states, run finished after 3001 ms. (steps per millisecond=469 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 307 rows 360 cols
[2024-05-22 01:52:51] [INFO ] Computed 59 invariants in 9 ms
[2024-05-22 01:52:51] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:52:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:52:51] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 132 ms returned sat
[2024-05-22 01:52:51] [INFO ] After 404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:52:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:52:51] [INFO ] After 28ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:52:51] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-22 01:52:51] [INFO ] After 713ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 307/307 transitions.
Applied a total of 0 rules in 8 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 360/360 places, 307/307 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 307/307 transitions.
Applied a total of 0 rules in 5 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2024-05-22 01:52:51] [INFO ] Invariant cache hit.
[2024-05-22 01:52:52] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-22 01:52:52] [INFO ] Invariant cache hit.
[2024-05-22 01:52:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:52:52] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2024-05-22 01:52:52] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:52:52] [INFO ] Invariant cache hit.
[2024-05-22 01:52:52] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 733 ms. Remains : 360/360 places, 307/307 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 360 transition count 307
Applied a total of 1 rules in 10 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 307 rows 360 cols
[2024-05-22 01:52:52] [INFO ] Computed 59 invariants in 4 ms
[2024-05-22 01:52:52] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:52:52] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:52:52] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 134 ms returned sat
[2024-05-22 01:52:53] [INFO ] After 398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:52:53] [INFO ] After 449ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-22 01:52:53] [INFO ] After 710ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 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 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 309/309 transitions.
Applied a total of 0 rules in 12 ms. Remains 361 /361 variables (removed 0) and now considering 309/309 (removed 0) transitions.
// Phase 1: matrix 309 rows 361 cols
[2024-05-22 01:52:53] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 01:52:53] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-22 01:52:53] [INFO ] Invariant cache hit.
[2024-05-22 01:52:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:52:54] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2024-05-22 01:52:54] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:52:54] [INFO ] Invariant cache hit.
[2024-05-22 01:52:54] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 829 ms. Remains : 361/361 places, 309/309 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 56 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 71 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 471 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1398659 steps, run timeout after 3001 ms. (steps per millisecond=466 ) properties seen :{}
Probabilistic random walk after 1398659 steps, saw 192691 distinct states, run finished after 3001 ms. (steps per millisecond=466 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:52:57] [INFO ] Invariant cache hit.
[2024-05-22 01:52:57] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:52:57] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:52:57] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 107 ms returned sat
[2024-05-22 01:52:58] [INFO ] After 662ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:52:58] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:52:58] [INFO ] After 23ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:52:58] [INFO ] After 58ms 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 01:52:58] [INFO ] After 916ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 309/309 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 361 transition count 308
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 361 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 360 transition count 307
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 360 transition count 307
Applied a total of 4 rules in 17 ms. Remains 360 /361 variables (removed 1) and now considering 307/309 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 360/361 places, 307/309 transitions.
Incomplete random walk after 10000 steps, including 446 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 95 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1402727 steps, run timeout after 3001 ms. (steps per millisecond=467 ) properties seen :{}
Probabilistic random walk after 1402727 steps, saw 193150 distinct states, run finished after 3001 ms. (steps per millisecond=467 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 307 rows 360 cols
[2024-05-22 01:53:01] [INFO ] Computed 59 invariants in 9 ms
[2024-05-22 01:53:01] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:53:01] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:53:02] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 145 ms returned sat
[2024-05-22 01:53:02] [INFO ] After 408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:53:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:53:02] [INFO ] After 27ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:53:02] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-22 01:53:02] [INFO ] After 737ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 307/307 transitions.
Applied a total of 0 rules in 6 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 360/360 places, 307/307 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 307/307 transitions.
Applied a total of 0 rules in 5 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2024-05-22 01:53:02] [INFO ] Invariant cache hit.
[2024-05-22 01:53:02] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-22 01:53:02] [INFO ] Invariant cache hit.
[2024-05-22 01:53:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:53:03] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
[2024-05-22 01:53:03] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:53:03] [INFO ] Invariant cache hit.
[2024-05-22 01:53:03] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 747 ms. Remains : 360/360 places, 307/307 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 360 transition count 307
Applied a total of 1 rules in 10 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 307 rows 360 cols
[2024-05-22 01:53:03] [INFO ] Computed 59 invariants in 4 ms
[2024-05-22 01:53:03] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:53:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:53:03] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 143 ms returned sat
[2024-05-22 01:53:04] [INFO ] After 398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:53:04] [INFO ] After 447ms 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 01:53:04] [INFO ] After 704ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 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 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4769 reset in 209 ms.
Product exploration explored 100000 steps with 4759 reset in 229 ms.
Built C files in :
/tmp/ltsmin11743377278729229852
[2024-05-22 01:53:04] [INFO ] Computing symmetric may disable matrix : 309 transitions.
[2024-05-22 01:53:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:53:04] [INFO ] Computing symmetric may enable matrix : 309 transitions.
[2024-05-22 01:53:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:53:04] [INFO ] Computing Do-Not-Accords matrix : 309 transitions.
[2024-05-22 01:53:04] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:53:04] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11743377278729229852
Running compilation step : cd /tmp/ltsmin11743377278729229852;'/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 664 ms.
Running link step : cd /tmp/ltsmin11743377278729229852;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin11743377278729229852;'/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/stateBased13110287811661922307.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 309/309 transitions.
Applied a total of 0 rules in 15 ms. Remains 361 /361 variables (removed 0) and now considering 309/309 (removed 0) transitions.
// Phase 1: matrix 309 rows 361 cols
[2024-05-22 01:53:19] [INFO ] Computed 58 invariants in 6 ms
[2024-05-22 01:53:20] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-22 01:53:20] [INFO ] Invariant cache hit.
[2024-05-22 01:53:20] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:53:20] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2024-05-22 01:53:20] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-22 01:53:20] [INFO ] Invariant cache hit.
[2024-05-22 01:53:20] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 824 ms. Remains : 361/361 places, 309/309 transitions.
Built C files in :
/tmp/ltsmin5150641265657957887
[2024-05-22 01:53:20] [INFO ] Computing symmetric may disable matrix : 309 transitions.
[2024-05-22 01:53:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:53:20] [INFO ] Computing symmetric may enable matrix : 309 transitions.
[2024-05-22 01:53:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:53:20] [INFO ] Computing Do-Not-Accords matrix : 309 transitions.
[2024-05-22 01:53:20] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:53:20] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5150641265657957887
Running compilation step : cd /tmp/ltsmin5150641265657957887;'/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 669 ms.
Running link step : cd /tmp/ltsmin5150641265657957887;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin5150641265657957887;'/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/stateBased16532203790003703423.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:53:35] [INFO ] Flatten gal took : 17 ms
[2024-05-22 01:53:35] [INFO ] Flatten gal took : 15 ms
[2024-05-22 01:53:35] [INFO ] Time to serialize gal into /tmp/LTL13056727561649997293.gal : 3 ms
[2024-05-22 01:53:35] [INFO ] Time to serialize properties into /tmp/LTL18364808684322702549.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/LTL13056727561649997293.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15328945913677051207.hoa' '-atoms' '/tmp/LTL18364808684322702549.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/LTL18364808684322702549.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15328945913677051207.hoa
Detected timeout of ITS tools.
[2024-05-22 01:53:50] [INFO ] Flatten gal took : 14 ms
[2024-05-22 01:53:51] [INFO ] Flatten gal took : 14 ms
[2024-05-22 01:53:51] [INFO ] Time to serialize gal into /tmp/LTL26632551496759420.gal : 4 ms
[2024-05-22 01:53:51] [INFO ] Time to serialize properties into /tmp/LTL15077591501841788420.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/LTL26632551496759420.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15077591501841788420.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...274
Read 1 LTL properties
Checking formula 0 : !((G(F("(((p232==0)||(p269==0))||(p357==0))"))))
Formula 0 simplified : FG!"(((p232==0)||(p269==0))||(p357==0))"
Detected timeout of ITS tools.
[2024-05-22 01:54:06] [INFO ] Flatten gal took : 16 ms
[2024-05-22 01:54:06] [INFO ] Applying decomposition
[2024-05-22 01:54:06] [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/graph6194810169876888017.txt' '-o' '/tmp/graph6194810169876888017.bin' '-w' '/tmp/graph6194810169876888017.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6194810169876888017.bin' '-l' '-1' '-v' '-w' '/tmp/graph6194810169876888017.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:54:06] [INFO ] Decomposing Gal with order
[2024-05-22 01:54:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:54:06] [INFO ] Removed a total of 94 redundant transitions.
[2024-05-22 01:54:06] [INFO ] Flatten gal took : 24 ms
[2024-05-22 01:54:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 67 labels/synchronizations in 4 ms.
[2024-05-22 01:54:06] [INFO ] Time to serialize gal into /tmp/LTL18130044064258163944.gal : 4 ms
[2024-05-22 01:54:06] [INFO ] Time to serialize properties into /tmp/LTL3801993139752699730.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/LTL18130044064258163944.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3801993139752699730.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("(((u2.p232==0)||(u2.p269==0))||(i0.i2.u7.p357==0))"))))
Formula 0 simplified : FG!"(((u2.p232==0)||(u2.p269==0))||(i0.i2.u7.p357==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2777552481034410791
[2024-05-22 01:54:21] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2777552481034410791
Running compilation step : cd /tmp/ltsmin2777552481034410791;'/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/ltsmin2777552481034410791;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2777552481034410791;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-60b-LTLFireability-09 finished in 113907 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)))'
Support contains 2 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 422/422 transitions.
Graph (complete) has 1139 edges and 478 vertex of which 472 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 471 transition count 404
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 457 transition count 404
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 457 transition count 393
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 51 place count 446 transition count 393
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 443 transition count 390
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 443 transition count 390
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 443 transition count 387
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 442 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 62 place count 442 transition count 385
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 441 transition count 385
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 440 transition count 384
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 440 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 67 place count 440 transition count 383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 67 place count 440 transition count 382
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 69 place count 439 transition count 382
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 5 with 152 rules applied. Total rules applied 221 place count 363 transition count 306
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 5 with 4 rules applied. Total rules applied 225 place count 361 transition count 308
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 227 place count 359 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 228 place count 358 transition count 306
Applied a total of 228 rules in 60 ms. Remains 358 /478 variables (removed 120) and now considering 306/422 (removed 116) transitions.
// Phase 1: matrix 306 rows 358 cols
[2024-05-22 01:54:36] [INFO ] Computed 58 invariants in 7 ms
[2024-05-22 01:54:36] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-22 01:54:36] [INFO ] Invariant cache hit.
[2024-05-22 01:54:37] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
[2024-05-22 01:54:37] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-22 01:54:37] [INFO ] Invariant cache hit.
[2024-05-22 01:54:37] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 358/478 places, 306/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 910 ms. Remains : 358/478 places, 306/422 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s272 1) (EQ s335 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA DES-PT-60b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-10 finished in 984 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 2 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 422/422 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 475 transition count 419
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 475 transition count 419
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 475 transition count 417
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 473 transition count 415
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 473 transition count 415
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 473 transition count 413
Applied a total of 14 rules in 17 ms. Remains 473 /478 variables (removed 5) and now considering 413/422 (removed 9) transitions.
// Phase 1: matrix 413 rows 473 cols
[2024-05-22 01:54:37] [INFO ] Computed 62 invariants in 19 ms
[2024-05-22 01:54:37] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-22 01:54:37] [INFO ] Invariant cache hit.
[2024-05-22 01:54:38] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
[2024-05-22 01:54:38] [INFO ] Invariant cache hit.
[2024-05-22 01:54:38] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/478 places, 413/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1057 ms. Remains : 473/478 places, 413/422 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-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 (NEQ s174 1) (NEQ s322 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]]
Product exploration explored 100000 steps with 870 reset in 177 ms.
Product exploration explored 100000 steps with 893 reset in 200 ms.
Computed a total of 296 stabilizing places and 288 stable transitions
Graph (complete) has 1126 edges and 473 vertex of which 467 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 296 stabilizing places and 288 stable transitions
Detected a total of 296/473 stabilizing places and 288/413 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 82 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 12 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1184051 steps, run timeout after 3001 ms. (steps per millisecond=394 ) properties seen :{}
Probabilistic random walk after 1184051 steps, saw 191545 distinct states, run finished after 3004 ms. (steps per millisecond=394 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:54:42] [INFO ] Invariant cache hit.
[2024-05-22 01:54:42] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-22 01:54:42] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 37 ms returned sat
[2024-05-22 01:54:42] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:54:42] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-22 01:54:42] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 35 ms returned sat
[2024-05-22 01:54:42] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:54:42] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2024-05-22 01:54:42] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 0 ms to minimize.
[2024-05-22 01:54:43] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2024-05-22 01:54:43] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 0 ms to minimize.
[2024-05-22 01:54:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 637 ms
[2024-05-22 01:54:43] [INFO ] After 885ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2024-05-22 01:54:43] [INFO ] After 1078ms 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 473 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 473/473 places, 413/413 transitions.
Graph (complete) has 1126 edges and 473 vertex of which 467 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 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 467 transition count 391
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 450 transition count 391
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 37 place count 450 transition count 379
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 61 place count 438 transition count 379
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 2 with 150 rules applied. Total rules applied 211 place count 363 transition count 304
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 361 transition count 306
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 361 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 360 transition count 305
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 359 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 219 place count 358 transition count 304
Applied a total of 219 rules in 41 ms. Remains 358 /473 variables (removed 115) and now considering 304/413 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 358/473 places, 304/413 transitions.
Incomplete random walk after 10000 steps, including 448 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 89 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1420877 steps, run timeout after 3001 ms. (steps per millisecond=473 ) properties seen :{}
Probabilistic random walk after 1420877 steps, saw 192143 distinct states, run finished after 3001 ms. (steps per millisecond=473 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 304 rows 358 cols
[2024-05-22 01:54:46] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 01:54:46] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:54:46] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 01:54:46] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:54:46] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:54:46] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 45 ms returned sat
[2024-05-22 01:54:47] [INFO ] After 579ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:54:47] [INFO ] After 610ms 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 01:54:47] [INFO ] After 732ms 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 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 304/304 transitions.
Applied a total of 0 rules in 7 ms. Remains 358 /358 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 358/358 places, 304/304 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 304/304 transitions.
Applied a total of 0 rules in 5 ms. Remains 358 /358 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-05-22 01:54:47] [INFO ] Invariant cache hit.
[2024-05-22 01:54:47] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-22 01:54:47] [INFO ] Invariant cache hit.
[2024-05-22 01:54:47] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
[2024-05-22 01:54:47] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:54:47] [INFO ] Invariant cache hit.
[2024-05-22 01:54:47] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 701 ms. Remains : 358/358 places, 304/304 transitions.
Applied a total of 0 rules in 5 ms. Remains 358 /358 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 01:54:47] [INFO ] Invariant cache hit.
[2024-05-22 01:54:48] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:54:48] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:54:48] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:54:48] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:54:48] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 144 ms returned sat
[2024-05-22 01:54:48] [INFO ] After 330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:54:48] [INFO ] After 362ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-22 01:54:48] [INFO ] After 588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 473 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 473/473 places, 413/413 transitions.
Applied a total of 0 rules in 9 ms. Remains 473 /473 variables (removed 0) and now considering 413/413 (removed 0) transitions.
// Phase 1: matrix 413 rows 473 cols
[2024-05-22 01:54:48] [INFO ] Computed 62 invariants in 13 ms
[2024-05-22 01:54:49] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-22 01:54:49] [INFO ] Invariant cache hit.
[2024-05-22 01:54:49] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 834 ms to find 0 implicit places.
[2024-05-22 01:54:49] [INFO ] Invariant cache hit.
[2024-05-22 01:54:50] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1046 ms. Remains : 473/473 places, 413/413 transitions.
Computed a total of 296 stabilizing places and 288 stable transitions
Graph (complete) has 1126 edges and 473 vertex of which 467 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 296 stabilizing places and 288 stable transitions
Detected a total of 296/473 stabilizing places and 288/413 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 85 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1170227 steps, run timeout after 3001 ms. (steps per millisecond=389 ) properties seen :{}
Probabilistic random walk after 1170227 steps, saw 189477 distinct states, run finished after 3001 ms. (steps per millisecond=389 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:54:53] [INFO ] Invariant cache hit.
[2024-05-22 01:54:53] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-22 01:54:53] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 37 ms returned sat
[2024-05-22 01:54:53] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:54:53] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-22 01:54:53] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 45 ms returned sat
[2024-05-22 01:54:53] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:54:53] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2024-05-22 01:54:54] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 1 ms to minimize.
[2024-05-22 01:54:54] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
[2024-05-22 01:54:54] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 0 ms to minimize.
[2024-05-22 01:54:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 649 ms
[2024-05-22 01:54:54] [INFO ] After 890ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2024-05-22 01:54:54] [INFO ] After 1087ms 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 473 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 473/473 places, 413/413 transitions.
Graph (complete) has 1126 edges and 473 vertex of which 467 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 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 467 transition count 391
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 450 transition count 391
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 37 place count 450 transition count 379
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 61 place count 438 transition count 379
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 211 place count 363 transition count 304
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 361 transition count 306
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 361 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 360 transition count 305
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 359 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 219 place count 358 transition count 304
Applied a total of 219 rules in 33 ms. Remains 358 /473 variables (removed 115) and now considering 304/413 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 358/473 places, 304/413 transitions.
Incomplete random walk after 10000 steps, including 461 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1419127 steps, run timeout after 3001 ms. (steps per millisecond=472 ) properties seen :{}
Probabilistic random walk after 1419127 steps, saw 191914 distinct states, run finished after 3001 ms. (steps per millisecond=472 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 304 rows 358 cols
[2024-05-22 01:54:57] [INFO ] Computed 60 invariants in 10 ms
[2024-05-22 01:54:57] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:54:57] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 01:54:57] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:54:57] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:54:57] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 44 ms returned sat
[2024-05-22 01:54:58] [INFO ] After 567ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:54:58] [INFO ] After 595ms 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 01:54:58] [INFO ] After 716ms 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 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 304/304 transitions.
Applied a total of 0 rules in 7 ms. Remains 358 /358 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 358/358 places, 304/304 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 304/304 transitions.
Applied a total of 0 rules in 5 ms. Remains 358 /358 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-05-22 01:54:58] [INFO ] Invariant cache hit.
[2024-05-22 01:54:58] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-22 01:54:58] [INFO ] Invariant cache hit.
[2024-05-22 01:54:58] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
[2024-05-22 01:54:58] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:54:58] [INFO ] Invariant cache hit.
[2024-05-22 01:54:59] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 713 ms. Remains : 358/358 places, 304/304 transitions.
Applied a total of 0 rules in 4 ms. Remains 358 /358 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 01:54:59] [INFO ] Invariant cache hit.
[2024-05-22 01:54:59] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:54:59] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 01:54:59] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:54:59] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:54:59] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 145 ms returned sat
[2024-05-22 01:54:59] [INFO ] After 334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:54:59] [INFO ] After 368ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-22 01:54:59] [INFO ] After 591ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 878 reset in 176 ms.
Product exploration explored 100000 steps with 881 reset in 197 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 473 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 473/473 places, 413/413 transitions.
Graph (complete) has 1126 edges and 473 vertex of which 467 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
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 467 transition count 410
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 16 place count 467 transition count 412
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 467 transition count 412
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 462 transition count 407
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 462 transition count 407
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 1 with 76 rules applied. Total rules applied 110 place count 462 transition count 410
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 120 place count 452 transition count 400
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 130 place count 452 transition count 400
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 136 place count 452 transition count 428
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 450 transition count 422
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 450 transition count 422
Deduced a syphon composed of 88 places in 1 ms
Applied a total of 140 rules in 44 ms. Remains 450 /473 variables (removed 23) and now considering 422/413 (removed -9) transitions.
[2024-05-22 01:55:00] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 422 rows 450 cols
[2024-05-22 01:55:00] [INFO ] Computed 59 invariants in 4 ms
[2024-05-22 01:55:00] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 450/473 places, 422/413 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 234 ms. Remains : 450/473 places, 422/413 transitions.
Built C files in :
/tmp/ltsmin14021076132737324837
[2024-05-22 01:55:01] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14021076132737324837
Running compilation step : cd /tmp/ltsmin14021076132737324837;'/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 633 ms.
Running link step : cd /tmp/ltsmin14021076132737324837;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14021076132737324837;'/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/stateBased18184517955695375022.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 473 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 473/473 places, 413/413 transitions.
Applied a total of 0 rules in 5 ms. Remains 473 /473 variables (removed 0) and now considering 413/413 (removed 0) transitions.
// Phase 1: matrix 413 rows 473 cols
[2024-05-22 01:55:16] [INFO ] Computed 62 invariants in 12 ms
[2024-05-22 01:55:16] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-22 01:55:16] [INFO ] Invariant cache hit.
[2024-05-22 01:55:17] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
[2024-05-22 01:55:17] [INFO ] Invariant cache hit.
[2024-05-22 01:55:17] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1050 ms. Remains : 473/473 places, 413/413 transitions.
Built C files in :
/tmp/ltsmin13385734780494484344
[2024-05-22 01:55:17] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13385734780494484344
Running compilation step : cd /tmp/ltsmin13385734780494484344;'/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 636 ms.
Running link step : cd /tmp/ltsmin13385734780494484344;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13385734780494484344;'/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/stateBased3988111653818273081.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:55:32] [INFO ] Flatten gal took : 12 ms
[2024-05-22 01:55:32] [INFO ] Flatten gal took : 14 ms
[2024-05-22 01:55:32] [INFO ] Time to serialize gal into /tmp/LTL5583747844078341662.gal : 2 ms
[2024-05-22 01:55:32] [INFO ] Time to serialize properties into /tmp/LTL16574323780656883309.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/LTL5583747844078341662.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10955427133975897043.hoa' '-atoms' '/tmp/LTL16574323780656883309.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/LTL16574323780656883309.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10955427133975897043.hoa
Detected timeout of ITS tools.
[2024-05-22 01:55:47] [INFO ] Flatten gal took : 12 ms
[2024-05-22 01:55:47] [INFO ] Flatten gal took : 12 ms
[2024-05-22 01:55:47] [INFO ] Time to serialize gal into /tmp/LTL4086292207295130131.gal : 2 ms
[2024-05-22 01:55:47] [INFO ] Time to serialize properties into /tmp/LTL11332687744938243333.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/LTL4086292207295130131.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11332687744938243333.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((p175!=1)||(p363!=1))")))))
Formula 0 simplified : XXF!"((p175!=1)||(p363!=1))"
Detected timeout of ITS tools.
[2024-05-22 01:56:02] [INFO ] Flatten gal took : 13 ms
[2024-05-22 01:56:02] [INFO ] Applying decomposition
[2024-05-22 01:56:02] [INFO ] Flatten gal took : 11 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/graph9199066824787387441.txt' '-o' '/tmp/graph9199066824787387441.bin' '-w' '/tmp/graph9199066824787387441.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9199066824787387441.bin' '-l' '-1' '-v' '-w' '/tmp/graph9199066824787387441.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:56:02] [INFO ] Decomposing Gal with order
[2024-05-22 01:56:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:56:02] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-22 01:56:02] [INFO ] Flatten gal took : 20 ms
[2024-05-22 01:56:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 01:56:02] [INFO ] Time to serialize gal into /tmp/LTL10167765420892935494.gal : 4 ms
[2024-05-22 01:56:02] [INFO ] Time to serialize properties into /tmp/LTL16298331583065749706.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/LTL10167765420892935494.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16298331583065749706.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((u31.p175!=1)||(u31.p363!=1))")))))
Formula 0 simplified : XXF!"((u31.p175!=1)||(u31.p363!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6592111820803267534
[2024-05-22 01:56:17] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6592111820803267534
Running compilation step : cd /tmp/ltsmin6592111820803267534;'/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 626 ms.
Running link step : cd /tmp/ltsmin6592111820803267534;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6592111820803267534;'/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([]((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-60b-LTLFireability-12 finished in 115435 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(p0)||G(p1)||G(p2))))'
Support contains 3 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 422/422 transitions.
Graph (complete) has 1139 edges and 478 vertex of which 472 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 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 471 transition count 404
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 457 transition count 404
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 457 transition count 393
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 51 place count 446 transition count 393
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 443 transition count 390
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 443 transition count 390
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 443 transition count 387
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 442 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 62 place count 442 transition count 385
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 441 transition count 385
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 440 transition count 384
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 440 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 67 place count 440 transition count 383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 67 place count 440 transition count 382
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 69 place count 439 transition count 382
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 5 with 148 rules applied. Total rules applied 217 place count 365 transition count 308
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 5 with 4 rules applied. Total rules applied 221 place count 363 transition count 310
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 223 place count 361 transition count 308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 224 place count 360 transition count 308
Applied a total of 224 rules in 57 ms. Remains 360 /478 variables (removed 118) and now considering 308/422 (removed 114) transitions.
// Phase 1: matrix 308 rows 360 cols
[2024-05-22 01:56:32] [INFO ] Computed 58 invariants in 9 ms
[2024-05-22 01:56:32] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-22 01:56:32] [INFO ] Invariant cache hit.
[2024-05-22 01:56:33] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
[2024-05-22 01:56:33] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:56:33] [INFO ] Invariant cache hit.
[2024-05-22 01:56:33] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 360/478 places, 308/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 838 ms. Remains : 360/478 places, 308/422 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-60b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s309 1), p1:(NEQ s279 1), p2:(EQ s312 0)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5368 reset in 304 ms.
Product exploration explored 100000 steps with 5449 reset in 289 ms.
Computed a total of 254 stabilizing places and 249 stable transitions
Computed a total of 254 stabilizing places and 249 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 133 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 8739 steps, including 456 resets, run visited all 8 properties in 103 ms. (steps per millisecond=84 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 p1 p2)), (F (AND p0 (NOT p1) p2)), (F (NOT (AND (NOT p0) p1 p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 17 factoid took 398 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 308/308 transitions.
Applied a total of 0 rules in 10 ms. Remains 360 /360 variables (removed 0) and now considering 308/308 (removed 0) transitions.
[2024-05-22 01:56:35] [INFO ] Invariant cache hit.
[2024-05-22 01:56:35] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-22 01:56:35] [INFO ] Invariant cache hit.
[2024-05-22 01:56:35] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
[2024-05-22 01:56:35] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:56:35] [INFO ] Invariant cache hit.
[2024-05-22 01:56:35] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 771 ms. Remains : 360/360 places, 308/308 transitions.
Computed a total of 254 stabilizing places and 249 stable transitions
Computed a total of 254 stabilizing places and 249 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 127 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 8548 steps, including 462 resets, run visited all 8 properties in 92 ms. (steps per millisecond=92 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 p1 p2)), (F (AND p0 (NOT p1) p2)), (F (NOT (AND (NOT p0) p1 p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 17 factoid took 385 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 5465 reset in 268 ms.
Product exploration explored 100000 steps with 5397 reset in 286 ms.
Built C files in :
/tmp/ltsmin3103686967444806380
[2024-05-22 01:56:37] [INFO ] Computing symmetric may disable matrix : 308 transitions.
[2024-05-22 01:56:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:56:37] [INFO ] Computing symmetric may enable matrix : 308 transitions.
[2024-05-22 01:56:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:56:37] [INFO ] Computing Do-Not-Accords matrix : 308 transitions.
[2024-05-22 01:56:37] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:56:37] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3103686967444806380
Running compilation step : cd /tmp/ltsmin3103686967444806380;'/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 663 ms.
Running link step : cd /tmp/ltsmin3103686967444806380;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3103686967444806380;'/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/stateBased771385680204322504.hoa' '--buchi-type=spotba'
LTSmin run took 2751 ms.
FORMULA DES-PT-60b-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-60b-LTLFireability-13 finished in 7923 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))'
Support contains 1 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 422/422 transitions.
Graph (complete) has 1139 edges and 478 vertex of which 472 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 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 471 transition count 404
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 457 transition count 404
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 457 transition count 393
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 51 place count 446 transition count 393
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 443 transition count 390
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 443 transition count 390
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 443 transition count 387
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 442 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 62 place count 442 transition count 385
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 441 transition count 385
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 440 transition count 384
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 440 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 67 place count 440 transition count 383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 67 place count 440 transition count 382
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 69 place count 439 transition count 382
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 5 with 154 rules applied. Total rules applied 223 place count 362 transition count 305
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 225 place count 361 transition count 305
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 227 place count 359 transition count 303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 228 place count 358 transition count 303
Applied a total of 228 rules in 56 ms. Remains 358 /478 variables (removed 120) and now considering 303/422 (removed 119) transitions.
// Phase 1: matrix 303 rows 358 cols
[2024-05-22 01:56:40] [INFO ] Computed 58 invariants in 10 ms
[2024-05-22 01:56:40] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-22 01:56:40] [INFO ] Invariant cache hit.
[2024-05-22 01:56:41] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2024-05-22 01:56:41] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:56:41] [INFO ] Invariant cache hit.
[2024-05-22 01:56:41] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 358/478 places, 303/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 769 ms. Remains : 358/478 places, 303/422 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s243 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 23767 reset in 278 ms.
Product exploration explored 100000 steps with 23826 reset in 292 ms.
Computed a total of 254 stabilizing places and 249 stable transitions
Computed a total of 254 stabilizing places and 249 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2024-05-22 01:56:42] [INFO ] Invariant cache hit.
[2024-05-22 01:56:42] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned sat
[2024-05-22 01:56:42] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 33 ms returned sat
[2024-05-22 01:56:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 01:56:44] [INFO ] [Real]Absence check using state equation in 1889 ms returned sat
[2024-05-22 01:56:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 01:56:44] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2024-05-22 01:56:44] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 170 ms returned sat
[2024-05-22 01:56:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 01:56:47] [INFO ] [Nat]Absence check using state equation in 2580 ms returned sat
[2024-05-22 01:56:47] [INFO ] Computed and/alt/rep : 293/478/293 causal constraints (skipped 7 transitions) in 19 ms.
[2024-05-22 01:56:50] [INFO ] Added : 219 causal constraints over 44 iterations in 2609 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 358/358 places, 303/303 transitions.
Applied a total of 0 rules in 10 ms. Remains 358 /358 variables (removed 0) and now considering 303/303 (removed 0) transitions.
[2024-05-22 01:56:50] [INFO ] Invariant cache hit.
[2024-05-22 01:56:50] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-22 01:56:50] [INFO ] Invariant cache hit.
[2024-05-22 01:56:50] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2024-05-22 01:56:50] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:56:50] [INFO ] Invariant cache hit.
[2024-05-22 01:56:50] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 704 ms. Remains : 358/358 places, 303/303 transitions.
Computed a total of 254 stabilizing places and 249 stable transitions
Computed a total of 254 stabilizing places and 249 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-22 01:56:51] [INFO ] Invariant cache hit.
[2024-05-22 01:56:51] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-22 01:56:51] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 24 ms returned sat
[2024-05-22 01:56:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 01:56:53] [INFO ] [Real]Absence check using state equation in 1877 ms returned sat
[2024-05-22 01:56:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 01:56:53] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2024-05-22 01:56:53] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 179 ms returned sat
[2024-05-22 01:56:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 01:56:55] [INFO ] [Nat]Absence check using state equation in 2479 ms returned sat
[2024-05-22 01:56:56] [INFO ] Computed and/alt/rep : 293/478/293 causal constraints (skipped 7 transitions) in 17 ms.
[2024-05-22 01:56:58] [INFO ] Added : 219 causal constraints over 44 iterations in 2524 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23805 reset in 268 ms.
Product exploration explored 100000 steps with 23840 reset in 291 ms.
Built C files in :
/tmp/ltsmin13894607638208466759
[2024-05-22 01:56:59] [INFO ] Computing symmetric may disable matrix : 303 transitions.
[2024-05-22 01:56:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:56:59] [INFO ] Computing symmetric may enable matrix : 303 transitions.
[2024-05-22 01:56:59] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:56:59] [INFO ] Computing Do-Not-Accords matrix : 303 transitions.
[2024-05-22 01:56:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:56:59] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13894607638208466759
Running compilation step : cd /tmp/ltsmin13894607638208466759;'/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 649 ms.
Running link step : cd /tmp/ltsmin13894607638208466759;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13894607638208466759;'/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/stateBased12629025756711271531.hoa' '--buchi-type=spotba'
LTSmin run took 1016 ms.
FORMULA DES-PT-60b-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-60b-LTLFireability-15 finished in 20239 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(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(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(X(G(p0))))'
Found a Lengthening insensitive property : DES-PT-60b-LTLFireability-12
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 478 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 478/478 places, 422/422 transitions.
Graph (complete) has 1139 edges and 478 vertex of which 472 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 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 471 transition count 404
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 457 transition count 404
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 457 transition count 393
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 51 place count 446 transition count 393
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 443 transition count 390
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 443 transition count 390
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 443 transition count 387
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 442 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 62 place count 442 transition count 385
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 441 transition count 385
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 440 transition count 384
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 440 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 67 place count 440 transition count 383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 67 place count 440 transition count 382
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 69 place count 439 transition count 382
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 5 with 150 rules applied. Total rules applied 219 place count 364 transition count 307
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 5 with 4 rules applied. Total rules applied 223 place count 362 transition count 309
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 225 place count 360 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 226 place count 359 transition count 307
Applied a total of 226 rules in 54 ms. Remains 359 /478 variables (removed 119) and now considering 307/422 (removed 115) transitions.
// Phase 1: matrix 307 rows 359 cols
[2024-05-22 01:57:01] [INFO ] Computed 58 invariants in 9 ms
[2024-05-22 01:57:01] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-22 01:57:01] [INFO ] Invariant cache hit.
[2024-05-22 01:57:01] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
[2024-05-22 01:57:01] [INFO ] Invariant cache hit.
[2024-05-22 01:57:02] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 359/478 places, 307/422 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 789 ms. Remains : 359/478 places, 307/422 transitions.
Running random walk in product with property : DES-PT-60b-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 (NEQ s167 1) (NEQ s270 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5112 reset in 211 ms.
Product exploration explored 100000 steps with 5034 reset in 233 ms.
Computed a total of 256 stabilizing places and 251 stable transitions
Computed a total of 256 stabilizing places and 251 stable transitions
Detected a total of 256/359 stabilizing places and 251/307 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 527 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 93 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1405219 steps, run timeout after 3001 ms. (steps per millisecond=468 ) properties seen :{}
Probabilistic random walk after 1405219 steps, saw 190225 distinct states, run finished after 3001 ms. (steps per millisecond=468 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:57:05] [INFO ] Invariant cache hit.
[2024-05-22 01:57:05] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:57:05] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 01:57:05] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:57:05] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:57:06] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 110 ms returned sat
[2024-05-22 01:57:06] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:57:06] [INFO ] After 198ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-22 01:57:06] [INFO ] After 381ms 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 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 307/307 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 359 transition count 306
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 359 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 358 transition count 305
Applied a total of 3 rules in 13 ms. Remains 358 /359 variables (removed 1) and now considering 305/307 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 358/359 places, 305/307 transitions.
Incomplete random walk after 10000 steps, including 509 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 84 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1418427 steps, run timeout after 3001 ms. (steps per millisecond=472 ) properties seen :{}
Probabilistic random walk after 1418427 steps, saw 191860 distinct states, run finished after 3004 ms. (steps per millisecond=472 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 305 rows 358 cols
[2024-05-22 01:57:09] [INFO ] Computed 59 invariants in 10 ms
[2024-05-22 01:57:09] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:57:09] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 01:57:09] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:57:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:57:09] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 117 ms returned sat
[2024-05-22 01:57:09] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:57:09] [INFO ] After 242ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-22 01:57:09] [INFO ] After 445ms 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 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 305/305 transitions.
Applied a total of 0 rules in 7 ms. Remains 358 /358 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 358/358 places, 305/305 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 305/305 transitions.
Applied a total of 0 rules in 5 ms. Remains 358 /358 variables (removed 0) and now considering 305/305 (removed 0) transitions.
[2024-05-22 01:57:09] [INFO ] Invariant cache hit.
[2024-05-22 01:57:10] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-22 01:57:10] [INFO ] Invariant cache hit.
[2024-05-22 01:57:10] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
[2024-05-22 01:57:10] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:57:10] [INFO ] Invariant cache hit.
[2024-05-22 01:57:10] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 698 ms. Remains : 358/358 places, 305/305 transitions.
Applied a total of 0 rules in 5 ms. Remains 358 /358 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 01:57:10] [INFO ] Invariant cache hit.
[2024-05-22 01:57:10] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:57:10] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 01:57:10] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:57:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:57:10] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 115 ms returned sat
[2024-05-22 01:57:11] [INFO ] After 537ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:57:11] [INFO ] After 571ms 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 01:57:11] [INFO ] After 776ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 307/307 transitions.
Applied a total of 0 rules in 9 ms. Remains 359 /359 variables (removed 0) and now considering 307/307 (removed 0) transitions.
// Phase 1: matrix 307 rows 359 cols
[2024-05-22 01:57:11] [INFO ] Computed 58 invariants in 10 ms
[2024-05-22 01:57:11] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-22 01:57:11] [INFO ] Invariant cache hit.
[2024-05-22 01:57:12] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
[2024-05-22 01:57:12] [INFO ] Invariant cache hit.
[2024-05-22 01:57:12] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 745 ms. Remains : 359/359 places, 307/307 transitions.
Computed a total of 256 stabilizing places and 251 stable transitions
Computed a total of 256 stabilizing places and 251 stable transitions
Detected a total of 256/359 stabilizing places and 251/307 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 495 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1411922 steps, run timeout after 3001 ms. (steps per millisecond=470 ) properties seen :{}
Probabilistic random walk after 1411922 steps, saw 191068 distinct states, run finished after 3001 ms. (steps per millisecond=470 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:57:15] [INFO ] Invariant cache hit.
[2024-05-22 01:57:15] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:57:15] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 01:57:15] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:57:15] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-22 01:57:16] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 105 ms returned sat
[2024-05-22 01:57:16] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:57:16] [INFO ] After 195ms 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 01:57:16] [INFO ] After 392ms 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 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 307/307 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 359 transition count 306
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 359 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 358 transition count 305
Applied a total of 3 rules in 11 ms. Remains 358 /359 variables (removed 1) and now considering 305/307 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 358/359 places, 305/307 transitions.
Incomplete random walk after 10000 steps, including 497 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 91 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1412221 steps, run timeout after 3001 ms. (steps per millisecond=470 ) properties seen :{}
Probabilistic random walk after 1412221 steps, saw 191054 distinct states, run finished after 3001 ms. (steps per millisecond=470 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 305 rows 358 cols
[2024-05-22 01:57:19] [INFO ] Computed 59 invariants in 10 ms
[2024-05-22 01:57:19] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:57:19] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 01:57:19] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:57:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:57:19] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 116 ms returned sat
[2024-05-22 01:57:19] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:57:19] [INFO ] After 244ms 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 01:57:19] [INFO ] After 445ms 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 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 305/305 transitions.
Applied a total of 0 rules in 7 ms. Remains 358 /358 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 358/358 places, 305/305 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 305/305 transitions.
Applied a total of 0 rules in 5 ms. Remains 358 /358 variables (removed 0) and now considering 305/305 (removed 0) transitions.
[2024-05-22 01:57:19] [INFO ] Invariant cache hit.
[2024-05-22 01:57:20] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-22 01:57:20] [INFO ] Invariant cache hit.
[2024-05-22 01:57:20] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
[2024-05-22 01:57:20] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:57:20] [INFO ] Invariant cache hit.
[2024-05-22 01:57:20] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 682 ms. Remains : 358/358 places, 305/305 transitions.
Applied a total of 0 rules in 5 ms. Remains 358 /358 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 01:57:20] [INFO ] Invariant cache hit.
[2024-05-22 01:57:20] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:57:20] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 01:57:20] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:57:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:57:20] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 114 ms returned sat
[2024-05-22 01:57:21] [INFO ] After 541ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:57:21] [INFO ] After 575ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-22 01:57:21] [INFO ] After 772ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5090 reset in 215 ms.
Product exploration explored 100000 steps with 5122 reset in 231 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 359 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 359/359 places, 307/307 transitions.
Applied a total of 0 rules in 11 ms. Remains 359 /359 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2024-05-22 01:57:22] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 307 rows 359 cols
[2024-05-22 01:57:22] [INFO ] Computed 58 invariants in 6 ms
[2024-05-22 01:57:22] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 170 ms. Remains : 359/359 places, 307/307 transitions.
Built C files in :
/tmp/ltsmin13132574685505652098
[2024-05-22 01:57:22] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13132574685505652098
Running compilation step : cd /tmp/ltsmin13132574685505652098;'/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/ltsmin13132574685505652098;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin13132574685505652098;'/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/stateBased12027052762573250637.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 307/307 transitions.
Applied a total of 0 rules in 5 ms. Remains 359 /359 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2024-05-22 01:57:37] [INFO ] Invariant cache hit.
[2024-05-22 01:57:37] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-22 01:57:37] [INFO ] Invariant cache hit.
[2024-05-22 01:57:38] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2024-05-22 01:57:38] [INFO ] Invariant cache hit.
[2024-05-22 01:57:38] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 725 ms. Remains : 359/359 places, 307/307 transitions.
Built C files in :
/tmp/ltsmin12765178457662372673
[2024-05-22 01:57:38] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12765178457662372673
Running compilation step : cd /tmp/ltsmin12765178457662372673;'/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/ltsmin12765178457662372673;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12765178457662372673;'/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/stateBased14846705507114642099.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:57:53] [INFO ] Flatten gal took : 15 ms
[2024-05-22 01:57:53] [INFO ] Flatten gal took : 11 ms
[2024-05-22 01:57:53] [INFO ] Time to serialize gal into /tmp/LTL11568456888944834438.gal : 2 ms
[2024-05-22 01:57:53] [INFO ] Time to serialize properties into /tmp/LTL17614912355693718341.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/LTL11568456888944834438.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8760781661052823263.hoa' '-atoms' '/tmp/LTL17614912355693718341.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/LTL17614912355693718341.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8760781661052823263.hoa
Detected timeout of ITS tools.
[2024-05-22 01:58:08] [INFO ] Flatten gal took : 11 ms
[2024-05-22 01:58:08] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:58:08] [INFO ] Time to serialize gal into /tmp/LTL18186306258195721383.gal : 2 ms
[2024-05-22 01:58:08] [INFO ] Time to serialize properties into /tmp/LTL6641075274155916806.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/LTL18186306258195721383.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6641075274155916806.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((p175!=1)||(p363!=1))")))))
Formula 0 simplified : XXF!"((p175!=1)||(p363!=1))"
Detected timeout of ITS tools.
[2024-05-22 01:58:23] [INFO ] Flatten gal took : 15 ms
[2024-05-22 01:58:23] [INFO ] Applying decomposition
[2024-05-22 01:58:23] [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/graph9799251462160893415.txt' '-o' '/tmp/graph9799251462160893415.bin' '-w' '/tmp/graph9799251462160893415.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9799251462160893415.bin' '-l' '-1' '-v' '-w' '/tmp/graph9799251462160893415.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:58:23] [INFO ] Decomposing Gal with order
[2024-05-22 01:58:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:58:23] [INFO ] Removed a total of 44 redundant transitions.
[2024-05-22 01:58:23] [INFO ] Flatten gal took : 17 ms
[2024-05-22 01:58:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 1 ms.
[2024-05-22 01:58:23] [INFO ] Time to serialize gal into /tmp/LTL10175850148988111935.gal : 2 ms
[2024-05-22 01:58:23] [INFO ] Time to serialize properties into /tmp/LTL16304032174292404399.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/LTL10175850148988111935.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16304032174292404399.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((u8.p175!=1)||(u8.p363!=1))")))))
Formula 0 simplified : XXF!"((u8.p175!=1)||(u8.p363!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9160303861902416366
[2024-05-22 01:58:38] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9160303861902416366
Running compilation step : cd /tmp/ltsmin9160303861902416366;'/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 511 ms.
Running link step : cd /tmp/ltsmin9160303861902416366;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9160303861902416366;'/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([]((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-60b-LTLFireability-12 finished in 112912 ms.
[2024-05-22 01:58:53] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1141625172332431242
[2024-05-22 01:58:53] [INFO ] Applying decomposition
[2024-05-22 01:58:53] [INFO ] Computing symmetric may disable matrix : 422 transitions.
[2024-05-22 01:58:54] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:58:54] [INFO ] Computing symmetric may enable matrix : 422 transitions.
[2024-05-22 01:58:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:58:54] [INFO ] Flatten gal took : 11 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/graph10765682777004108029.txt' '-o' '/tmp/graph10765682777004108029.bin' '-w' '/tmp/graph10765682777004108029.weights'
[2024-05-22 01:58:54] [INFO ] Computing Do-Not-Accords matrix : 422 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10765682777004108029.bin' '-l' '-1' '-v' '-w' '/tmp/graph10765682777004108029.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:58:54] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:58:54] [INFO ] Decomposing Gal with order
[2024-05-22 01:58:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:58:54] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1141625172332431242
Running compilation step : cd /tmp/ltsmin1141625172332431242;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-22 01:58:54] [INFO ] Removed a total of 19 redundant transitions.
[2024-05-22 01:58:54] [INFO ] Flatten gal took : 18 ms
[2024-05-22 01:58:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2024-05-22 01:58:54] [INFO ] Time to serialize gal into /tmp/LTLFireability69000583154811845.gal : 4 ms
[2024-05-22 01:58:54] [INFO ] Time to serialize properties into /tmp/LTLFireability16626969708450064539.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/LTLFireability69000583154811845.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16626969708450064539.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...275
Read 3 LTL properties
Checking formula 0 : !((F(G("((i9.u79.p78==0)||(i9.u79.p511==0))"))))
Formula 0 simplified : GF!"((i9.u79.p78==0)||(i9.u79.p511==0))"
Compilation finished in 879 ms.
Running link step : cd /tmp/ltsmin1141625172332431242;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1141625172332431242;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t118, t313, t382, t383, t415, u8.t258, u8.t259, u8.t260, u8.t261, u8.t262, u8.t263, u8.t2...1300
Computing Next relation with stutter on 7.59032e+08 deadlock states
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin1141625172332431242;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1141625172332431242;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-22 02:22:36] [INFO ] Applying decomposition
[2024-05-22 02:22:36] [INFO ] Flatten gal took : 27 ms
[2024-05-22 02:22:36] [INFO ] Decomposing Gal with order
[2024-05-22 02:22:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:22:36] [INFO ] Removed a total of 246 redundant transitions.
[2024-05-22 02:22:36] [INFO ] Flatten gal took : 104 ms
[2024-05-22 02:22:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 816 labels/synchronizations in 49 ms.
[2024-05-22 02:22:36] [INFO ] Time to serialize gal into /tmp/LTLFireability3771383079378937711.gal : 4 ms
[2024-05-22 02:22:36] [INFO ] Time to serialize properties into /tmp/LTLFireability4357666224426297324.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/LTLFireability3771383079378937711.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4357666224426297324.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...276
Read 3 LTL properties
Checking formula 0 : !((F(G("((i0.i0.i0.u5.p78==0)||(i1.i1.i1.u118.p511==0))"))))
Formula 0 simplified : GF!"((i0.i0.i0.u5.p78==0)||(i1.i1.i1.u118.p511==0))"
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin1141625172332431242;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1141625172332431242;'/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([]((LTLAPp2==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-22 02:46:19] [INFO ] Flatten gal took : 27 ms
[2024-05-22 02:46:19] [INFO ] Input system was already deterministic with 422 transitions.
[2024-05-22 02:46:19] [INFO ] Transformed 478 places.
[2024-05-22 02:46:19] [INFO ] Transformed 422 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 02:46:19] [INFO ] Time to serialize gal into /tmp/LTLFireability429065848220945590.gal : 2 ms
[2024-05-22 02:46:19] [INFO ] Time to serialize properties into /tmp/LTLFireability9269260947102422775.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/LTLFireability429065848220945590.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9269260947102422775.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...341
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("((p78==0)||(p511==0))"))))
Formula 0 simplified : GF!"((p78==0)||(p511==0))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 12544012 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16038904 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-60b"
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-60b, 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-171624208600473"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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