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.r175-smll-171636280000123.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 EisenbergMcGuire-PT-09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-171636280000123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 28K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.3M 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 EisenbergMcGuire-PT-09-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716563358595

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=EisenbergMcGuire-PT-09
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 15:09:21] [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-24 15:09:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:09:21] [INFO ] Load time of PNML (sax parser for PT used): 364 ms
[2024-05-24 15:09:21] [INFO ] Transformed 891 places.
[2024-05-24 15:09:21] [INFO ] Transformed 3888 transitions.
[2024-05-24 15:09:21] [INFO ] Found NUPN structural information;
[2024-05-24 15:09:22] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 599 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 891 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 891/891 places, 3888/3888 transitions.
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 68 place count 823 transition count 3276
Iterating global reduction 0 with 68 rules applied. Total rules applied 136 place count 823 transition count 3276
Applied a total of 136 rules in 237 ms. Remains 823 /891 variables (removed 68) and now considering 3276/3888 (removed 612) transitions.
[2024-05-24 15:09:22] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
// Phase 1: matrix 1197 rows 823 cols
[2024-05-24 15:09:22] [INFO ] Computed 28 invariants in 36 ms
[2024-05-24 15:09:24] [INFO ] Implicit Places using invariants in 1399 ms returned []
[2024-05-24 15:09:24] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
[2024-05-24 15:09:24] [INFO ] Invariant cache hit.
[2024-05-24 15:09:25] [INFO ] State equation strengthened by 388 read => feed constraints.
[2024-05-24 15:09:29] [INFO ] Implicit Places using invariants and state equation in 5682 ms returned []
Implicit Place search using SMT with State Equation took 7127 ms to find 0 implicit places.
[2024-05-24 15:09:29] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
[2024-05-24 15:09:29] [INFO ] Invariant cache hit.
[2024-05-24 15:09:31] [INFO ] Dead Transitions using invariants and state equation in 2031 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 823/891 places, 3276/3888 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9399 ms. Remains : 823/891 places, 3276/3888 transitions.
Support contains 60 out of 823 places after structural reductions.
[2024-05-24 15:09:32] [INFO ] Flatten gal took : 630 ms
[2024-05-24 15:09:33] [INFO ] Flatten gal took : 450 ms
[2024-05-24 15:09:34] [INFO ] Input system was already deterministic with 3276 transitions.
Support contains 57 out of 823 places (down from 60) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 771 ms. (steps per millisecond=12 ) properties (out of 36) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
[2024-05-24 15:09:35] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
[2024-05-24 15:09:35] [INFO ] Invariant cache hit.
[2024-05-24 15:09:35] [INFO ] [Real]Absence check using 19 positive place invariants in 30 ms returned sat
[2024-05-24 15:09:35] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 15:09:36] [INFO ] After 1067ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2024-05-24 15:09:37] [INFO ] [Nat]Absence check using 19 positive place invariants in 33 ms returned sat
[2024-05-24 15:09:37] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 12 ms returned sat
[2024-05-24 15:09:40] [INFO ] After 2318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2024-05-24 15:09:40] [INFO ] State equation strengthened by 388 read => feed constraints.
[2024-05-24 15:09:43] [INFO ] After 2676ms SMT Verify possible using 388 Read/Feed constraints in natural domain returned unsat :0 sat :27
[2024-05-24 15:09:43] [INFO ] Deduced a trap composed of 3 places in 296 ms of which 15 ms to minimize.
[2024-05-24 15:09:44] [INFO ] Deduced a trap composed of 3 places in 395 ms of which 2 ms to minimize.
[2024-05-24 15:09:44] [INFO ] Deduced a trap composed of 3 places in 276 ms of which 1 ms to minimize.
[2024-05-24 15:09:44] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 3 ms to minimize.
[2024-05-24 15:09:45] [INFO ] Deduced a trap composed of 32 places in 215 ms of which 1 ms to minimize.
[2024-05-24 15:09:45] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 1 ms to minimize.
[2024-05-24 15:09:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1942 ms
[2024-05-24 15:09:46] [INFO ] Deduced a trap composed of 63 places in 720 ms of which 2 ms to minimize.
[2024-05-24 15:09:47] [INFO ] Deduced a trap composed of 3 places in 684 ms of which 1 ms to minimize.
[2024-05-24 15:09:47] [INFO ] Deduced a trap composed of 59 places in 700 ms of which 1 ms to minimize.
[2024-05-24 15:09:48] [INFO ] Deduced a trap composed of 3 places in 328 ms of which 0 ms to minimize.
[2024-05-24 15:09:49] [INFO ] Deduced a trap composed of 50 places in 690 ms of which 1 ms to minimize.
[2024-05-24 15:09:49] [INFO ] Deduced a trap composed of 3 places in 686 ms of which 1 ms to minimize.
[2024-05-24 15:09:50] [INFO ] Deduced a trap composed of 44 places in 610 ms of which 1 ms to minimize.
[2024-05-24 15:09:50] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 0 ms to minimize.
[2024-05-24 15:09:50] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 1 ms to minimize.
[2024-05-24 15:09:51] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 0 ms to minimize.
[2024-05-24 15:09:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5737 ms
[2024-05-24 15:09:51] [INFO ] Deduced a trap composed of 68 places in 284 ms of which 1 ms to minimize.
[2024-05-24 15:09:51] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2024-05-24 15:09:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 656 ms
[2024-05-24 15:09:52] [INFO ] Deduced a trap composed of 39 places in 196 ms of which 1 ms to minimize.
[2024-05-24 15:09:52] [INFO ] Deduced a trap composed of 47 places in 142 ms of which 1 ms to minimize.
[2024-05-24 15:09:53] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 0 ms to minimize.
[2024-05-24 15:09:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 709 ms
[2024-05-24 15:09:53] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 1 ms to minimize.
[2024-05-24 15:09:53] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 0 ms to minimize.
[2024-05-24 15:09:53] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 0 ms to minimize.
[2024-05-24 15:09:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 624 ms
[2024-05-24 15:09:54] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 1 ms to minimize.
[2024-05-24 15:09:54] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-05-24 15:09:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 377 ms
[2024-05-24 15:09:54] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 1 ms to minimize.
[2024-05-24 15:09:54] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2024-05-24 15:09:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 420 ms
[2024-05-24 15:09:55] [INFO ] Deduced a trap composed of 84 places in 150 ms of which 0 ms to minimize.
[2024-05-24 15:09:55] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2024-05-24 15:09:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 439 ms
[2024-05-24 15:09:55] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 0 ms to minimize.
[2024-05-24 15:09:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2024-05-24 15:09:56] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 0 ms to minimize.
[2024-05-24 15:09:56] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 0 ms to minimize.
[2024-05-24 15:09:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 444 ms
[2024-05-24 15:09:56] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-05-24 15:09:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2024-05-24 15:09:57] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 6 ms to minimize.
[2024-05-24 15:09:57] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 1 ms to minimize.
[2024-05-24 15:09:57] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 1 ms to minimize.
[2024-05-24 15:09:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 634 ms
[2024-05-24 15:09:58] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 0 ms to minimize.
[2024-05-24 15:09:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2024-05-24 15:09:59] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 1 ms to minimize.
[2024-05-24 15:09:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2024-05-24 15:09:59] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 2 ms to minimize.
[2024-05-24 15:09:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2024-05-24 15:10:00] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 1 ms to minimize.
[2024-05-24 15:10:00] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 1 ms to minimize.
[2024-05-24 15:10:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 505 ms
[2024-05-24 15:10:00] [INFO ] After 19960ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :27
Attempting to minimize the solution found.
Minimization took 552 ms.
[2024-05-24 15:10:01] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :27
Fused 27 Parikh solutions to 26 different solutions.
Parikh walk visited 0 properties in 2890 ms.
Support contains 47 out of 823 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 248 Pre rules applied. Total rules applied 18 place count 814 transition count 3019
Deduced a syphon composed of 248 places in 3 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 2 with 496 rules applied. Total rules applied 514 place count 566 transition count 3019
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 516 place count 564 transition count 3001
Iterating global reduction 2 with 2 rules applied. Total rules applied 518 place count 564 transition count 3001
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 662 place count 492 transition count 2929
Applied a total of 662 rules in 454 ms. Remains 492 /823 variables (removed 331) and now considering 2929/3276 (removed 347) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 455 ms. Remains : 492/823 places, 2929/3276 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 501 ms. (steps per millisecond=19 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Interrupted probabilistic random walk after 79600 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{0=1, 1=1, 12=1, 16=1, 17=1}
Probabilistic random walk after 79600 steps, saw 56490 distinct states, run finished after 3002 ms. (steps per millisecond=26 ) properties seen :5
Running SMT prover for 22 properties.
[2024-05-24 15:10:08] [INFO ] Flow matrix only has 850 transitions (discarded 2079 similar events)
// Phase 1: matrix 850 rows 492 cols
[2024-05-24 15:10:08] [INFO ] Computed 28 invariants in 14 ms
[2024-05-24 15:10:08] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-24 15:10:08] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 15:10:08] [INFO ] After 393ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2024-05-24 15:10:09] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-24 15:10:09] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 15:10:10] [INFO ] After 1399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2024-05-24 15:10:10] [INFO ] State equation strengthened by 372 read => feed constraints.
[2024-05-24 15:10:12] [INFO ] After 1366ms SMT Verify possible using 372 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2024-05-24 15:10:12] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-24 15:10:12] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 0 ms to minimize.
[2024-05-24 15:10:12] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2024-05-24 15:10:12] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2024-05-24 15:10:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 718 ms
[2024-05-24 15:10:13] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 1 ms to minimize.
[2024-05-24 15:10:13] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-24 15:10:13] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 0 ms to minimize.
[2024-05-24 15:10:13] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-05-24 15:10:13] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 0 ms to minimize.
[2024-05-24 15:10:13] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 1 ms to minimize.
[2024-05-24 15:10:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1050 ms
[2024-05-24 15:10:14] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-05-24 15:10:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2024-05-24 15:10:14] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-05-24 15:10:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2024-05-24 15:10:14] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 0 ms to minimize.
[2024-05-24 15:10:14] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 1 ms to minimize.
[2024-05-24 15:10:14] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 0 ms to minimize.
[2024-05-24 15:10:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 552 ms
[2024-05-24 15:10:15] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 1 ms to minimize.
[2024-05-24 15:10:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2024-05-24 15:10:15] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 0 ms to minimize.
[2024-05-24 15:10:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2024-05-24 15:10:15] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 1 ms to minimize.
[2024-05-24 15:10:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2024-05-24 15:10:16] [INFO ] Deduced a trap composed of 19 places in 208 ms of which 0 ms to minimize.
[2024-05-24 15:10:16] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 1 ms to minimize.
[2024-05-24 15:10:16] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2024-05-24 15:10:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 618 ms
[2024-05-24 15:10:16] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 1 ms to minimize.
[2024-05-24 15:10:16] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 3 ms to minimize.
[2024-05-24 15:10:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 328 ms
[2024-05-24 15:10:17] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 1 ms to minimize.
[2024-05-24 15:10:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2024-05-24 15:10:17] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 0 ms to minimize.
[2024-05-24 15:10:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2024-05-24 15:10:18] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 1 ms to minimize.
[2024-05-24 15:10:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2024-05-24 15:10:18] [INFO ] Deduced a trap composed of 34 places in 223 ms of which 1 ms to minimize.
[2024-05-24 15:10:18] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 1 ms to minimize.
[2024-05-24 15:10:19] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 1 ms to minimize.
[2024-05-24 15:10:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 833 ms
[2024-05-24 15:10:19] [INFO ] Deduced a trap composed of 13 places in 337 ms of which 1 ms to minimize.
[2024-05-24 15:10:19] [INFO ] Deduced a trap composed of 11 places in 281 ms of which 1 ms to minimize.
[2024-05-24 15:10:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 738 ms
[2024-05-24 15:10:20] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 0 ms to minimize.
[2024-05-24 15:10:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2024-05-24 15:10:20] [INFO ] After 9536ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 1761 ms.
[2024-05-24 15:10:22] [INFO ] After 13346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Parikh walk visited 0 properties in 272 ms.
Support contains 40 out of 492 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 492/492 places, 2929/2929 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 492 transition count 2926
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 489 transition count 2926
Applied a total of 6 rules in 167 ms. Remains 489 /492 variables (removed 3) and now considering 2926/2929 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 489/492 places, 2926/2929 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 533 ms. (steps per millisecond=18 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Interrupted probabilistic random walk after 89930 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89930 steps, saw 63317 distinct states, run finished after 3006 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 22 properties.
[2024-05-24 15:10:26] [INFO ] Flow matrix only has 847 transitions (discarded 2079 similar events)
// Phase 1: matrix 847 rows 489 cols
[2024-05-24 15:10:26] [INFO ] Computed 28 invariants in 5 ms
[2024-05-24 15:10:26] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-24 15:10:26] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 15:10:26] [INFO ] After 349ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2024-05-24 15:10:26] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-24 15:10:26] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 15:10:28] [INFO ] After 1122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2024-05-24 15:10:28] [INFO ] State equation strengthened by 372 read => feed constraints.
[2024-05-24 15:10:29] [INFO ] After 1264ms SMT Verify possible using 372 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2024-05-24 15:10:29] [INFO ] Deduced a trap composed of 66 places in 272 ms of which 1 ms to minimize.
[2024-05-24 15:10:30] [INFO ] Deduced a trap composed of 74 places in 222 ms of which 0 ms to minimize.
[2024-05-24 15:10:30] [INFO ] Deduced a trap composed of 45 places in 215 ms of which 0 ms to minimize.
[2024-05-24 15:10:30] [INFO ] Deduced a trap composed of 3 places in 217 ms of which 0 ms to minimize.
[2024-05-24 15:10:31] [INFO ] Deduced a trap composed of 29 places in 258 ms of which 1 ms to minimize.
[2024-05-24 15:10:31] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 0 ms to minimize.
[2024-05-24 15:10:31] [INFO ] Deduced a trap composed of 65 places in 184 ms of which 0 ms to minimize.
[2024-05-24 15:10:31] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 0 ms to minimize.
[2024-05-24 15:10:31] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 1 ms to minimize.
[2024-05-24 15:10:31] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2024-05-24 15:10:32] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2375 ms
[2024-05-24 15:10:32] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 0 ms to minimize.
[2024-05-24 15:10:32] [INFO ] Deduced a trap composed of 3 places in 267 ms of which 0 ms to minimize.
[2024-05-24 15:10:32] [INFO ] Deduced a trap composed of 3 places in 208 ms of which 0 ms to minimize.
[2024-05-24 15:10:33] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 0 ms to minimize.
[2024-05-24 15:10:33] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 1 ms to minimize.
[2024-05-24 15:10:33] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 1 ms to minimize.
[2024-05-24 15:10:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1414 ms
[2024-05-24 15:10:33] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-24 15:10:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2024-05-24 15:10:33] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 1 ms to minimize.
[2024-05-24 15:10:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2024-05-24 15:10:34] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 0 ms to minimize.
[2024-05-24 15:10:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2024-05-24 15:10:34] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 0 ms to minimize.
[2024-05-24 15:10:34] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 0 ms to minimize.
[2024-05-24 15:10:34] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-05-24 15:10:34] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2024-05-24 15:10:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 618 ms
[2024-05-24 15:10:34] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-24 15:10:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2024-05-24 15:10:35] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2024-05-24 15:10:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2024-05-24 15:10:35] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 0 ms to minimize.
[2024-05-24 15:10:35] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2024-05-24 15:10:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 319 ms
[2024-05-24 15:10:35] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 1 ms to minimize.
[2024-05-24 15:10:35] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2024-05-24 15:10:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 303 ms
[2024-05-24 15:10:36] [INFO ] Deduced a trap composed of 18 places in 300 ms of which 0 ms to minimize.
[2024-05-24 15:10:36] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2024-05-24 15:10:36] [INFO ] Deduced a trap composed of 54 places in 177 ms of which 0 ms to minimize.
[2024-05-24 15:10:37] [INFO ] Deduced a trap composed of 50 places in 254 ms of which 1 ms to minimize.
[2024-05-24 15:10:37] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 0 ms to minimize.
[2024-05-24 15:10:37] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 1 ms to minimize.
[2024-05-24 15:10:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1408 ms
[2024-05-24 15:10:38] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
[2024-05-24 15:10:38] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 0 ms to minimize.
[2024-05-24 15:10:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 264 ms
[2024-05-24 15:10:38] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 1 ms to minimize.
[2024-05-24 15:10:38] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
[2024-05-24 15:10:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 285 ms
[2024-05-24 15:10:38] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-24 15:10:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2024-05-24 15:10:38] [INFO ] After 10603ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 1342 ms.
[2024-05-24 15:10:40] [INFO ] After 13626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Fused 22 Parikh solutions to 21 different solutions.
Parikh walk visited 0 properties in 318 ms.
Support contains 40 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 2926/2926 transitions.
Applied a total of 0 rules in 191 ms. Remains 489 /489 variables (removed 0) and now considering 2926/2926 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 489/489 places, 2926/2926 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 2926/2926 transitions.
Applied a total of 0 rules in 276 ms. Remains 489 /489 variables (removed 0) and now considering 2926/2926 (removed 0) transitions.
[2024-05-24 15:10:41] [INFO ] Flow matrix only has 847 transitions (discarded 2079 similar events)
[2024-05-24 15:10:41] [INFO ] Invariant cache hit.
[2024-05-24 15:10:41] [INFO ] Implicit Places using invariants in 784 ms returned []
[2024-05-24 15:10:41] [INFO ] Flow matrix only has 847 transitions (discarded 2079 similar events)
[2024-05-24 15:10:41] [INFO ] Invariant cache hit.
[2024-05-24 15:10:42] [INFO ] State equation strengthened by 372 read => feed constraints.
[2024-05-24 15:10:45] [INFO ] Implicit Places using invariants and state equation in 3294 ms returned []
Implicit Place search using SMT with State Equation took 4080 ms to find 0 implicit places.
[2024-05-24 15:10:45] [INFO ] Redundant transitions in 223 ms returned []
[2024-05-24 15:10:45] [INFO ] Flow matrix only has 847 transitions (discarded 2079 similar events)
[2024-05-24 15:10:45] [INFO ] Invariant cache hit.
[2024-05-24 15:10:46] [INFO ] Dead Transitions using invariants and state equation in 1527 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6112 ms. Remains : 489/489 places, 2926/2926 transitions.
Graph (trivial) has 2345 edges and 489 vertex of which 81 / 489 are part of one of the 9 SCC in 6 ms
Free SCC test removed 72 places
Drop transitions removed 275 transitions
Ensure Unique test removed 2032 transitions
Reduce isomorphic transitions removed 2307 transitions.
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 417 transition count 536
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 167 place count 334 transition count 536
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 167 place count 334 transition count 519
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 208 place count 310 transition count 519
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 464 place count 182 transition count 391
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 2 with 47 rules applied. Total rules applied 511 place count 182 transition count 344
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 515 place count 180 transition count 344
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 517 place count 180 transition count 342
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 4 with 19 rules applied. Total rules applied 536 place count 180 transition count 323
Free-agglomeration rule applied 88 times.
Iterating global reduction 4 with 88 rules applied. Total rules applied 624 place count 180 transition count 235
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 4 with 88 rules applied. Total rules applied 712 place count 92 transition count 235
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 720 place count 92 transition count 235
Applied a total of 720 rules in 69 ms. Remains 92 /489 variables (removed 397) and now considering 235/2926 (removed 2691) transitions.
Running SMT prover for 22 properties.
// Phase 1: matrix 235 rows 92 cols
[2024-05-24 15:10:47] [INFO ] Computed 21 invariants in 3 ms
[2024-05-24 15:10:47] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-24 15:10:47] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-24 15:10:47] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2024-05-24 15:10:47] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-24 15:10:47] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-24 15:10:47] [INFO ] After 338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2024-05-24 15:10:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 15:10:47] [INFO ] After 242ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2024-05-24 15:10:48] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-24 15:10:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-05-24 15:10:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-24 15:10:48] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-24 15:10:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 62 ms
[2024-05-24 15:10:48] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-05-24 15:10:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-05-24 15:10:48] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-24 15:10:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-05-24 15:10:48] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-24 15:10:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2024-05-24 15:10:48] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-24 15:10:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-05-24 15:10:48] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-24 15:10:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-05-24 15:10:48] [INFO ] After 844ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 246 ms.
[2024-05-24 15:10:48] [INFO ] After 1646ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 6 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 814 transition count 3015
Deduced a syphon composed of 252 places in 3 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 562 transition count 3015
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 526 place count 558 transition count 2979
Iterating global reduction 2 with 4 rules applied. Total rules applied 530 place count 558 transition count 2979
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 674 place count 486 transition count 2907
Applied a total of 674 rules in 343 ms. Remains 486 /823 variables (removed 337) and now considering 2907/3276 (removed 369) transitions.
[2024-05-24 15:10:49] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 15:10:49] [INFO ] Computed 28 invariants in 4 ms
[2024-05-24 15:10:50] [INFO ] Implicit Places using invariants in 695 ms returned []
[2024-05-24 15:10:50] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:10:50] [INFO ] Invariant cache hit.
[2024-05-24 15:10:50] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:10:53] [INFO ] Implicit Places using invariants and state equation in 3531 ms returned []
Implicit Place search using SMT with State Equation took 4239 ms to find 0 implicit places.
[2024-05-24 15:10:53] [INFO ] Redundant transitions in 208 ms returned []
[2024-05-24 15:10:53] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:10:53] [INFO ] Invariant cache hit.
[2024-05-24 15:10:56] [INFO ] Dead Transitions using invariants and state equation in 2158 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 486/823 places, 2907/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6958 ms. Remains : 486/823 places, 2907/3276 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 289 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-00 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 s4 1) (EQ s23 1) (EQ s335 1)) (AND (EQ s6 1) (EQ s28 1) (EQ s357 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]]
Product exploration explored 100000 steps with 0 reset in 716 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 4 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-00 finished in 8056 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))))'
Support contains 5 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 814 transition count 3016
Deduced a syphon composed of 251 places in 4 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 563 transition count 3016
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 524 place count 559 transition count 2980
Iterating global reduction 2 with 4 rules applied. Total rules applied 528 place count 559 transition count 2980
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 672 place count 487 transition count 2908
Applied a total of 672 rules in 343 ms. Remains 487 /823 variables (removed 336) and now considering 2908/3276 (removed 368) transitions.
[2024-05-24 15:10:57] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-05-24 15:10:57] [INFO ] Computed 28 invariants in 5 ms
[2024-05-24 15:10:58] [INFO ] Implicit Places using invariants in 789 ms returned []
[2024-05-24 15:10:58] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:10:58] [INFO ] Invariant cache hit.
[2024-05-24 15:10:58] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:11:01] [INFO ] Implicit Places using invariants and state equation in 3519 ms returned []
Implicit Place search using SMT with State Equation took 4317 ms to find 0 implicit places.
[2024-05-24 15:11:01] [INFO ] Redundant transitions in 99 ms returned []
[2024-05-24 15:11:01] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:11:01] [INFO ] Invariant cache hit.
[2024-05-24 15:11:03] [INFO ] Dead Transitions using invariants and state equation in 1969 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/823 places, 2908/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6750 ms. Remains : 487/823 places, 2908/3276 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (EQ s6 0) (EQ s28 0) (EQ s327 0)) (EQ s18 1) (EQ s379 1)), p1:(OR (NEQ s6 1) (NEQ s28 1) (NEQ s327 1))], nbAcceptance=2, 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 0 reset in 470 ms.
Product exploration explored 100000 steps with 0 reset in 515 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 165 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 187490 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 187490 steps, saw 123150 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :2
Running SMT prover for 2 properties.
[2024-05-24 15:11:08] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:11:08] [INFO ] Invariant cache hit.
[2024-05-24 15:11:08] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-24 15:11:08] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2024-05-24 15:11:08] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 15:11:09] [INFO ] After 295ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-24 15:11:09] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:11:09] [INFO ] After 134ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-24 15:11:09] [INFO ] Deduced a trap composed of 3 places in 371 ms of which 1 ms to minimize.
[2024-05-24 15:11:10] [INFO ] Deduced a trap composed of 3 places in 314 ms of which 0 ms to minimize.
[2024-05-24 15:11:10] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 0 ms to minimize.
[2024-05-24 15:11:10] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 1 ms to minimize.
[2024-05-24 15:11:10] [INFO ] Deduced a trap composed of 3 places in 213 ms of which 0 ms to minimize.
[2024-05-24 15:11:11] [INFO ] Deduced a trap composed of 39 places in 209 ms of which 0 ms to minimize.
[2024-05-24 15:11:11] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 1 ms to minimize.
[2024-05-24 15:11:11] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 1 ms to minimize.
[2024-05-24 15:11:11] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 0 ms to minimize.
[2024-05-24 15:11:11] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2024-05-24 15:11:11] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-24 15:11:11] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-05-24 15:11:11] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2647 ms
[2024-05-24 15:11:12] [INFO ] After 2834ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-24 15:11:12] [INFO ] After 3324ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 116 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 487/487 places, 2908/2908 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 344810 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 344810 steps, saw 215404 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:11:15] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:11:15] [INFO ] Invariant cache hit.
[2024-05-24 15:11:15] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-24 15:11:15] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 8 ms returned sat
[2024-05-24 15:11:15] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:11:15] [INFO ] [Nat]Absence check using 19 positive place invariants in 17 ms returned sat
[2024-05-24 15:11:15] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 8 ms returned sat
[2024-05-24 15:11:15] [INFO ] After 381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:11:15] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:11:16] [INFO ] After 142ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:11:16] [INFO ] Deduced a trap composed of 3 places in 366 ms of which 1 ms to minimize.
[2024-05-24 15:11:16] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 1 ms to minimize.
[2024-05-24 15:11:17] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 0 ms to minimize.
[2024-05-24 15:11:17] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 2 ms to minimize.
[2024-05-24 15:11:17] [INFO ] Deduced a trap composed of 3 places in 302 ms of which 1 ms to minimize.
[2024-05-24 15:11:17] [INFO ] Deduced a trap composed of 39 places in 239 ms of which 1 ms to minimize.
[2024-05-24 15:11:18] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 0 ms to minimize.
[2024-05-24 15:11:18] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 1 ms to minimize.
[2024-05-24 15:11:18] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 0 ms to minimize.
[2024-05-24 15:11:18] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 1 ms to minimize.
[2024-05-24 15:11:18] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-05-24 15:11:18] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 1 ms to minimize.
[2024-05-24 15:11:18] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2817 ms
[2024-05-24 15:11:18] [INFO ] After 3022ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2024-05-24 15:11:19] [INFO ] After 3640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 180 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 487/487 places, 2908/2908 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 189 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2024-05-24 15:11:19] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:11:19] [INFO ] Invariant cache hit.
[2024-05-24 15:11:20] [INFO ] Implicit Places using invariants in 926 ms returned []
[2024-05-24 15:11:20] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:11:20] [INFO ] Invariant cache hit.
[2024-05-24 15:11:20] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:11:24] [INFO ] Implicit Places using invariants and state equation in 3786 ms returned []
Implicit Place search using SMT with State Equation took 4716 ms to find 0 implicit places.
[2024-05-24 15:11:24] [INFO ] Redundant transitions in 170 ms returned []
[2024-05-24 15:11:24] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:11:24] [INFO ] Invariant cache hit.
[2024-05-24 15:11:26] [INFO ] Dead Transitions using invariants and state equation in 1744 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6828 ms. Remains : 487/487 places, 2908/2908 transitions.
Graph (trivial) has 2699 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 516
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 516
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 195 place count 318 transition count 497
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 242 place count 290 transition count 497
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 526 place count 148 transition count 355
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 596 place count 148 transition count 285
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 614 place count 139 transition count 300
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 622 place count 139 transition count 292
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 631 place count 139 transition count 283
Free-agglomeration rule applied 65 times.
Iterating global reduction 4 with 65 rules applied. Total rules applied 696 place count 139 transition count 218
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 4 with 65 rules applied. Total rules applied 761 place count 74 transition count 218
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 772 place count 74 transition count 218
Applied a total of 772 rules in 41 ms. Remains 74 /487 variables (removed 413) and now considering 218/2908 (removed 2690) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 218 rows 74 cols
[2024-05-24 15:11:26] [INFO ] Computed 19 invariants in 3 ms
[2024-05-24 15:11:26] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 15:11:26] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:11:26] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 15:11:26] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:11:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 15:11:26] [INFO ] After 17ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:11:26] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-24 15:11:26] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-24 15:11:26] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-05-24 15:11:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 83 ms
[2024-05-24 15:11:26] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-24 15:11:26] [INFO ] After 241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 217 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1)]
Support contains 3 out of 487 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 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 238 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2024-05-24 15:11:27] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-05-24 15:11:27] [INFO ] Computed 28 invariants in 6 ms
[2024-05-24 15:11:28] [INFO ] Implicit Places using invariants in 1264 ms returned []
[2024-05-24 15:11:28] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:11:28] [INFO ] Invariant cache hit.
[2024-05-24 15:11:28] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:11:31] [INFO ] Implicit Places using invariants and state equation in 3612 ms returned []
Implicit Place search using SMT with State Equation took 4881 ms to find 0 implicit places.
[2024-05-24 15:11:32] [INFO ] Redundant transitions in 167 ms returned []
[2024-05-24 15:11:32] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:11:32] [INFO ] Invariant cache hit.
[2024-05-24 15:11:34] [INFO ] Dead Transitions using invariants and state equation in 2309 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7606 ms. Remains : 487/487 places, 2908/2908 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 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 34 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 333750 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 333750 steps, saw 208988 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:11:37] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:11:37] [INFO ] Invariant cache hit.
[2024-05-24 15:11:37] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2024-05-24 15:11:37] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 8 ms returned sat
[2024-05-24 15:11:38] [INFO ] After 497ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:11:38] [INFO ] [Nat]Absence check using 19 positive place invariants in 17 ms returned sat
[2024-05-24 15:11:38] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 8 ms returned sat
[2024-05-24 15:11:38] [INFO ] After 375ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:11:38] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:11:38] [INFO ] After 138ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:11:39] [INFO ] Deduced a trap composed of 3 places in 354 ms of which 1 ms to minimize.
[2024-05-24 15:11:39] [INFO ] Deduced a trap composed of 3 places in 298 ms of which 1 ms to minimize.
[2024-05-24 15:11:39] [INFO ] Deduced a trap composed of 3 places in 214 ms of which 1 ms to minimize.
[2024-05-24 15:11:39] [INFO ] Deduced a trap composed of 3 places in 200 ms of which 1 ms to minimize.
[2024-05-24 15:11:40] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2024-05-24 15:11:40] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2024-05-24 15:11:40] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2024-05-24 15:11:40] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1690 ms
[2024-05-24 15:11:40] [INFO ] After 1877ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2024-05-24 15:11:40] [INFO ] After 2520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 487 transition count 2907
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 486 transition count 2907
Applied a total of 2 rules in 130 ms. Remains 486 /487 variables (removed 1) and now considering 2907/2908 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 486/487 places, 2907/2908 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 343000 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 343000 steps, saw 214291 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:11:43] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 15:11:43] [INFO ] Computed 28 invariants in 7 ms
[2024-05-24 15:11:43] [INFO ] [Real]Absence check using 19 positive place invariants in 20 ms returned sat
[2024-05-24 15:11:43] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 9 ms returned sat
[2024-05-24 15:11:44] [INFO ] After 609ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:11:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-05-24 15:11:44] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2024-05-24 15:11:44] [INFO ] After 436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:11:44] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:11:45] [INFO ] After 184ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:11:45] [INFO ] Deduced a trap composed of 3 places in 245 ms of which 0 ms to minimize.
[2024-05-24 15:11:45] [INFO ] Deduced a trap composed of 3 places in 201 ms of which 1 ms to minimize.
[2024-05-24 15:11:45] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 0 ms to minimize.
[2024-05-24 15:11:46] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 0 ms to minimize.
[2024-05-24 15:11:46] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 1 ms to minimize.
[2024-05-24 15:11:46] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2024-05-24 15:11:46] [INFO ] Deduced a trap composed of 3 places in 197 ms of which 0 ms to minimize.
[2024-05-24 15:11:46] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 1 ms to minimize.
[2024-05-24 15:11:46] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 1 ms to minimize.
[2024-05-24 15:11:47] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 0 ms to minimize.
[2024-05-24 15:11:47] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-24 15:11:47] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2091 ms
[2024-05-24 15:11:47] [INFO ] After 2341ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-24 15:11:47] [INFO ] After 2968ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 178 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 176 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 15:11:47] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:11:47] [INFO ] Invariant cache hit.
[2024-05-24 15:11:48] [INFO ] Implicit Places using invariants in 955 ms returned []
[2024-05-24 15:11:48] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:11:48] [INFO ] Invariant cache hit.
[2024-05-24 15:11:49] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:11:52] [INFO ] Implicit Places using invariants and state equation in 3392 ms returned []
Implicit Place search using SMT with State Equation took 4350 ms to find 0 implicit places.
[2024-05-24 15:11:52] [INFO ] Redundant transitions in 101 ms returned []
[2024-05-24 15:11:52] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:11:52] [INFO ] Invariant cache hit.
[2024-05-24 15:11:53] [INFO ] Dead Transitions using invariants and state equation in 1494 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6132 ms. Remains : 486/486 places, 2907/2907 transitions.
Graph (trivial) has 2702 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 2 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 414 transition count 515
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 317 transition count 515
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 195 place count 317 transition count 496
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 242 place count 289 transition count 496
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 528 place count 146 transition count 353
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 598 place count 146 transition count 283
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 614 place count 138 transition count 283
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 622 place count 138 transition count 275
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 631 place count 138 transition count 266
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 704 place count 138 transition count 193
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 777 place count 65 transition count 193
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 786 place count 65 transition count 193
Applied a total of 786 rules in 45 ms. Remains 65 /486 variables (removed 421) and now considering 193/2907 (removed 2714) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 65 cols
[2024-05-24 15:11:53] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 15:11:53] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 15:11:53] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:11:53] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 15:11:53] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:11:53] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 15:11:53] [INFO ] After 13ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:11:53] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-24 15:11:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-24 15:11:53] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-24 15:11:53] [INFO ] After 166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 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 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 310 ms.
Product exploration explored 100000 steps with 0 reset in 368 ms.
Built C files in :
/tmp/ltsmin16127949909223373578
[2024-05-24 15:11:54] [INFO ] Too many transitions (2908) to apply POR reductions. Disabling POR matrices.
[2024-05-24 15:11:55] [INFO ] Built C files in 119ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16127949909223373578
Running compilation step : cd /tmp/ltsmin16127949909223373578;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16127949909223373578;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16127949909223373578;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 487 transition count 2907
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 486 transition count 2907
Applied a total of 2 rules in 118 ms. Remains 486 /487 variables (removed 1) and now considering 2907/2908 (removed 1) transitions.
[2024-05-24 15:11:58] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 15:11:58] [INFO ] Computed 28 invariants in 23 ms
[2024-05-24 15:11:59] [INFO ] Implicit Places using invariants in 824 ms returned []
[2024-05-24 15:11:59] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:11:59] [INFO ] Invariant cache hit.
[2024-05-24 15:11:59] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:12:03] [INFO ] Implicit Places using invariants and state equation in 3947 ms returned []
Implicit Place search using SMT with State Equation took 4775 ms to find 0 implicit places.
[2024-05-24 15:12:03] [INFO ] Redundant transitions in 99 ms returned []
[2024-05-24 15:12:03] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:12:03] [INFO ] Invariant cache hit.
[2024-05-24 15:12:05] [INFO ] Dead Transitions using invariants and state equation in 1913 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 486/487 places, 2907/2908 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6915 ms. Remains : 486/487 places, 2907/2908 transitions.
Built C files in :
/tmp/ltsmin18184359492810070967
[2024-05-24 15:12:05] [INFO ] Too many transitions (2907) to apply POR reductions. Disabling POR matrices.
[2024-05-24 15:12:05] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18184359492810070967
Running compilation step : cd /tmp/ltsmin18184359492810070967;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18184359492810070967;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18184359492810070967;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 15:12:08] [INFO ] Flatten gal took : 215 ms
[2024-05-24 15:12:08] [INFO ] Flatten gal took : 120 ms
[2024-05-24 15:12:08] [INFO ] Time to serialize gal into /tmp/LTL13267999953713874708.gal : 32 ms
[2024-05-24 15:12:08] [INFO ] Time to serialize properties into /tmp/LTL18148743459741463681.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/LTL13267999953713874708.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8364032473194149414.hoa' '-atoms' '/tmp/LTL18148743459741463681.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/LTL18148743459741463681.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8364032473194149414.hoa
Detected timeout of ITS tools.
[2024-05-24 15:12:24] [INFO ] Flatten gal took : 203 ms
[2024-05-24 15:12:24] [INFO ] Flatten gal took : 198 ms
[2024-05-24 15:12:24] [INFO ] Time to serialize gal into /tmp/LTL5009162847066143013.gal : 51 ms
[2024-05-24 15:12:24] [INFO ] Time to serialize properties into /tmp/LTL16117939364851697428.ltl : 24 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/LTL5009162847066143013.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16117939364851697428.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(((((turn_6==0)||(flag_6_waiting==0))||(p25_3_7==0))&&(flag_3_idle==1))&&(p33_0_3==1))"))||(G("(((turn_6!=1)||(flag_6_waiting...181
Formula 0 simplified : G(F!"(((((turn_6==0)||(flag_6_waiting==0))||(p25_3_7==0))&&(flag_3_idle==1))&&(p33_0_3==1))" & F!"(((turn_6!=1)||(flag_6_waiting!=1)...173
Detected timeout of ITS tools.
[2024-05-24 15:12:40] [INFO ] Flatten gal took : 277 ms
[2024-05-24 15:12:40] [INFO ] Applying decomposition
[2024-05-24 15:12:40] [INFO ] Flatten gal took : 328 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/graph6766996476642794534.txt' '-o' '/tmp/graph6766996476642794534.bin' '-w' '/tmp/graph6766996476642794534.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6766996476642794534.bin' '-l' '-1' '-v' '-w' '/tmp/graph6766996476642794534.weights' '-q' '0' '-e' '0.001'
[2024-05-24 15:12:41] [INFO ] Decomposing Gal with order
[2024-05-24 15:12:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 15:12:42] [INFO ] Removed a total of 6296 redundant transitions.
[2024-05-24 15:12:42] [INFO ] Flatten gal took : 933 ms
[2024-05-24 15:12:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 708 labels/synchronizations in 185 ms.
[2024-05-24 15:12:42] [INFO ] Time to serialize gal into /tmp/LTL16364035934820407669.gal : 25 ms
[2024-05-24 15:12:42] [INFO ] Time to serialize properties into /tmp/LTL349594275300954340.ltl : 60 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/LTL16364035934820407669.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL349594275300954340.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("(((((i17.u0.turn_6==0)||(i1.u5.flag_6_waiting==0))||(i15.u3.p25_3_7==0))&&(i8.u1.flag_3_idle==1))&&(i8.u19.p33_0_3==1))"))||(...234
Formula 0 simplified : G(F!"(((((i17.u0.turn_6==0)||(i1.u5.flag_6_waiting==0))||(i15.u3.p25_3_7==0))&&(i8.u1.flag_3_idle==1))&&(i8.u19.p33_0_3==1))" & F!"(...226
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9461903381869644383
[2024-05-24 15:12:57] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9461903381869644383
Running compilation step : cd /tmp/ltsmin9461903381869644383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9461903381869644383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9461903381869644383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-01 finished in 123688 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)||(G(p2)&&p1)) U (!p3&&F(p4))))'
Support contains 12 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 819 transition count 3240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 819 transition count 3240
Applied a total of 8 rules in 44 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2024-05-24 15:13:00] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
// Phase 1: matrix 1161 rows 819 cols
[2024-05-24 15:13:00] [INFO ] Computed 28 invariants in 5 ms
[2024-05-24 15:13:01] [INFO ] Implicit Places using invariants in 764 ms returned []
[2024-05-24 15:13:01] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 15:13:01] [INFO ] Invariant cache hit.
[2024-05-24 15:13:02] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:13:07] [INFO ] Implicit Places using invariants and state equation in 5989 ms returned []
Implicit Place search using SMT with State Equation took 6759 ms to find 0 implicit places.
[2024-05-24 15:13:07] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 15:13:07] [INFO ] Invariant cache hit.
[2024-05-24 15:13:09] [INFO ] Dead Transitions using invariants and state equation in 2115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 819/823 places, 3240/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8934 ms. Remains : 819/823 places, 3240/3276 transitions.
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p4) p3), (NOT p0), (NOT p4), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={0} source=0 dest: 0}, { cond=(OR (AND p3 (NOT p1)) (AND p3 (NOT p2))), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p4)), acceptance={0} source=0 dest: 2}, { cond=(AND p3 p1 p2), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p4), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(AND (EQ s5 1) (EQ s24 1) (EQ s576 1)), p1:(AND (EQ s0 1) (EQ s10 1) (EQ s600 1)), p2:(OR (AND (EQ s4 1) (EQ s22 1) (EQ s587 1)) (AND (EQ s0 1) (EQ s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 296 ms.
Stack based approach found an accepted trace after 264 steps with 0 reset with depth 265 and stack size 265 in 2 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-02 finished in 9550 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(p1))&&F(p2)&&p0)))'
Support contains 4 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 819 transition count 3240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 819 transition count 3240
Applied a total of 8 rules in 56 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2024-05-24 15:13:10] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 15:13:10] [INFO ] Invariant cache hit.
[2024-05-24 15:13:11] [INFO ] Implicit Places using invariants in 882 ms returned []
[2024-05-24 15:13:11] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 15:13:11] [INFO ] Invariant cache hit.
[2024-05-24 15:13:11] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:13:17] [INFO ] Implicit Places using invariants and state equation in 6587 ms returned []
Implicit Place search using SMT with State Equation took 7472 ms to find 0 implicit places.
[2024-05-24 15:13:17] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 15:13:17] [INFO ] Invariant cache hit.
[2024-05-24 15:13:19] [INFO ] Dead Transitions using invariants and state equation in 2049 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 819/823 places, 3240/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9580 ms. Remains : 819/823 places, 3240/3276 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(AND (EQ s7 1) (EQ s30 1) (EQ s613 1)), p0:(AND (EQ s7 1) (EQ s30 1) (EQ s613 1)), p2:(EQ s125 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-03 finished in 9784 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)||F(p1)))'
Support contains 6 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 819 transition count 3240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 819 transition count 3240
Applied a total of 8 rules in 42 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2024-05-24 15:13:20] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 15:13:20] [INFO ] Invariant cache hit.
[2024-05-24 15:13:21] [INFO ] Implicit Places using invariants in 870 ms returned []
[2024-05-24 15:13:21] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 15:13:21] [INFO ] Invariant cache hit.
[2024-05-24 15:13:21] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:13:28] [INFO ] Implicit Places using invariants and state equation in 7019 ms returned []
Implicit Place search using SMT with State Equation took 7890 ms to find 0 implicit places.
[2024-05-24 15:13:28] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 15:13:28] [INFO ] Invariant cache hit.
[2024-05-24 15:13:30] [INFO ] Dead Transitions using invariants and state equation in 2801 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 819/823 places, 3240/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10736 ms. Remains : 819/823 places, 3240/3276 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s6 1) (EQ s28 1) (EQ s553 1)), p0:(AND (EQ s2 1) (EQ s15 1) (EQ s583 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 293 ms.
Stack based approach found an accepted trace after 83 steps with 0 reset with depth 84 and stack size 84 in 1 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-04 finished in 11167 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 1 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 814 transition count 3016
Deduced a syphon composed of 251 places in 3 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 563 transition count 3016
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 524 place count 559 transition count 2980
Iterating global reduction 2 with 4 rules applied. Total rules applied 528 place count 559 transition count 2980
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 672 place count 487 transition count 2908
Applied a total of 672 rules in 216 ms. Remains 487 /823 variables (removed 336) and now considering 2908/3276 (removed 368) transitions.
[2024-05-24 15:13:31] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-05-24 15:13:31] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 15:13:32] [INFO ] Implicit Places using invariants in 1075 ms returned []
[2024-05-24 15:13:32] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:13:32] [INFO ] Invariant cache hit.
[2024-05-24 15:13:33] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:13:36] [INFO ] Implicit Places using invariants and state equation in 4334 ms returned []
Implicit Place search using SMT with State Equation took 5413 ms to find 0 implicit places.
[2024-05-24 15:13:37] [INFO ] Redundant transitions in 178 ms returned []
[2024-05-24 15:13:37] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:13:37] [INFO ] Invariant cache hit.
[2024-05-24 15:13:39] [INFO ] Dead Transitions using invariants and state equation in 1871 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/823 places, 2908/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7690 ms. Remains : 487/823 places, 2908/3276 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s156 1)], 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 0 reset in 312 ms.
Product exploration explored 100000 steps with 0 reset in 356 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 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 47 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Finished probabilistic random walk after 54308 steps, run visited all 1 properties in 741 ms. (steps per millisecond=73 )
Probabilistic random walk after 54308 steps, saw 39469 distinct states, run finished after 742 ms. (steps per millisecond=73 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 1 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 116 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2024-05-24 15:13:41] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:13:41] [INFO ] Invariant cache hit.
[2024-05-24 15:13:42] [INFO ] Implicit Places using invariants in 1000 ms returned []
[2024-05-24 15:13:42] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:13:42] [INFO ] Invariant cache hit.
[2024-05-24 15:13:42] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:13:46] [INFO ] Implicit Places using invariants and state equation in 4363 ms returned []
Implicit Place search using SMT with State Equation took 5367 ms to find 0 implicit places.
[2024-05-24 15:13:46] [INFO ] Redundant transitions in 100 ms returned []
[2024-05-24 15:13:46] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:13:46] [INFO ] Invariant cache hit.
[2024-05-24 15:13:48] [INFO ] Dead Transitions using invariants and state equation in 1997 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7587 ms. Remains : 487/487 places, 2908/2908 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 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 146 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 54308 steps, run visited all 1 properties in 569 ms. (steps per millisecond=95 )
Probabilistic random walk after 54308 steps, saw 39469 distinct states, run finished after 569 ms. (steps per millisecond=95 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 300 ms.
Product exploration explored 100000 steps with 0 reset in 351 ms.
Built C files in :
/tmp/ltsmin8888832255117794307
[2024-05-24 15:13:50] [INFO ] Too many transitions (2908) to apply POR reductions. Disabling POR matrices.
[2024-05-24 15:13:50] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8888832255117794307
Running compilation step : cd /tmp/ltsmin8888832255117794307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8888832255117794307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8888832255117794307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 107 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2024-05-24 15:13:53] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:13:53] [INFO ] Invariant cache hit.
[2024-05-24 15:13:54] [INFO ] Implicit Places using invariants in 810 ms returned []
[2024-05-24 15:13:54] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:13:54] [INFO ] Invariant cache hit.
[2024-05-24 15:13:54] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:13:57] [INFO ] Implicit Places using invariants and state equation in 3732 ms returned []
Implicit Place search using SMT with State Equation took 4544 ms to find 0 implicit places.
[2024-05-24 15:13:58] [INFO ] Redundant transitions in 94 ms returned []
[2024-05-24 15:13:58] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:13:58] [INFO ] Invariant cache hit.
[2024-05-24 15:13:59] [INFO ] Dead Transitions using invariants and state equation in 1560 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6315 ms. Remains : 487/487 places, 2908/2908 transitions.
Built C files in :
/tmp/ltsmin15942441988597060069
[2024-05-24 15:13:59] [INFO ] Too many transitions (2908) to apply POR reductions. Disabling POR matrices.
[2024-05-24 15:13:59] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15942441988597060069
Running compilation step : cd /tmp/ltsmin15942441988597060069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15942441988597060069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15942441988597060069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 15:14:02] [INFO ] Flatten gal took : 88 ms
[2024-05-24 15:14:03] [INFO ] Flatten gal took : 93 ms
[2024-05-24 15:14:03] [INFO ] Time to serialize gal into /tmp/LTL4977083612998579045.gal : 15 ms
[2024-05-24 15:14:03] [INFO ] Time to serialize properties into /tmp/LTL10793962927707679826.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/LTL4977083612998579045.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2608104451027390271.hoa' '-atoms' '/tmp/LTL10793962927707679826.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/LTL10793962927707679826.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2608104451027390271.hoa
Detected timeout of ITS tools.
[2024-05-24 15:14:18] [INFO ] Flatten gal took : 81 ms
[2024-05-24 15:14:18] [INFO ] Flatten gal took : 82 ms
[2024-05-24 15:14:18] [INFO ] Time to serialize gal into /tmp/LTL17644125438831647879.gal : 13 ms
[2024-05-24 15:14:18] [INFO ] Time to serialize properties into /tmp/LTL2940270456882216178.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/LTL17644125438831647879.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2940270456882216178.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(p34_2_6!=1)"))))
Formula 0 simplified : GF!"(p34_2_6!=1)"
Detected timeout of ITS tools.
[2024-05-24 15:14:33] [INFO ] Flatten gal took : 80 ms
[2024-05-24 15:14:33] [INFO ] Applying decomposition
[2024-05-24 15:14:33] [INFO ] Flatten gal took : 83 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/graph16014263954354187068.txt' '-o' '/tmp/graph16014263954354187068.bin' '-w' '/tmp/graph16014263954354187068.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16014263954354187068.bin' '-l' '-1' '-v' '-w' '/tmp/graph16014263954354187068.weights' '-q' '0' '-e' '0.001'
[2024-05-24 15:14:33] [INFO ] Decomposing Gal with order
[2024-05-24 15:14:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 15:14:34] [INFO ] Removed a total of 6310 redundant transitions.
[2024-05-24 15:14:34] [INFO ] Flatten gal took : 282 ms
[2024-05-24 15:14:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 669 labels/synchronizations in 75 ms.
[2024-05-24 15:14:34] [INFO ] Time to serialize gal into /tmp/LTL3295343162152305388.gal : 22 ms
[2024-05-24 15:14:34] [INFO ] Time to serialize properties into /tmp/LTL1908707671310316427.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/LTL3295343162152305388.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1908707671310316427.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("(i3.u78.p34_2_6!=1)"))))
Formula 0 simplified : GF!"(i3.u78.p34_2_6!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8814526518530310971
[2024-05-24 15:14:49] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8814526518530310971
Running compilation step : cd /tmp/ltsmin8814526518530310971;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8814526518530310971;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8814526518530310971;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-05 finished in 81140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Support contains 5 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 820 transition count 3249
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 820 transition count 3249
Applied a total of 6 rules in 42 ms. Remains 820 /823 variables (removed 3) and now considering 3249/3276 (removed 27) transitions.
[2024-05-24 15:14:52] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2024-05-24 15:14:52] [INFO ] Computed 28 invariants in 8 ms
[2024-05-24 15:14:53] [INFO ] Implicit Places using invariants in 1160 ms returned []
[2024-05-24 15:14:53] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 15:14:53] [INFO ] Invariant cache hit.
[2024-05-24 15:14:54] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:15:00] [INFO ] Implicit Places using invariants and state equation in 6902 ms returned []
Implicit Place search using SMT with State Equation took 8063 ms to find 0 implicit places.
[2024-05-24 15:15:00] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 15:15:00] [INFO ] Invariant cache hit.
[2024-05-24 15:15:03] [INFO ] Dead Transitions using invariants and state equation in 2706 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 820/823 places, 3249/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10813 ms. Remains : 820/823 places, 3249/3276 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s6 0) (EQ s207 0)), p0:(OR (EQ s5 0) (EQ s26 0) (EQ s617 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 336 ms.
Product exploration explored 100000 steps with 0 reset in 377 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 138170 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 138170 steps, saw 107584 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 15:15:07] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 15:15:07] [INFO ] Invariant cache hit.
[2024-05-24 15:15:07] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 15:15:08] [INFO ] [Nat]Absence check using 19 positive place invariants in 35 ms returned sat
[2024-05-24 15:15:08] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 11 ms returned sat
[2024-05-24 15:15:09] [INFO ] After 819ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-24 15:15:09] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:15:09] [INFO ] After 506ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-24 15:15:10] [INFO ] Deduced a trap composed of 64 places in 449 ms of which 1 ms to minimize.
[2024-05-24 15:15:10] [INFO ] Deduced a trap composed of 29 places in 458 ms of which 1 ms to minimize.
[2024-05-24 15:15:11] [INFO ] Deduced a trap composed of 41 places in 452 ms of which 0 ms to minimize.
[2024-05-24 15:15:11] [INFO ] Deduced a trap composed of 3 places in 503 ms of which 1 ms to minimize.
[2024-05-24 15:15:12] [INFO ] Deduced a trap composed of 30 places in 436 ms of which 1 ms to minimize.
[2024-05-24 15:15:12] [INFO ] Deduced a trap composed of 3 places in 432 ms of which 5 ms to minimize.
[2024-05-24 15:15:13] [INFO ] Deduced a trap composed of 62 places in 387 ms of which 0 ms to minimize.
[2024-05-24 15:15:13] [INFO ] Deduced a trap composed of 54 places in 472 ms of which 1 ms to minimize.
[2024-05-24 15:15:14] [INFO ] Deduced a trap composed of 114 places in 399 ms of which 1 ms to minimize.
[2024-05-24 15:15:14] [INFO ] Deduced a trap composed of 35 places in 397 ms of which 1 ms to minimize.
[2024-05-24 15:15:15] [INFO ] Deduced a trap composed of 3 places in 309 ms of which 0 ms to minimize.
[2024-05-24 15:15:15] [INFO ] Deduced a trap composed of 33 places in 271 ms of which 1 ms to minimize.
[2024-05-24 15:15:16] [INFO ] Deduced a trap composed of 43 places in 245 ms of which 0 ms to minimize.
[2024-05-24 15:15:16] [INFO ] Deduced a trap composed of 3 places in 193 ms of which 1 ms to minimize.
[2024-05-24 15:15:16] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 1 ms to minimize.
[2024-05-24 15:15:16] [INFO ] Deduced a trap composed of 50 places in 216 ms of which 1 ms to minimize.
[2024-05-24 15:15:17] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 0 ms to minimize.
[2024-05-24 15:15:17] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 0 ms to minimize.
[2024-05-24 15:15:17] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 7903 ms
[2024-05-24 15:15:17] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 0 ms to minimize.
[2024-05-24 15:15:18] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 0 ms to minimize.
[2024-05-24 15:15:18] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 1 ms to minimize.
[2024-05-24 15:15:18] [INFO ] Deduced a trap composed of 35 places in 207 ms of which 1 ms to minimize.
[2024-05-24 15:15:18] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 1 ms to minimize.
[2024-05-24 15:15:19] [INFO ] Deduced a trap composed of 82 places in 174 ms of which 1 ms to minimize.
[2024-05-24 15:15:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1562 ms
[2024-05-24 15:15:19] [INFO ] Deduced a trap composed of 87 places in 331 ms of which 1 ms to minimize.
[2024-05-24 15:15:19] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 0 ms to minimize.
[2024-05-24 15:15:20] [INFO ] Deduced a trap composed of 82 places in 256 ms of which 1 ms to minimize.
[2024-05-24 15:15:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 933 ms
[2024-05-24 15:15:20] [INFO ] After 11242ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 313 ms.
[2024-05-24 15:15:20] [INFO ] After 12690ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 62 ms.
Support contains 5 out of 820 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 811 transition count 2988
Deduced a syphon composed of 252 places in 2 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 559 transition count 2988
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 666 place count 487 transition count 2916
Applied a total of 666 rules in 182 ms. Remains 487 /820 variables (removed 333) and now considering 2916/3249 (removed 333) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 487/820 places, 2916/3249 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 175220 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 175220 steps, saw 115500 distinct states, run finished after 3004 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 15:15:24] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 15:15:24] [INFO ] Computed 28 invariants in 5 ms
[2024-05-24 15:15:24] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 15:15:24] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-24 15:15:24] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2024-05-24 15:15:24] [INFO ] After 415ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 15:15:24] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:15:25] [INFO ] After 241ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 15:15:25] [INFO ] Deduced a trap composed of 3 places in 210 ms of which 1 ms to minimize.
[2024-05-24 15:15:25] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 0 ms to minimize.
[2024-05-24 15:15:26] [INFO ] Deduced a trap composed of 3 places in 427 ms of which 1 ms to minimize.
[2024-05-24 15:15:26] [INFO ] Deduced a trap composed of 3 places in 418 ms of which 1 ms to minimize.
[2024-05-24 15:15:26] [INFO ] Deduced a trap composed of 17 places in 414 ms of which 1 ms to minimize.
[2024-05-24 15:15:27] [INFO ] Deduced a trap composed of 4 places in 332 ms of which 0 ms to minimize.
[2024-05-24 15:15:27] [INFO ] Deduced a trap composed of 25 places in 297 ms of which 1 ms to minimize.
[2024-05-24 15:15:28] [INFO ] Deduced a trap composed of 3 places in 307 ms of which 0 ms to minimize.
[2024-05-24 15:15:28] [INFO ] Deduced a trap composed of 31 places in 309 ms of which 1 ms to minimize.
[2024-05-24 15:15:28] [INFO ] Deduced a trap composed of 41 places in 305 ms of which 1 ms to minimize.
[2024-05-24 15:15:29] [INFO ] Deduced a trap composed of 31 places in 259 ms of which 0 ms to minimize.
[2024-05-24 15:15:29] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 1 ms to minimize.
[2024-05-24 15:15:29] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 1 ms to minimize.
[2024-05-24 15:15:29] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4673 ms
[2024-05-24 15:15:29] [INFO ] After 5220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 238 ms.
[2024-05-24 15:15:30] [INFO ] After 6039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 20 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 176 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 487/487 places, 2916/2916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 172 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 15:15:30] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:15:30] [INFO ] Invariant cache hit.
[2024-05-24 15:15:31] [INFO ] Implicit Places using invariants in 1193 ms returned []
[2024-05-24 15:15:31] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:15:31] [INFO ] Invariant cache hit.
[2024-05-24 15:15:32] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:15:37] [INFO ] Implicit Places using invariants and state equation in 5399 ms returned []
Implicit Place search using SMT with State Equation took 6596 ms to find 0 implicit places.
[2024-05-24 15:15:37] [INFO ] Redundant transitions in 166 ms returned []
[2024-05-24 15:15:37] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:15:37] [INFO ] Invariant cache hit.
[2024-05-24 15:15:39] [INFO ] Dead Transitions using invariants and state equation in 2571 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9514 ms. Remains : 487/487 places, 2916/2916 transitions.
Graph (trivial) has 2700 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions removed 277 transitions
Ensure Unique test removed 2024 transitions
Reduce isomorphic transitions removed 2301 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 518
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 518
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 318 transition count 500
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 292 transition count 500
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 1 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 525 place count 149 transition count 357
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 595 place count 149 transition count 287
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 611 place count 141 transition count 287
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 619 place count 141 transition count 279
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 629 place count 141 transition count 269
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 703 place count 141 transition count 195
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 777 place count 67 transition count 195
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 786 place count 67 transition count 195
Applied a total of 786 rules in 47 ms. Remains 67 /487 variables (removed 420) and now considering 195/2916 (removed 2721) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 195 rows 67 cols
[2024-05-24 15:15:40] [INFO ] Computed 20 invariants in 2 ms
[2024-05-24 15:15:40] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 15:15:40] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-24 15:15:40] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 15:15:40] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 15:15:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 15:15:40] [INFO ] After 52ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 15:15:40] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-24 15:15:40] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-24 15:15:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 79 ms
[2024-05-24 15:15:40] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 53 ms.
[2024-05-24 15:15:40] [INFO ] After 443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 180 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 820 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 811 transition count 2988
Deduced a syphon composed of 252 places in 5 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 559 transition count 2988
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 5 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 666 place count 487 transition count 2916
Applied a total of 666 rules in 293 ms. Remains 487 /820 variables (removed 333) and now considering 2916/3249 (removed 333) transitions.
[2024-05-24 15:15:41] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 15:15:41] [INFO ] Computed 28 invariants in 9 ms
[2024-05-24 15:15:42] [INFO ] Implicit Places using invariants in 1009 ms returned []
[2024-05-24 15:15:42] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:15:42] [INFO ] Invariant cache hit.
[2024-05-24 15:15:42] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:15:46] [INFO ] Implicit Places using invariants and state equation in 4492 ms returned []
Implicit Place search using SMT with State Equation took 5503 ms to find 0 implicit places.
[2024-05-24 15:15:46] [INFO ] Redundant transitions in 104 ms returned []
[2024-05-24 15:15:46] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:15:46] [INFO ] Invariant cache hit.
[2024-05-24 15:15:49] [INFO ] Dead Transitions using invariants and state equation in 2573 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/820 places, 2916/3249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8480 ms. Remains : 487/820 places, 2916/3249 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 113 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 147860 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 147860 steps, saw 98889 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 15:15:53] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:15:53] [INFO ] Invariant cache hit.
[2024-05-24 15:15:53] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 15:15:53] [INFO ] [Nat]Absence check using 19 positive place invariants in 21 ms returned sat
[2024-05-24 15:15:53] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 9 ms returned sat
[2024-05-24 15:15:54] [INFO ] After 613ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-24 15:15:54] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:15:54] [INFO ] After 363ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-24 15:15:55] [INFO ] Deduced a trap composed of 3 places in 509 ms of which 1 ms to minimize.
[2024-05-24 15:15:55] [INFO ] Deduced a trap composed of 27 places in 485 ms of which 1 ms to minimize.
[2024-05-24 15:15:56] [INFO ] Deduced a trap composed of 4 places in 488 ms of which 1 ms to minimize.
[2024-05-24 15:15:56] [INFO ] Deduced a trap composed of 3 places in 496 ms of which 1 ms to minimize.
[2024-05-24 15:15:57] [INFO ] Deduced a trap composed of 27 places in 472 ms of which 1 ms to minimize.
[2024-05-24 15:15:57] [INFO ] Deduced a trap composed of 3 places in 472 ms of which 1 ms to minimize.
[2024-05-24 15:15:58] [INFO ] Deduced a trap composed of 3 places in 346 ms of which 3 ms to minimize.
[2024-05-24 15:15:58] [INFO ] Deduced a trap composed of 3 places in 336 ms of which 1 ms to minimize.
[2024-05-24 15:15:58] [INFO ] Deduced a trap composed of 27 places in 221 ms of which 1 ms to minimize.
[2024-05-24 15:15:59] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 0 ms to minimize.
[2024-05-24 15:15:59] [INFO ] Deduced a trap composed of 63 places in 310 ms of which 1 ms to minimize.
[2024-05-24 15:15:59] [INFO ] Deduced a trap composed of 29 places in 352 ms of which 1 ms to minimize.
[2024-05-24 15:16:00] [INFO ] Deduced a trap composed of 40 places in 360 ms of which 1 ms to minimize.
[2024-05-24 15:16:00] [INFO ] Deduced a trap composed of 24 places in 357 ms of which 1 ms to minimize.
[2024-05-24 15:16:01] [INFO ] Deduced a trap composed of 29 places in 389 ms of which 1 ms to minimize.
[2024-05-24 15:16:01] [INFO ] Deduced a trap composed of 30 places in 356 ms of which 1 ms to minimize.
[2024-05-24 15:16:01] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 0 ms to minimize.
[2024-05-24 15:16:01] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2024-05-24 15:16:02] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 7512 ms
[2024-05-24 15:16:02] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 1 ms to minimize.
[2024-05-24 15:16:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 344 ms
[2024-05-24 15:16:02] [INFO ] Deduced a trap composed of 13 places in 283 ms of which 1 ms to minimize.
[2024-05-24 15:16:03] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 1 ms to minimize.
[2024-05-24 15:16:03] [INFO ] Deduced a trap composed of 52 places in 287 ms of which 1 ms to minimize.
[2024-05-24 15:16:03] [INFO ] Deduced a trap composed of 31 places in 286 ms of which 1 ms to minimize.
[2024-05-24 15:16:04] [INFO ] Deduced a trap composed of 33 places in 301 ms of which 2 ms to minimize.
[2024-05-24 15:16:04] [INFO ] Deduced a trap composed of 46 places in 228 ms of which 2 ms to minimize.
[2024-05-24 15:16:04] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 1 ms to minimize.
[2024-05-24 15:16:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2223 ms
[2024-05-24 15:16:04] [INFO ] After 10660ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 275 ms.
[2024-05-24 15:16:05] [INFO ] After 11824ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 169 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 487/487 places, 2916/2916 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 182120 steps, run timeout after 3006 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 182120 steps, saw 119641 distinct states, run finished after 3006 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 15:16:08] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:16:08] [INFO ] Invariant cache hit.
[2024-05-24 15:16:08] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 15:16:08] [INFO ] [Nat]Absence check using 19 positive place invariants in 23 ms returned sat
[2024-05-24 15:16:08] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 15:16:09] [INFO ] After 637ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 15:16:09] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:16:09] [INFO ] After 447ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 15:16:10] [INFO ] Deduced a trap composed of 44 places in 445 ms of which 1 ms to minimize.
[2024-05-24 15:16:11] [INFO ] Deduced a trap composed of 3 places in 448 ms of which 1 ms to minimize.
[2024-05-24 15:16:11] [INFO ] Deduced a trap composed of 36 places in 461 ms of which 1 ms to minimize.
[2024-05-24 15:16:11] [INFO ] Deduced a trap composed of 19 places in 304 ms of which 0 ms to minimize.
[2024-05-24 15:16:12] [INFO ] Deduced a trap composed of 3 places in 290 ms of which 3 ms to minimize.
[2024-05-24 15:16:12] [INFO ] Deduced a trap composed of 3 places in 255 ms of which 2 ms to minimize.
[2024-05-24 15:16:13] [INFO ] Deduced a trap composed of 3 places in 366 ms of which 1 ms to minimize.
[2024-05-24 15:16:13] [INFO ] Deduced a trap composed of 3 places in 222 ms of which 1 ms to minimize.
[2024-05-24 15:16:13] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 0 ms to minimize.
[2024-05-24 15:16:13] [INFO ] Deduced a trap composed of 33 places in 240 ms of which 1 ms to minimize.
[2024-05-24 15:16:14] [INFO ] Deduced a trap composed of 41 places in 318 ms of which 0 ms to minimize.
[2024-05-24 15:16:14] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 1 ms to minimize.
[2024-05-24 15:16:14] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 0 ms to minimize.
[2024-05-24 15:16:14] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 0 ms to minimize.
[2024-05-24 15:16:14] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 1 ms to minimize.
[2024-05-24 15:16:14] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4969 ms
[2024-05-24 15:16:15] [INFO ] Deduced a trap composed of 3 places in 529 ms of which 1 ms to minimize.
[2024-05-24 15:16:16] [INFO ] Deduced a trap composed of 69 places in 512 ms of which 1 ms to minimize.
[2024-05-24 15:16:16] [INFO ] Deduced a trap composed of 44 places in 456 ms of which 1 ms to minimize.
[2024-05-24 15:16:17] [INFO ] Deduced a trap composed of 76 places in 410 ms of which 1 ms to minimize.
[2024-05-24 15:16:18] [INFO ] Deduced a trap composed of 21 places in 679 ms of which 1 ms to minimize.
[2024-05-24 15:16:18] [INFO ] Deduced a trap composed of 24 places in 443 ms of which 1 ms to minimize.
[2024-05-24 15:16:18] [INFO ] Deduced a trap composed of 3 places in 355 ms of which 1 ms to minimize.
[2024-05-24 15:16:19] [INFO ] Deduced a trap composed of 24 places in 490 ms of which 1 ms to minimize.
[2024-05-24 15:16:19] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 1 ms to minimize.
[2024-05-24 15:16:20] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 1 ms to minimize.
[2024-05-24 15:16:20] [INFO ] Deduced a trap composed of 29 places in 241 ms of which 1 ms to minimize.
[2024-05-24 15:16:20] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5331 ms
[2024-05-24 15:16:20] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 0 ms to minimize.
[2024-05-24 15:16:21] [INFO ] Deduced a trap composed of 39 places in 231 ms of which 1 ms to minimize.
[2024-05-24 15:16:21] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 1 ms to minimize.
[2024-05-24 15:16:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 799 ms
[2024-05-24 15:16:21] [INFO ] After 11899ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 398 ms.
[2024-05-24 15:16:21] [INFO ] After 13168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 18 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 169 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 487/487 places, 2916/2916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 169 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 15:16:22] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:16:22] [INFO ] Invariant cache hit.
[2024-05-24 15:16:23] [INFO ] Implicit Places using invariants in 1184 ms returned []
[2024-05-24 15:16:23] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:16:23] [INFO ] Invariant cache hit.
[2024-05-24 15:16:23] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:16:28] [INFO ] Implicit Places using invariants and state equation in 5097 ms returned []
Implicit Place search using SMT with State Equation took 6284 ms to find 0 implicit places.
[2024-05-24 15:16:28] [INFO ] Redundant transitions in 165 ms returned []
[2024-05-24 15:16:28] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:16:28] [INFO ] Invariant cache hit.
[2024-05-24 15:16:31] [INFO ] Dead Transitions using invariants and state equation in 2446 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9073 ms. Remains : 487/487 places, 2916/2916 transitions.
Graph (trivial) has 2700 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions removed 277 transitions
Ensure Unique test removed 2024 transitions
Reduce isomorphic transitions removed 2301 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 518
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 518
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 318 transition count 500
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 292 transition count 500
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 525 place count 149 transition count 357
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 595 place count 149 transition count 287
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 611 place count 141 transition count 287
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 619 place count 141 transition count 279
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 629 place count 141 transition count 269
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 703 place count 141 transition count 195
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 777 place count 67 transition count 195
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 786 place count 67 transition count 195
Applied a total of 786 rules in 28 ms. Remains 67 /487 variables (removed 420) and now considering 195/2916 (removed 2721) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 195 rows 67 cols
[2024-05-24 15:16:31] [INFO ] Computed 20 invariants in 1 ms
[2024-05-24 15:16:31] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 15:16:31] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 15:16:31] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 15:16:31] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 15:16:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 15:16:31] [INFO ] After 32ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 15:16:31] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-24 15:16:31] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-24 15:16:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 52 ms
[2024-05-24 15:16:31] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-24 15:16:31] [INFO ] After 281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 129 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 303 ms.
Product exploration explored 100000 steps with 0 reset in 357 ms.
Built C files in :
/tmp/ltsmin2706663597310881391
[2024-05-24 15:16:32] [INFO ] Too many transitions (2916) to apply POR reductions. Disabling POR matrices.
[2024-05-24 15:16:32] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2706663597310881391
Running compilation step : cd /tmp/ltsmin2706663597310881391;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2706663597310881391;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2706663597310881391;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 107 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 15:16:35] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 15:16:35] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 15:16:36] [INFO ] Implicit Places using invariants in 1244 ms returned []
[2024-05-24 15:16:36] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:16:36] [INFO ] Invariant cache hit.
[2024-05-24 15:16:37] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:16:41] [INFO ] Implicit Places using invariants and state equation in 4441 ms returned []
Implicit Place search using SMT with State Equation took 5688 ms to find 0 implicit places.
[2024-05-24 15:16:41] [INFO ] Redundant transitions in 98 ms returned []
[2024-05-24 15:16:41] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:16:41] [INFO ] Invariant cache hit.
[2024-05-24 15:16:43] [INFO ] Dead Transitions using invariants and state equation in 1991 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7896 ms. Remains : 487/487 places, 2916/2916 transitions.
Built C files in :
/tmp/ltsmin755014874547193729
[2024-05-24 15:16:43] [INFO ] Too many transitions (2916) to apply POR reductions. Disabling POR matrices.
[2024-05-24 15:16:43] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin755014874547193729
Running compilation step : cd /tmp/ltsmin755014874547193729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin755014874547193729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin755014874547193729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 15:16:46] [INFO ] Flatten gal took : 89 ms
[2024-05-24 15:16:46] [INFO ] Flatten gal took : 81 ms
[2024-05-24 15:16:46] [INFO ] Time to serialize gal into /tmp/LTL23404630537397490.gal : 12 ms
[2024-05-24 15:16:46] [INFO ] Time to serialize properties into /tmp/LTL14085073345465170406.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/LTL23404630537397490.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1738588076967472446.hoa' '-atoms' '/tmp/LTL14085073345465170406.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...316
Loading property file /tmp/LTL14085073345465170406.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1738588076967472446.hoa
Detected timeout of ITS tools.
[2024-05-24 15:17:01] [INFO ] Flatten gal took : 79 ms
[2024-05-24 15:17:02] [INFO ] Flatten gal took : 82 ms
[2024-05-24 15:17:02] [INFO ] Time to serialize gal into /tmp/LTL435958831821820140.gal : 13 ms
[2024-05-24 15:17:02] [INFO ] Time to serialize properties into /tmp/LTL12804449748234498078.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/LTL435958831821820140.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12804449748234498078.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(("((turn_5==0)||(flag_5_active==0))")||(("(p25_8_4==0)")||(G("((turn_6==0)||(p10_5_0==0))")))))))
Formula 0 simplified : XF(!"((turn_5==0)||(flag_5_active==0))" & !"(p25_8_4==0)" & F!"((turn_6==0)||(p10_5_0==0))")
Detected timeout of ITS tools.
[2024-05-24 15:17:17] [INFO ] Flatten gal took : 128 ms
[2024-05-24 15:17:17] [INFO ] Applying decomposition
[2024-05-24 15:17:17] [INFO ] Flatten gal took : 101 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/graph2429302216114586002.txt' '-o' '/tmp/graph2429302216114586002.bin' '-w' '/tmp/graph2429302216114586002.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2429302216114586002.bin' '-l' '-1' '-v' '-w' '/tmp/graph2429302216114586002.weights' '-q' '0' '-e' '0.001'
[2024-05-24 15:17:17] [INFO ] Decomposing Gal with order
[2024-05-24 15:17:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 15:17:17] [INFO ] Removed a total of 6213 redundant transitions.
[2024-05-24 15:17:17] [INFO ] Flatten gal took : 325 ms
[2024-05-24 15:17:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 701 labels/synchronizations in 101 ms.
[2024-05-24 15:17:18] [INFO ] Time to serialize gal into /tmp/LTL7343788729850327371.gal : 24 ms
[2024-05-24 15:17:18] [INFO ] Time to serialize properties into /tmp/LTL5431560472345265091.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/LTL7343788729850327371.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5431560472345265091.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i16.u2.turn_5==0)||(i14.u60.flag_5_active==0))")||(("(i4.u6.p25_8_4==0)")||(G("((i15.u61.turn_6==0)||(u12.p10_5_0==0))"))))...158
Formula 0 simplified : XF(!"((i16.u2.turn_5==0)||(i14.u60.flag_5_active==0))" & !"(i4.u6.p25_8_4==0)" & F!"((i15.u61.turn_6==0)||(u12.p10_5_0==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8289131642538846958
[2024-05-24 15:17:33] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8289131642538846958
Running compilation step : cd /tmp/ltsmin8289131642538846958;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8289131642538846958;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8289131642538846958;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-06 finished in 163842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((X(p1)||G(p2)))||p0))))'
Support contains 4 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 820 transition count 3249
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 820 transition count 3249
Applied a total of 6 rules in 43 ms. Remains 820 /823 variables (removed 3) and now considering 3249/3276 (removed 27) transitions.
[2024-05-24 15:17:36] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2024-05-24 15:17:36] [INFO ] Computed 28 invariants in 8 ms
[2024-05-24 15:17:37] [INFO ] Implicit Places using invariants in 1011 ms returned []
[2024-05-24 15:17:37] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 15:17:37] [INFO ] Invariant cache hit.
[2024-05-24 15:17:38] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:17:44] [INFO ] Implicit Places using invariants and state equation in 6666 ms returned []
Implicit Place search using SMT with State Equation took 7679 ms to find 0 implicit places.
[2024-05-24 15:17:44] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 15:17:44] [INFO ] Invariant cache hit.
[2024-05-24 15:17:45] [INFO ] Dead Transitions using invariants and state equation in 1719 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 820/823 places, 3249/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9443 ms. Remains : 820/823 places, 3249/3276 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s32 0) (EQ s165 0)), p2:(OR (EQ s6 0) (EQ s207 0)), p1:(OR (EQ s32 0) (EQ s165 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50 reset in 356 ms.
Product exploration explored 100000 steps with 50 reset in 372 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), true, (X (X p0)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 150 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:17:46] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 15:17:46] [INFO ] Invariant cache hit.
[2024-05-24 15:17:47] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:17:47] [INFO ] [Nat]Absence check using 19 positive place invariants in 50 ms returned sat
[2024-05-24 15:17:47] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 14 ms returned sat
[2024-05-24 15:17:48] [INFO ] After 765ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:17:48] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:17:48] [INFO ] After 367ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:17:49] [INFO ] Deduced a trap composed of 54 places in 575 ms of which 1 ms to minimize.
[2024-05-24 15:17:50] [INFO ] Deduced a trap composed of 3 places in 634 ms of which 1 ms to minimize.
[2024-05-24 15:17:50] [INFO ] Deduced a trap composed of 85 places in 623 ms of which 1 ms to minimize.
[2024-05-24 15:17:51] [INFO ] Deduced a trap composed of 67 places in 601 ms of which 1 ms to minimize.
[2024-05-24 15:17:52] [INFO ] Deduced a trap composed of 29 places in 533 ms of which 1 ms to minimize.
[2024-05-24 15:17:52] [INFO ] Deduced a trap composed of 3 places in 535 ms of which 1 ms to minimize.
[2024-05-24 15:17:53] [INFO ] Deduced a trap composed of 3 places in 528 ms of which 1 ms to minimize.
[2024-05-24 15:17:54] [INFO ] Deduced a trap composed of 50 places in 522 ms of which 1 ms to minimize.
[2024-05-24 15:17:54] [INFO ] Deduced a trap composed of 3 places in 519 ms of which 1 ms to minimize.
[2024-05-24 15:17:55] [INFO ] Deduced a trap composed of 47 places in 380 ms of which 0 ms to minimize.
[2024-05-24 15:17:55] [INFO ] Deduced a trap composed of 44 places in 303 ms of which 0 ms to minimize.
[2024-05-24 15:17:55] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 1 ms to minimize.
[2024-05-24 15:17:56] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2024-05-24 15:17:56] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 1 ms to minimize.
[2024-05-24 15:17:56] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 7753 ms
[2024-05-24 15:17:56] [INFO ] After 8274ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 148 ms.
[2024-05-24 15:17:56] [INFO ] After 9504ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 820 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 811 transition count 2989
Deduced a syphon composed of 251 places in 4 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 560 transition count 2989
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 664 place count 488 transition count 2917
Applied a total of 664 rules in 281 ms. Remains 488 /820 variables (removed 332) and now considering 2917/3249 (removed 332) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 488/820 places, 2917/3249 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 318590 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 318590 steps, saw 199949 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:18:00] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2024-05-24 15:18:00] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 15:18:00] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:18:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-24 15:18:00] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 15:18:00] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:18:00] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:18:00] [INFO ] After 154ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:18:00] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 0 ms to minimize.
[2024-05-24 15:18:01] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 1 ms to minimize.
[2024-05-24 15:18:01] [INFO ] Deduced a trap composed of 23 places in 372 ms of which 1 ms to minimize.
[2024-05-24 15:18:02] [INFO ] Deduced a trap composed of 3 places in 300 ms of which 0 ms to minimize.
[2024-05-24 15:18:02] [INFO ] Deduced a trap composed of 37 places in 301 ms of which 1 ms to minimize.
[2024-05-24 15:18:02] [INFO ] Deduced a trap composed of 33 places in 240 ms of which 1 ms to minimize.
[2024-05-24 15:18:03] [INFO ] Deduced a trap composed of 3 places in 249 ms of which 1 ms to minimize.
[2024-05-24 15:18:03] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 1 ms to minimize.
[2024-05-24 15:18:03] [INFO ] Deduced a trap composed of 29 places in 260 ms of which 0 ms to minimize.
[2024-05-24 15:18:03] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 1 ms to minimize.
[2024-05-24 15:18:04] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 1 ms to minimize.
[2024-05-24 15:18:04] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 0 ms to minimize.
[2024-05-24 15:18:04] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2024-05-24 15:18:04] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3795 ms
[2024-05-24 15:18:04] [INFO ] After 4034ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 140 ms.
[2024-05-24 15:18:04] [INFO ] After 4629ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 169 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 488/488 places, 2917/2917 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 168 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-05-24 15:18:05] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:18:05] [INFO ] Invariant cache hit.
[2024-05-24 15:18:06] [INFO ] Implicit Places using invariants in 1252 ms returned []
[2024-05-24 15:18:06] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:18:06] [INFO ] Invariant cache hit.
[2024-05-24 15:18:06] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:18:10] [INFO ] Implicit Places using invariants and state equation in 4124 ms returned []
Implicit Place search using SMT with State Equation took 5378 ms to find 0 implicit places.
[2024-05-24 15:18:10] [INFO ] Redundant transitions in 120 ms returned []
[2024-05-24 15:18:10] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:18:10] [INFO ] Invariant cache hit.
[2024-05-24 15:18:12] [INFO ] Dead Transitions using invariants and state equation in 1967 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7641 ms. Remains : 488/488 places, 2917/2917 transitions.
Graph (trivial) has 2722 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 0 ms
Free SCC test removed 71 places
Drop transitions removed 272 transitions
Ensure Unique test removed 2027 transitions
Reduce isomorphic transitions removed 2299 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 417 transition count 520
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 319 transition count 520
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 197 place count 319 transition count 503
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 238 place count 295 transition count 503
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 526 place count 151 transition count 359
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 598 place count 151 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 612 place count 144 transition count 288
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 618 place count 144 transition count 282
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 625 place count 144 transition count 275
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 698 place count 144 transition count 202
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 771 place count 71 transition count 202
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 780 place count 71 transition count 202
Applied a total of 780 rules in 35 ms. Remains 71 /488 variables (removed 417) and now considering 202/2917 (removed 2715) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 202 rows 71 cols
[2024-05-24 15:18:12] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 15:18:12] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:18:12] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 15:18:12] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-24 15:18:12] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:18:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 15:18:12] [INFO ] After 21ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:18:12] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-24 15:18:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-24 15:18:12] [INFO ] After 80ms 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-24 15:18:12] [INFO ] After 228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p2 p1), (X p0), true, (X (X p0)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 6 factoid took 220 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 820 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 811 transition count 2989
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 560 transition count 2989
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 664 place count 488 transition count 2917
Applied a total of 664 rules in 304 ms. Remains 488 /820 variables (removed 332) and now considering 2917/3249 (removed 332) transitions.
[2024-05-24 15:18:13] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2024-05-24 15:18:13] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 15:18:14] [INFO ] Implicit Places using invariants in 1185 ms returned []
[2024-05-24 15:18:14] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:18:14] [INFO ] Invariant cache hit.
[2024-05-24 15:18:15] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:18:20] [INFO ] Implicit Places using invariants and state equation in 5208 ms returned []
Implicit Place search using SMT with State Equation took 6395 ms to find 0 implicit places.
[2024-05-24 15:18:20] [INFO ] Redundant transitions in 154 ms returned []
[2024-05-24 15:18:20] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:18:20] [INFO ] Invariant cache hit.
[2024-05-24 15:18:22] [INFO ] Dead Transitions using invariants and state equation in 2209 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/820 places, 2917/3249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9073 ms. Remains : 488/820 places, 2917/3249 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 101 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:18:22] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:18:22] [INFO ] Invariant cache hit.
[2024-05-24 15:18:22] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:18:22] [INFO ] [Nat]Absence check using 19 positive place invariants in 22 ms returned sat
[2024-05-24 15:18:22] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 15:18:23] [INFO ] After 507ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:18:23] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:18:23] [INFO ] After 242ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:18:24] [INFO ] Deduced a trap composed of 3 places in 368 ms of which 1 ms to minimize.
[2024-05-24 15:18:24] [INFO ] Deduced a trap composed of 30 places in 362 ms of which 1 ms to minimize.
[2024-05-24 15:18:25] [INFO ] Deduced a trap composed of 3 places in 385 ms of which 0 ms to minimize.
[2024-05-24 15:18:25] [INFO ] Deduced a trap composed of 23 places in 342 ms of which 1 ms to minimize.
[2024-05-24 15:18:25] [INFO ] Deduced a trap composed of 3 places in 318 ms of which 1 ms to minimize.
[2024-05-24 15:18:26] [INFO ] Deduced a trap composed of 37 places in 294 ms of which 1 ms to minimize.
[2024-05-24 15:18:26] [INFO ] Deduced a trap composed of 3 places in 289 ms of which 1 ms to minimize.
[2024-05-24 15:18:26] [INFO ] Deduced a trap composed of 29 places in 231 ms of which 0 ms to minimize.
[2024-05-24 15:18:27] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 0 ms to minimize.
[2024-05-24 15:18:27] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 1 ms to minimize.
[2024-05-24 15:18:27] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2024-05-24 15:18:27] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3674 ms
[2024-05-24 15:18:27] [INFO ] After 3983ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 101 ms.
[2024-05-24 15:18:27] [INFO ] After 4795ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 167 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 488/488 places, 2917/2917 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 284740 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 284740 steps, saw 180516 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:18:30] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:18:30] [INFO ] Invariant cache hit.
[2024-05-24 15:18:30] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:18:31] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-24 15:18:31] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 15:18:31] [INFO ] After 415ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:18:31] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:18:31] [INFO ] After 246ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:18:32] [INFO ] Deduced a trap composed of 3 places in 348 ms of which 1 ms to minimize.
[2024-05-24 15:18:32] [INFO ] Deduced a trap composed of 30 places in 344 ms of which 1 ms to minimize.
[2024-05-24 15:18:32] [INFO ] Deduced a trap composed of 3 places in 348 ms of which 0 ms to minimize.
[2024-05-24 15:18:33] [INFO ] Deduced a trap composed of 23 places in 334 ms of which 0 ms to minimize.
[2024-05-24 15:18:33] [INFO ] Deduced a trap composed of 3 places in 344 ms of which 1 ms to minimize.
[2024-05-24 15:18:34] [INFO ] Deduced a trap composed of 37 places in 300 ms of which 1 ms to minimize.
[2024-05-24 15:18:34] [INFO ] Deduced a trap composed of 3 places in 280 ms of which 1 ms to minimize.
[2024-05-24 15:18:34] [INFO ] Deduced a trap composed of 29 places in 238 ms of which 1 ms to minimize.
[2024-05-24 15:18:35] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 0 ms to minimize.
[2024-05-24 15:18:35] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 0 ms to minimize.
[2024-05-24 15:18:35] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2024-05-24 15:18:35] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3657 ms
[2024-05-24 15:18:35] [INFO ] After 3971ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 100 ms.
[2024-05-24 15:18:35] [INFO ] After 4622ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 169 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 488/488 places, 2917/2917 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 168 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-05-24 15:18:35] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:18:35] [INFO ] Invariant cache hit.
[2024-05-24 15:18:37] [INFO ] Implicit Places using invariants in 1208 ms returned []
[2024-05-24 15:18:37] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:18:37] [INFO ] Invariant cache hit.
[2024-05-24 15:18:37] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:18:42] [INFO ] Implicit Places using invariants and state equation in 5590 ms returned []
Implicit Place search using SMT with State Equation took 6811 ms to find 0 implicit places.
[2024-05-24 15:18:42] [INFO ] Redundant transitions in 101 ms returned []
[2024-05-24 15:18:42] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:18:42] [INFO ] Invariant cache hit.
[2024-05-24 15:18:45] [INFO ] Dead Transitions using invariants and state equation in 2685 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9778 ms. Remains : 488/488 places, 2917/2917 transitions.
Graph (trivial) has 2722 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 0 ms
Free SCC test removed 71 places
Drop transitions removed 272 transitions
Ensure Unique test removed 2027 transitions
Reduce isomorphic transitions removed 2299 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 417 transition count 520
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 319 transition count 520
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 197 place count 319 transition count 503
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 238 place count 295 transition count 503
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 526 place count 151 transition count 359
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 598 place count 151 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 612 place count 144 transition count 288
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 618 place count 144 transition count 282
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 625 place count 144 transition count 275
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 698 place count 144 transition count 202
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 771 place count 71 transition count 202
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 780 place count 71 transition count 202
Applied a total of 780 rules in 50 ms. Remains 71 /488 variables (removed 417) and now considering 202/2917 (removed 2715) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 202 rows 71 cols
[2024-05-24 15:18:45] [INFO ] Computed 21 invariants in 2 ms
[2024-05-24 15:18:45] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:18:45] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-24 15:18:45] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-24 15:18:45] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:18:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 15:18:45] [INFO ] After 21ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:18:45] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-24 15:18:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-05-24 15:18:45] [INFO ] After 79ms 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-24 15:18:45] [INFO ] After 256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 5 factoid took 211 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 91 reset in 426 ms.
Product exploration explored 100000 steps with 91 reset in 423 ms.
Built C files in :
/tmp/ltsmin378254809989453326
[2024-05-24 15:18:47] [INFO ] Too many transitions (2917) to apply POR reductions. Disabling POR matrices.
[2024-05-24 15:18:47] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin378254809989453326
Running compilation step : cd /tmp/ltsmin378254809989453326;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin378254809989453326;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin378254809989453326;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 103 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-05-24 15:18:50] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2024-05-24 15:18:50] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 15:18:51] [INFO ] Implicit Places using invariants in 1086 ms returned []
[2024-05-24 15:18:51] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:18:51] [INFO ] Invariant cache hit.
[2024-05-24 15:18:52] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:18:56] [INFO ] Implicit Places using invariants and state equation in 4798 ms returned []
Implicit Place search using SMT with State Equation took 5892 ms to find 0 implicit places.
[2024-05-24 15:18:56] [INFO ] Redundant transitions in 102 ms returned []
[2024-05-24 15:18:56] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:18:56] [INFO ] Invariant cache hit.
[2024-05-24 15:18:58] [INFO ] Dead Transitions using invariants and state equation in 2068 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8170 ms. Remains : 488/488 places, 2917/2917 transitions.
Built C files in :
/tmp/ltsmin14912573161058660117
[2024-05-24 15:18:58] [INFO ] Too many transitions (2917) to apply POR reductions. Disabling POR matrices.
[2024-05-24 15:18:58] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14912573161058660117
Running compilation step : cd /tmp/ltsmin14912573161058660117;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14912573161058660117;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14912573161058660117;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 15:19:01] [INFO ] Flatten gal took : 76 ms
[2024-05-24 15:19:01] [INFO ] Flatten gal took : 118 ms
[2024-05-24 15:19:01] [INFO ] Time to serialize gal into /tmp/LTL3832006427399559225.gal : 34 ms
[2024-05-24 15:19:01] [INFO ] Time to serialize properties into /tmp/LTL14771094324008763724.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/LTL3832006427399559225.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3181955667424355903.hoa' '-atoms' '/tmp/LTL14771094324008763724.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/LTL14771094324008763724.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3181955667424355903.hoa
Detected timeout of ITS tools.
[2024-05-24 15:19:17] [INFO ] Flatten gal took : 74 ms
[2024-05-24 15:19:17] [INFO ] Flatten gal took : 79 ms
[2024-05-24 15:19:17] [INFO ] Time to serialize gal into /tmp/LTL9797777253113322815.gal : 11 ms
[2024-05-24 15:19:17] [INFO ] Time to serialize properties into /tmp/LTL497091204037824752.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/LTL9797777253113322815.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL497091204037824752.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 : !((X(G(("((flag_7_active==0)||(p09_3_7==0))")||(F((X("((flag_7_active==0)||(p09_3_7==0))"))||(G("((turn_6==0)||(p10_1_2==0))"))))))))
Formula 0 simplified : XF(!"((flag_7_active==0)||(p09_3_7==0))" & G(X!"((flag_7_active==0)||(p09_3_7==0))" & F!"((turn_6==0)||(p10_1_2==0))"))
Detected timeout of ITS tools.
[2024-05-24 15:19:32] [INFO ] Flatten gal took : 80 ms
[2024-05-24 15:19:32] [INFO ] Applying decomposition
[2024-05-24 15:19:32] [INFO ] Flatten gal took : 83 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/graph15128083765636736094.txt' '-o' '/tmp/graph15128083765636736094.bin' '-w' '/tmp/graph15128083765636736094.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15128083765636736094.bin' '-l' '-1' '-v' '-w' '/tmp/graph15128083765636736094.weights' '-q' '0' '-e' '0.001'
[2024-05-24 15:19:32] [INFO ] Decomposing Gal with order
[2024-05-24 15:19:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 15:19:32] [INFO ] Removed a total of 6294 redundant transitions.
[2024-05-24 15:19:32] [INFO ] Flatten gal took : 270 ms
[2024-05-24 15:19:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 749 labels/synchronizations in 127 ms.
[2024-05-24 15:19:33] [INFO ] Time to serialize gal into /tmp/LTL9154633440717904810.gal : 25 ms
[2024-05-24 15:19:33] [INFO ] Time to serialize properties into /tmp/LTL487428715926379597.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/LTL9154633440717904810.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL487428715926379597.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i1.u2.flag_7_active==0)||(u8.p09_3_7==0))")||(F((X("((i1.u2.flag_7_active==0)||(u8.p09_3_7==0))"))||(G("((i2.u3.turn_6==0)|...181
Formula 0 simplified : XF(!"((i1.u2.flag_7_active==0)||(u8.p09_3_7==0))" & G(X!"((i1.u2.flag_7_active==0)||(u8.p09_3_7==0))" & F!"((i2.u3.turn_6==0)||(u7.p...169
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10133763141293543793
[2024-05-24 15:19:48] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10133763141293543793
Running compilation step : cd /tmp/ltsmin10133763141293543793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10133763141293543793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10133763141293543793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-07 finished in 134867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((p0||(!p1 U (p2||G(!p1)))))||(p0&&F(p3))||((!p1 U (p2||G(!p1)))&&F(p3))))))'
Support contains 12 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 18 place count 814 transition count 3017
Deduced a syphon composed of 250 places in 3 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 518 place count 564 transition count 3017
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 522 place count 560 transition count 2981
Iterating global reduction 2 with 4 rules applied. Total rules applied 526 place count 560 transition count 2981
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 670 place count 488 transition count 2909
Applied a total of 670 rules in 190 ms. Remains 488 /823 variables (removed 335) and now considering 2909/3276 (removed 367) transitions.
[2024-05-24 15:19:51] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2024-05-24 15:19:51] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 15:19:52] [INFO ] Implicit Places using invariants in 984 ms returned []
[2024-05-24 15:19:52] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 15:19:52] [INFO ] Invariant cache hit.
[2024-05-24 15:19:52] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:19:57] [INFO ] Implicit Places using invariants and state equation in 4765 ms returned []
Implicit Place search using SMT with State Equation took 5752 ms to find 0 implicit places.
[2024-05-24 15:19:57] [INFO ] Redundant transitions in 173 ms returned []
[2024-05-24 15:19:57] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 15:19:57] [INFO ] Invariant cache hit.
[2024-05-24 15:19:59] [INFO ] Dead Transitions using invariants and state equation in 2194 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/823 places, 2909/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8320 ms. Remains : 488/823 places, 2909/3276 transitions.
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p2) p1 (NOT p3) (NOT p0)), (AND (NOT p2) p1 (NOT p3) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p2) p1 (NOT p3) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 (NOT p3)) (AND (NOT p3) p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p3)) (AND (NOT p3) p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p3)) (AND (NOT p3) p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(NEQ s290 1), p2:(AND (NOT (AND (EQ s6 1) (EQ s27 1) (EQ s300 1))) (NOT (AND (EQ s15 1) (EQ s217 1)))), p1:(AND (EQ s15 1) (EQ s217 1)), p3:(OR (AND (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 487 ms.
Product exploration explored 100000 steps with 0 reset in 387 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1) p3), (X (NOT (OR (AND p0 (NOT p3)) (AND (NOT p3) p2)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND (NOT p3) p2))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 146 ms. Reduced automaton from 6 states, 20 edges and 4 AP (stutter insensitive) to 6 states, 19 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p2) p1 (NOT p3) (NOT p0)), (AND (NOT p2) p1 (NOT p3) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p2) p1 (NOT p3) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 138340 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 138340 steps, saw 93363 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 10 properties.
[2024-05-24 15:20:04] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 15:20:04] [INFO ] Invariant cache hit.
[2024-05-24 15:20:05] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-24 15:20:05] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 15:20:05] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2024-05-24 15:20:05] [INFO ] [Nat]Absence check using 19 positive place invariants in 21 ms returned sat
[2024-05-24 15:20:05] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 9 ms returned sat
[2024-05-24 15:20:06] [INFO ] After 705ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :3
[2024-05-24 15:20:06] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:20:06] [INFO ] After 413ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :7 sat :3
[2024-05-24 15:20:07] [INFO ] Deduced a trap composed of 6 places in 468 ms of which 1 ms to minimize.
[2024-05-24 15:20:07] [INFO ] Deduced a trap composed of 36 places in 438 ms of which 1 ms to minimize.
[2024-05-24 15:20:08] [INFO ] Deduced a trap composed of 29 places in 412 ms of which 1 ms to minimize.
[2024-05-24 15:20:08] [INFO ] Deduced a trap composed of 3 places in 340 ms of which 0 ms to minimize.
[2024-05-24 15:20:09] [INFO ] Deduced a trap composed of 24 places in 349 ms of which 1 ms to minimize.
[2024-05-24 15:20:09] [INFO ] Deduced a trap composed of 5 places in 363 ms of which 1 ms to minimize.
[2024-05-24 15:20:09] [INFO ] Deduced a trap composed of 33 places in 382 ms of which 1 ms to minimize.
[2024-05-24 15:20:10] [INFO ] Deduced a trap composed of 21 places in 308 ms of which 0 ms to minimize.
[2024-05-24 15:20:10] [INFO ] Deduced a trap composed of 27 places in 350 ms of which 1 ms to minimize.
[2024-05-24 15:20:10] [INFO ] Deduced a trap composed of 3 places in 243 ms of which 1 ms to minimize.
[2024-05-24 15:20:11] [INFO ] Deduced a trap composed of 35 places in 268 ms of which 0 ms to minimize.
[2024-05-24 15:20:11] [INFO ] Deduced a trap composed of 3 places in 265 ms of which 1 ms to minimize.
[2024-05-24 15:20:11] [INFO ] Deduced a trap composed of 28 places in 204 ms of which 1 ms to minimize.
[2024-05-24 15:20:12] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2024-05-24 15:20:12] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5397 ms
[2024-05-24 15:20:12] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 1 ms to minimize.
[2024-05-24 15:20:12] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2024-05-24 15:20:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 430 ms
[2024-05-24 15:20:12] [INFO ] After 6594ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :3
Attempting to minimize the solution found.
Minimization took 293 ms.
[2024-05-24 15:20:13] [INFO ] After 7949ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :3
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 12 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 171 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 488/488 places, 2909/2909 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 186470 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 186470 steps, saw 122992 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 15:20:16] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 15:20:16] [INFO ] Invariant cache hit.
[2024-05-24 15:20:16] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2024-05-24 15:20:16] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 15:20:16] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 15:20:16] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-24 15:20:16] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 15:20:17] [INFO ] After 560ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 15:20:17] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:20:18] [INFO ] After 488ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 15:20:18] [INFO ] Deduced a trap composed of 3 places in 287 ms of which 1 ms to minimize.
[2024-05-24 15:20:18] [INFO ] Deduced a trap composed of 3 places in 243 ms of which 0 ms to minimize.
[2024-05-24 15:20:19] [INFO ] Deduced a trap composed of 45 places in 255 ms of which 1 ms to minimize.
[2024-05-24 15:20:19] [INFO ] Deduced a trap composed of 63 places in 247 ms of which 1 ms to minimize.
[2024-05-24 15:20:19] [INFO ] Deduced a trap composed of 3 places in 259 ms of which 1 ms to minimize.
[2024-05-24 15:20:20] [INFO ] Deduced a trap composed of 31 places in 246 ms of which 1 ms to minimize.
[2024-05-24 15:20:20] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 1 ms to minimize.
[2024-05-24 15:20:20] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 1 ms to minimize.
[2024-05-24 15:20:20] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 0 ms to minimize.
[2024-05-24 15:20:20] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2709 ms
[2024-05-24 15:20:21] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 1 ms to minimize.
[2024-05-24 15:20:21] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-05-24 15:20:21] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 1 ms to minimize.
[2024-05-24 15:20:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 591 ms
[2024-05-24 15:20:22] [INFO ] Deduced a trap composed of 3 places in 416 ms of which 1 ms to minimize.
[2024-05-24 15:20:22] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 0 ms to minimize.
[2024-05-24 15:20:22] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 0 ms to minimize.
[2024-05-24 15:20:23] [INFO ] Deduced a trap composed of 45 places in 233 ms of which 1 ms to minimize.
[2024-05-24 15:20:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1422 ms
[2024-05-24 15:20:23] [INFO ] After 5582ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 344 ms.
[2024-05-24 15:20:23] [INFO ] After 6656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 24 ms.
Support contains 12 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 171 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 488/488 places, 2909/2909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 179 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
[2024-05-24 15:20:23] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 15:20:23] [INFO ] Invariant cache hit.
[2024-05-24 15:20:25] [INFO ] Implicit Places using invariants in 1145 ms returned []
[2024-05-24 15:20:25] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 15:20:25] [INFO ] Invariant cache hit.
[2024-05-24 15:20:25] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:20:29] [INFO ] Implicit Places using invariants and state equation in 4307 ms returned []
Implicit Place search using SMT with State Equation took 5457 ms to find 0 implicit places.
[2024-05-24 15:20:29] [INFO ] Redundant transitions in 152 ms returned []
[2024-05-24 15:20:29] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 15:20:29] [INFO ] Invariant cache hit.
[2024-05-24 15:20:31] [INFO ] Dead Transitions using invariants and state equation in 1908 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7705 ms. Remains : 488/488 places, 2909/2909 transitions.
Graph (trivial) has 2647 edges and 488 vertex of which 81 / 488 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 416 transition count 520
Reduce places removed 94 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 95 rules applied. Total rules applied 190 place count 322 transition count 519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 191 place count 321 transition count 519
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 191 place count 321 transition count 500
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 238 place count 293 transition count 500
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 280 rules applied. Total rules applied 518 place count 153 transition count 360
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 3 with 65 rules applied. Total rules applied 583 place count 153 transition count 295
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 595 place count 147 transition count 295
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 601 place count 147 transition count 289
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 610 place count 147 transition count 280
Free-agglomeration rule applied 75 times.
Iterating global reduction 5 with 75 rules applied. Total rules applied 685 place count 147 transition count 205
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 5 with 75 rules applied. Total rules applied 760 place count 72 transition count 205
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 769 place count 72 transition count 205
Applied a total of 769 rules in 26 ms. Remains 72 /488 variables (removed 416) and now considering 205/2909 (removed 2704) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 205 rows 72 cols
[2024-05-24 15:20:31] [INFO ] Computed 19 invariants in 0 ms
[2024-05-24 15:20:31] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 15:20:31] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 15:20:31] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 15:20:31] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 15:20:31] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 15:20:31] [INFO ] After 58ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 15:20:31] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-24 15:20:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-24 15:20:31] [INFO ] After 195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 83 ms.
[2024-05-24 15:20:31] [INFO ] After 430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 7 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1) p3), (X (NOT (OR (AND p0 (NOT p3)) (AND (NOT p3) p2)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND (NOT p3) p2))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (G (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p3) (NOT p2) p1))), (G (NOT (AND (NOT p0) (NOT p2) p1))), (G (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (G (NOT (AND p0 (NOT p3) (NOT p2) p1))), (G (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1))), (G (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 26 factoid took 36 ms. Reduced automaton from 6 states, 19 edges and 4 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-09-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-08 finished in 40819 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 6 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 814 transition count 3015
Deduced a syphon composed of 252 places in 4 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 562 transition count 3015
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 526 place count 558 transition count 2979
Iterating global reduction 2 with 4 rules applied. Total rules applied 530 place count 558 transition count 2979
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 674 place count 486 transition count 2907
Applied a total of 674 rules in 313 ms. Remains 486 /823 variables (removed 337) and now considering 2907/3276 (removed 369) transitions.
[2024-05-24 15:20:32] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 15:20:32] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 15:20:33] [INFO ] Implicit Places using invariants in 1196 ms returned []
[2024-05-24 15:20:33] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:20:33] [INFO ] Invariant cache hit.
[2024-05-24 15:20:34] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:20:37] [INFO ] Implicit Places using invariants and state equation in 3820 ms returned []
Implicit Place search using SMT with State Equation took 5017 ms to find 0 implicit places.
[2024-05-24 15:20:37] [INFO ] Redundant transitions in 108 ms returned []
[2024-05-24 15:20:37] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:20:37] [INFO ] Invariant cache hit.
[2024-05-24 15:20:39] [INFO ] Dead Transitions using invariants and state equation in 1980 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 486/823 places, 2907/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7426 ms. Remains : 486/823 places, 2907/3276 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (EQ s7 0) (EQ s30 0) (EQ s304 0)) (OR (NEQ s1 1) (NEQ s12 1) (NEQ s340 1)))], 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 0 reset in 299 ms.
Product exploration explored 100000 steps with 0 reset in 381 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 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 49 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 312880 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 312880 steps, saw 197515 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:20:43] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:20:43] [INFO ] Invariant cache hit.
[2024-05-24 15:20:43] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:20:43] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-24 15:20:43] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 15:20:44] [INFO ] After 438ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:20:44] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:20:44] [INFO ] After 209ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:20:44] [INFO ] Deduced a trap composed of 3 places in 353 ms of which 1 ms to minimize.
[2024-05-24 15:20:45] [INFO ] Deduced a trap composed of 3 places in 511 ms of which 1 ms to minimize.
[2024-05-24 15:20:45] [INFO ] Deduced a trap composed of 3 places in 444 ms of which 1 ms to minimize.
[2024-05-24 15:20:46] [INFO ] Deduced a trap composed of 3 places in 382 ms of which 1 ms to minimize.
[2024-05-24 15:20:46] [INFO ] Deduced a trap composed of 12 places in 380 ms of which 1 ms to minimize.
[2024-05-24 15:20:47] [INFO ] Deduced a trap composed of 27 places in 382 ms of which 1 ms to minimize.
[2024-05-24 15:20:47] [INFO ] Deduced a trap composed of 35 places in 382 ms of which 1 ms to minimize.
[2024-05-24 15:20:48] [INFO ] Deduced a trap composed of 3 places in 385 ms of which 1 ms to minimize.
[2024-05-24 15:20:48] [INFO ] Deduced a trap composed of 13 places in 322 ms of which 1 ms to minimize.
[2024-05-24 15:20:48] [INFO ] Deduced a trap composed of 43 places in 305 ms of which 1 ms to minimize.
[2024-05-24 15:20:49] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 1 ms to minimize.
[2024-05-24 15:20:49] [INFO ] Deduced a trap composed of 15 places in 248 ms of which 1 ms to minimize.
[2024-05-24 15:20:49] [INFO ] Deduced a trap composed of 29 places in 252 ms of which 4 ms to minimize.
[2024-05-24 15:20:49] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 0 ms to minimize.
[2024-05-24 15:20:50] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 0 ms to minimize.
[2024-05-24 15:20:50] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2024-05-24 15:20:50] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 0 ms to minimize.
[2024-05-24 15:20:50] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 6203 ms
[2024-05-24 15:20:50] [INFO ] After 6513ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2024-05-24 15:20:50] [INFO ] After 7185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 166 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 486/486 places, 2907/2907 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 311980 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 311980 steps, saw 196915 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:20:53] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:20:53] [INFO ] Invariant cache hit.
[2024-05-24 15:20:53] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:20:54] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-24 15:20:54] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 15:20:54] [INFO ] After 319ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:20:54] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:20:54] [INFO ] After 127ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:20:54] [INFO ] Deduced a trap composed of 3 places in 306 ms of which 1 ms to minimize.
[2024-05-24 15:20:55] [INFO ] Deduced a trap composed of 3 places in 509 ms of which 1 ms to minimize.
[2024-05-24 15:20:55] [INFO ] Deduced a trap composed of 3 places in 429 ms of which 1 ms to minimize.
[2024-05-24 15:20:56] [INFO ] Deduced a trap composed of 3 places in 359 ms of which 0 ms to minimize.
[2024-05-24 15:20:56] [INFO ] Deduced a trap composed of 12 places in 362 ms of which 0 ms to minimize.
[2024-05-24 15:20:57] [INFO ] Deduced a trap composed of 27 places in 376 ms of which 1 ms to minimize.
[2024-05-24 15:20:57] [INFO ] Deduced a trap composed of 35 places in 376 ms of which 1 ms to minimize.
[2024-05-24 15:20:58] [INFO ] Deduced a trap composed of 3 places in 367 ms of which 1 ms to minimize.
[2024-05-24 15:20:58] [INFO ] Deduced a trap composed of 13 places in 316 ms of which 1 ms to minimize.
[2024-05-24 15:20:58] [INFO ] Deduced a trap composed of 43 places in 304 ms of which 1 ms to minimize.
[2024-05-24 15:20:59] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 1 ms to minimize.
[2024-05-24 15:20:59] [INFO ] Deduced a trap composed of 15 places in 255 ms of which 1 ms to minimize.
[2024-05-24 15:20:59] [INFO ] Deduced a trap composed of 29 places in 267 ms of which 1 ms to minimize.
[2024-05-24 15:21:00] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 1 ms to minimize.
[2024-05-24 15:21:00] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2024-05-24 15:21:00] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 0 ms to minimize.
[2024-05-24 15:21:00] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2024-05-24 15:21:00] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 6080 ms
[2024-05-24 15:21:00] [INFO ] After 6285ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2024-05-24 15:21:00] [INFO ] After 6829ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 166 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 168 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 15:21:01] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:21:01] [INFO ] Invariant cache hit.
[2024-05-24 15:21:02] [INFO ] Implicit Places using invariants in 1186 ms returned []
[2024-05-24 15:21:02] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:21:02] [INFO ] Invariant cache hit.
[2024-05-24 15:21:02] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:21:06] [INFO ] Implicit Places using invariants and state equation in 4535 ms returned []
Implicit Place search using SMT with State Equation took 5723 ms to find 0 implicit places.
[2024-05-24 15:21:06] [INFO ] Redundant transitions in 101 ms returned []
[2024-05-24 15:21:06] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:21:06] [INFO ] Invariant cache hit.
[2024-05-24 15:21:09] [INFO ] Dead Transitions using invariants and state equation in 2141 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8141 ms. Remains : 486/486 places, 2907/2907 transitions.
Graph (trivial) has 2677 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 414 transition count 516
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 193 place count 318 transition count 516
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 193 place count 318 transition count 497
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 240 place count 290 transition count 497
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 1 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 524 place count 148 transition count 355
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 592 place count 148 transition count 287
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 610 place count 139 transition count 287
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 619 place count 139 transition count 278
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 630 place count 139 transition count 267
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 704 place count 139 transition count 193
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 778 place count 65 transition count 193
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 787 place count 65 transition count 193
Applied a total of 787 rules in 29 ms. Remains 65 /486 variables (removed 421) and now considering 193/2907 (removed 2714) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 65 cols
[2024-05-24 15:21:09] [INFO ] Computed 19 invariants in 0 ms
[2024-05-24 15:21:09] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:21:09] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2024-05-24 15:21:09] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:21:09] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 15:21:09] [INFO ] After 15ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:21:09] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-24 15:21:09] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-24 15:21:09] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-05-24 15:21:09] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2024-05-24 15:21:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 98 ms
[2024-05-24 15:21:09] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-24 15:21:09] [INFO ] After 230ms 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 73 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 114 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 15:21:09] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 15:21:09] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 15:21:10] [INFO ] Implicit Places using invariants in 1209 ms returned []
[2024-05-24 15:21:10] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:21:10] [INFO ] Invariant cache hit.
[2024-05-24 15:21:11] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:21:15] [INFO ] Implicit Places using invariants and state equation in 4706 ms returned []
Implicit Place search using SMT with State Equation took 5917 ms to find 0 implicit places.
[2024-05-24 15:21:15] [INFO ] Redundant transitions in 146 ms returned []
[2024-05-24 15:21:15] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:21:15] [INFO ] Invariant cache hit.
[2024-05-24 15:21:17] [INFO ] Dead Transitions using invariants and state equation in 2236 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8422 ms. Remains : 486/486 places, 2907/2907 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 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 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 34 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 326850 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 326850 steps, saw 205176 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:21:21] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:21:21] [INFO ] Invariant cache hit.
[2024-05-24 15:21:21] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:21:21] [INFO ] [Nat]Absence check using 19 positive place invariants in 19 ms returned sat
[2024-05-24 15:21:21] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 15:21:21] [INFO ] After 490ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:21:21] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:21:22] [INFO ] After 206ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:21:22] [INFO ] Deduced a trap composed of 3 places in 365 ms of which 1 ms to minimize.
[2024-05-24 15:21:23] [INFO ] Deduced a trap composed of 3 places in 525 ms of which 1 ms to minimize.
[2024-05-24 15:21:23] [INFO ] Deduced a trap composed of 3 places in 444 ms of which 0 ms to minimize.
[2024-05-24 15:21:24] [INFO ] Deduced a trap composed of 3 places in 363 ms of which 0 ms to minimize.
[2024-05-24 15:21:24] [INFO ] Deduced a trap composed of 12 places in 363 ms of which 1 ms to minimize.
[2024-05-24 15:21:25] [INFO ] Deduced a trap composed of 27 places in 376 ms of which 1 ms to minimize.
[2024-05-24 15:21:25] [INFO ] Deduced a trap composed of 35 places in 362 ms of which 1 ms to minimize.
[2024-05-24 15:21:25] [INFO ] Deduced a trap composed of 3 places in 329 ms of which 0 ms to minimize.
[2024-05-24 15:21:26] [INFO ] Deduced a trap composed of 13 places in 311 ms of which 1 ms to minimize.
[2024-05-24 15:21:26] [INFO ] Deduced a trap composed of 43 places in 319 ms of which 0 ms to minimize.
[2024-05-24 15:21:26] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 0 ms to minimize.
[2024-05-24 15:21:27] [INFO ] Deduced a trap composed of 15 places in 244 ms of which 0 ms to minimize.
[2024-05-24 15:21:27] [INFO ] Deduced a trap composed of 29 places in 242 ms of which 1 ms to minimize.
[2024-05-24 15:21:27] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 1 ms to minimize.
[2024-05-24 15:21:27] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 1 ms to minimize.
[2024-05-24 15:21:28] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2024-05-24 15:21:28] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 0 ms to minimize.
[2024-05-24 15:21:28] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 6147 ms
[2024-05-24 15:21:28] [INFO ] After 6455ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2024-05-24 15:21:28] [INFO ] After 7230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 167 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 486/486 places, 2907/2907 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 329840 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 329840 steps, saw 206834 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:21:31] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:21:31] [INFO ] Invariant cache hit.
[2024-05-24 15:21:31] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:21:31] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-24 15:21:31] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 15:21:32] [INFO ] After 380ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:21:32] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:21:32] [INFO ] After 193ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:21:33] [INFO ] Deduced a trap composed of 3 places in 349 ms of which 0 ms to minimize.
[2024-05-24 15:21:33] [INFO ] Deduced a trap composed of 3 places in 504 ms of which 2 ms to minimize.
[2024-05-24 15:21:34] [INFO ] Deduced a trap composed of 3 places in 416 ms of which 1 ms to minimize.
[2024-05-24 15:21:34] [INFO ] Deduced a trap composed of 3 places in 366 ms of which 1 ms to minimize.
[2024-05-24 15:21:34] [INFO ] Deduced a trap composed of 12 places in 362 ms of which 1 ms to minimize.
[2024-05-24 15:21:35] [INFO ] Deduced a trap composed of 27 places in 366 ms of which 0 ms to minimize.
[2024-05-24 15:21:35] [INFO ] Deduced a trap composed of 35 places in 371 ms of which 1 ms to minimize.
[2024-05-24 15:21:36] [INFO ] Deduced a trap composed of 3 places in 376 ms of which 1 ms to minimize.
[2024-05-24 15:21:36] [INFO ] Deduced a trap composed of 13 places in 302 ms of which 1 ms to minimize.
[2024-05-24 15:21:36] [INFO ] Deduced a trap composed of 43 places in 300 ms of which 1 ms to minimize.
[2024-05-24 15:21:37] [INFO ] Deduced a trap composed of 17 places in 248 ms of which 0 ms to minimize.
[2024-05-24 15:21:37] [INFO ] Deduced a trap composed of 15 places in 237 ms of which 0 ms to minimize.
[2024-05-24 15:21:37] [INFO ] Deduced a trap composed of 29 places in 244 ms of which 1 ms to minimize.
[2024-05-24 15:21:38] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 1 ms to minimize.
[2024-05-24 15:21:38] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2024-05-24 15:21:38] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 0 ms to minimize.
[2024-05-24 15:21:38] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2024-05-24 15:21:38] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 6071 ms
[2024-05-24 15:21:38] [INFO ] After 6361ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2024-05-24 15:21:38] [INFO ] After 6969ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 166 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 166 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 15:21:39] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:21:39] [INFO ] Invariant cache hit.
[2024-05-24 15:21:40] [INFO ] Implicit Places using invariants in 1207 ms returned []
[2024-05-24 15:21:40] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:21:40] [INFO ] Invariant cache hit.
[2024-05-24 15:21:40] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:21:45] [INFO ] Implicit Places using invariants and state equation in 4858 ms returned []
Implicit Place search using SMT with State Equation took 6066 ms to find 0 implicit places.
[2024-05-24 15:21:45] [INFO ] Redundant transitions in 100 ms returned []
[2024-05-24 15:21:45] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:21:45] [INFO ] Invariant cache hit.
[2024-05-24 15:21:47] [INFO ] Dead Transitions using invariants and state equation in 1716 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8055 ms. Remains : 486/486 places, 2907/2907 transitions.
Graph (trivial) has 2677 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 414 transition count 516
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 193 place count 318 transition count 516
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 193 place count 318 transition count 497
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 240 place count 290 transition count 497
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 524 place count 148 transition count 355
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 592 place count 148 transition count 287
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 610 place count 139 transition count 287
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 619 place count 139 transition count 278
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 630 place count 139 transition count 267
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 704 place count 139 transition count 193
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 778 place count 65 transition count 193
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 787 place count 65 transition count 193
Applied a total of 787 rules in 30 ms. Remains 65 /486 variables (removed 421) and now considering 193/2907 (removed 2714) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 65 cols
[2024-05-24 15:21:47] [INFO ] Computed 19 invariants in 0 ms
[2024-05-24 15:21:47] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:21:47] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 15:21:47] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:21:47] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 15:21:47] [INFO ] After 16ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:21:47] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-24 15:21:47] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-24 15:21:47] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-24 15:21:47] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-05-24 15:21:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 130 ms
[2024-05-24 15:21:47] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-24 15:21:47] [INFO ] After 275ms 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 78 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 404 ms.
Product exploration explored 100000 steps with 0 reset in 415 ms.
Built C files in :
/tmp/ltsmin12830570873595600272
[2024-05-24 15:21:48] [INFO ] Too many transitions (2907) to apply POR reductions. Disabling POR matrices.
[2024-05-24 15:21:48] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12830570873595600272
Running compilation step : cd /tmp/ltsmin12830570873595600272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12830570873595600272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12830570873595600272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 102 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 15:21:51] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 15:21:51] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 15:21:52] [INFO ] Implicit Places using invariants in 1155 ms returned []
[2024-05-24 15:21:52] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:21:52] [INFO ] Invariant cache hit.
[2024-05-24 15:21:53] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:21:57] [INFO ] Implicit Places using invariants and state equation in 4686 ms returned []
Implicit Place search using SMT with State Equation took 5844 ms to find 0 implicit places.
[2024-05-24 15:21:57] [INFO ] Redundant transitions in 137 ms returned []
[2024-05-24 15:21:57] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:21:57] [INFO ] Invariant cache hit.
[2024-05-24 15:21:59] [INFO ] Dead Transitions using invariants and state equation in 2014 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8104 ms. Remains : 486/486 places, 2907/2907 transitions.
Built C files in :
/tmp/ltsmin9214960938386307902
[2024-05-24 15:21:59] [INFO ] Too many transitions (2907) to apply POR reductions. Disabling POR matrices.
[2024-05-24 15:21:59] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9214960938386307902
Running compilation step : cd /tmp/ltsmin9214960938386307902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9214960938386307902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9214960938386307902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 15:22:02] [INFO ] Flatten gal took : 77 ms
[2024-05-24 15:22:02] [INFO ] Flatten gal took : 74 ms
[2024-05-24 15:22:02] [INFO ] Time to serialize gal into /tmp/LTL10955387004078129011.gal : 10 ms
[2024-05-24 15:22:02] [INFO ] Time to serialize properties into /tmp/LTL15680368260639431452.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/LTL10955387004078129011.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6249463264211357342.hoa' '-atoms' '/tmp/LTL15680368260639431452.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/LTL15680368260639431452.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6249463264211357342.hoa
Detected timeout of ITS tools.
[2024-05-24 15:22:17] [INFO ] Flatten gal took : 74 ms
[2024-05-24 15:22:18] [INFO ] Flatten gal took : 75 ms
[2024-05-24 15:22:18] [INFO ] Time to serialize gal into /tmp/LTL12056680077656195265.gal : 11 ms
[2024-05-24 15:22:18] [INFO ] Time to serialize properties into /tmp/LTL15125559464171758053.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/LTL12056680077656195265.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15125559464171758053.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...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((((turn_7==0)||(flag_7_idle==0))||(p25_0_8==0))&&(((turn_1!=1)||(flag_1_idle!=1))||(p25_5_3!=1)))"))))
Formula 0 simplified : GF!"((((turn_7==0)||(flag_7_idle==0))||(p25_0_8==0))&&(((turn_1!=1)||(flag_1_idle!=1))||(p25_5_3!=1)))"
Detected timeout of ITS tools.
[2024-05-24 15:22:33] [INFO ] Flatten gal took : 73 ms
[2024-05-24 15:22:33] [INFO ] Applying decomposition
[2024-05-24 15:22:33] [INFO ] Flatten gal took : 88 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/graph3206128604211268898.txt' '-o' '/tmp/graph3206128604211268898.bin' '-w' '/tmp/graph3206128604211268898.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3206128604211268898.bin' '-l' '-1' '-v' '-w' '/tmp/graph3206128604211268898.weights' '-q' '0' '-e' '0.001'
[2024-05-24 15:22:33] [INFO ] Decomposing Gal with order
[2024-05-24 15:22:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 15:22:33] [INFO ] Removed a total of 6299 redundant transitions.
[2024-05-24 15:22:33] [INFO ] Flatten gal took : 257 ms
[2024-05-24 15:22:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 637 labels/synchronizations in 69 ms.
[2024-05-24 15:22:33] [INFO ] Time to serialize gal into /tmp/LTL8378647900063193978.gal : 17 ms
[2024-05-24 15:22:33] [INFO ] Time to serialize properties into /tmp/LTL8377639112068834615.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/LTL8378647900063193978.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8377639112068834615.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("((((i11.u3.turn_7==0)||(i1.u2.flag_7_idle==0))||(i8.u0.p25_0_8==0))&&(((i8.u0.turn_1!=1)||(i0.u26.flag_1_idle!=1))||(u5.p25_5_...167
Formula 0 simplified : GF!"((((i11.u3.turn_7==0)||(i1.u2.flag_7_idle==0))||(i8.u0.p25_0_8==0))&&(((i8.u0.turn_1!=1)||(i0.u26.flag_1_idle!=1))||(u5.p25_5_3!...161
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8506477658977508629
[2024-05-24 15:22:48] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8506477658977508629
Running compilation step : cd /tmp/ltsmin8506477658977508629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8506477658977508629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8506477658977508629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-09 finished in 139975 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 3 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 814 transition count 3015
Deduced a syphon composed of 252 places in 3 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 562 transition count 3015
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 526 place count 558 transition count 2979
Iterating global reduction 2 with 4 rules applied. Total rules applied 530 place count 558 transition count 2979
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 674 place count 486 transition count 2907
Applied a total of 674 rules in 191 ms. Remains 486 /823 variables (removed 337) and now considering 2907/3276 (removed 369) transitions.
[2024-05-24 15:22:52] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:22:52] [INFO ] Invariant cache hit.
[2024-05-24 15:22:53] [INFO ] Implicit Places using invariants in 1196 ms returned []
[2024-05-24 15:22:53] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:22:53] [INFO ] Invariant cache hit.
[2024-05-24 15:22:53] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:22:58] [INFO ] Implicit Places using invariants and state equation in 4817 ms returned []
Implicit Place search using SMT with State Equation took 6016 ms to find 0 implicit places.
[2024-05-24 15:22:58] [INFO ] Redundant transitions in 123 ms returned []
[2024-05-24 15:22:58] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:22:58] [INFO ] Invariant cache hit.
[2024-05-24 15:23:00] [INFO ] Dead Transitions using invariants and state equation in 2092 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 486/823 places, 2907/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8430 ms. Remains : 486/823 places, 2907/3276 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-10 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 (NEQ s1 1) (NEQ s13 1) (NEQ s335 1))], 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 0 reset in 291 ms.
Product exploration explored 100000 steps with 0 reset in 492 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 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 34 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 340360 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 340360 steps, saw 212750 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:23:04] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:23:04] [INFO ] Invariant cache hit.
[2024-05-24 15:23:04] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-24 15:23:04] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 15:23:04] [INFO ] After 511ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:23:05] [INFO ] [Nat]Absence check using 19 positive place invariants in 22 ms returned sat
[2024-05-24 15:23:05] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 11 ms returned sat
[2024-05-24 15:23:05] [INFO ] After 484ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:23:05] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:23:05] [INFO ] After 189ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:23:06] [INFO ] Deduced a trap composed of 3 places in 413 ms of which 1 ms to minimize.
[2024-05-24 15:23:06] [INFO ] Deduced a trap composed of 15 places in 379 ms of which 0 ms to minimize.
[2024-05-24 15:23:07] [INFO ] Deduced a trap composed of 23 places in 410 ms of which 1 ms to minimize.
[2024-05-24 15:23:07] [INFO ] Deduced a trap composed of 30 places in 394 ms of which 0 ms to minimize.
[2024-05-24 15:23:08] [INFO ] Deduced a trap composed of 13 places in 403 ms of which 0 ms to minimize.
[2024-05-24 15:23:08] [INFO ] Deduced a trap composed of 3 places in 341 ms of which 1 ms to minimize.
[2024-05-24 15:23:08] [INFO ] Deduced a trap composed of 27 places in 293 ms of which 1 ms to minimize.
[2024-05-24 15:23:09] [INFO ] Deduced a trap composed of 3 places in 284 ms of which 0 ms to minimize.
[2024-05-24 15:23:09] [INFO ] Deduced a trap composed of 3 places in 234 ms of which 1 ms to minimize.
[2024-05-24 15:23:09] [INFO ] Deduced a trap composed of 29 places in 232 ms of which 1 ms to minimize.
[2024-05-24 15:23:10] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 0 ms to minimize.
[2024-05-24 15:23:10] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 1 ms to minimize.
[2024-05-24 15:23:10] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:23:10] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4629 ms
[2024-05-24 15:23:10] [INFO ] After 4911ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 108 ms.
[2024-05-24 15:23:10] [INFO ] After 5712ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 169 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 486/486 places, 2907/2907 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 337900 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 337900 steps, saw 211552 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:23:13] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:23:13] [INFO ] Invariant cache hit.
[2024-05-24 15:23:13] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-24 15:23:13] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 15:23:14] [INFO ] After 505ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:23:14] [INFO ] [Nat]Absence check using 19 positive place invariants in 22 ms returned sat
[2024-05-24 15:23:14] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 11 ms returned sat
[2024-05-24 15:23:15] [INFO ] After 489ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:23:15] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:23:15] [INFO ] After 188ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:23:15] [INFO ] Deduced a trap composed of 3 places in 386 ms of which 1 ms to minimize.
[2024-05-24 15:23:16] [INFO ] Deduced a trap composed of 15 places in 408 ms of which 1 ms to minimize.
[2024-05-24 15:23:16] [INFO ] Deduced a trap composed of 23 places in 410 ms of which 1 ms to minimize.
[2024-05-24 15:23:17] [INFO ] Deduced a trap composed of 30 places in 407 ms of which 1 ms to minimize.
[2024-05-24 15:23:17] [INFO ] Deduced a trap composed of 13 places in 353 ms of which 0 ms to minimize.
[2024-05-24 15:23:17] [INFO ] Deduced a trap composed of 3 places in 337 ms of which 1 ms to minimize.
[2024-05-24 15:23:18] [INFO ] Deduced a trap composed of 27 places in 303 ms of which 0 ms to minimize.
[2024-05-24 15:23:18] [INFO ] Deduced a trap composed of 3 places in 283 ms of which 1 ms to minimize.
[2024-05-24 15:23:18] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 0 ms to minimize.
[2024-05-24 15:23:19] [INFO ] Deduced a trap composed of 29 places in 229 ms of which 1 ms to minimize.
[2024-05-24 15:23:19] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 1 ms to minimize.
[2024-05-24 15:23:19] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 0 ms to minimize.
[2024-05-24 15:23:19] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:23:19] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4615 ms
[2024-05-24 15:23:19] [INFO ] After 4898ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 108 ms.
[2024-05-24 15:23:20] [INFO ] After 5699ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 174 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 169 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 15:23:20] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:23:20] [INFO ] Invariant cache hit.
[2024-05-24 15:23:21] [INFO ] Implicit Places using invariants in 872 ms returned []
[2024-05-24 15:23:21] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:23:21] [INFO ] Invariant cache hit.
[2024-05-24 15:23:21] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:23:26] [INFO ] Implicit Places using invariants and state equation in 5158 ms returned []
Implicit Place search using SMT with State Equation took 6032 ms to find 0 implicit places.
[2024-05-24 15:23:26] [INFO ] Redundant transitions in 165 ms returned []
[2024-05-24 15:23:26] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:23:26] [INFO ] Invariant cache hit.
[2024-05-24 15:23:29] [INFO ] Dead Transitions using invariants and state equation in 2586 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8961 ms. Remains : 486/486 places, 2907/2907 transitions.
Graph (trivial) has 2702 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 414 transition count 515
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 317 transition count 515
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 195 place count 317 transition count 496
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 242 place count 289 transition count 496
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 528 place count 146 transition count 353
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 598 place count 146 transition count 283
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 614 place count 138 transition count 283
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 622 place count 138 transition count 275
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 631 place count 138 transition count 266
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 704 place count 138 transition count 193
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 777 place count 65 transition count 193
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 786 place count 65 transition count 193
Applied a total of 786 rules in 33 ms. Remains 65 /486 variables (removed 421) and now considering 193/2907 (removed 2714) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 65 cols
[2024-05-24 15:23:29] [INFO ] Computed 19 invariants in 1 ms
[2024-05-24 15:23:29] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-24 15:23:29] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:23:29] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-24 15:23:29] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:23:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 15:23:29] [INFO ] After 16ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:23:29] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-24 15:23:29] [INFO ] After 172ms 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 95 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 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 170 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 15:23:29] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 15:23:29] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 15:23:31] [INFO ] Implicit Places using invariants in 1236 ms returned []
[2024-05-24 15:23:31] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:23:31] [INFO ] Invariant cache hit.
[2024-05-24 15:23:31] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:23:36] [INFO ] Implicit Places using invariants and state equation in 5249 ms returned []
Implicit Place search using SMT with State Equation took 6486 ms to find 0 implicit places.
[2024-05-24 15:23:36] [INFO ] Redundant transitions in 159 ms returned []
[2024-05-24 15:23:36] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:23:36] [INFO ] Invariant cache hit.
[2024-05-24 15:23:38] [INFO ] Dead Transitions using invariants and state equation in 2227 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9051 ms. Remains : 486/486 places, 2907/2907 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 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 34 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 290080 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 290080 steps, saw 184027 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:23:42] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:23:42] [INFO ] Invariant cache hit.
[2024-05-24 15:23:42] [INFO ] [Real]Absence check using 19 positive place invariants in 21 ms returned sat
[2024-05-24 15:23:42] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 11 ms returned sat
[2024-05-24 15:23:42] [INFO ] After 677ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:23:42] [INFO ] [Nat]Absence check using 19 positive place invariants in 21 ms returned sat
[2024-05-24 15:23:42] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 15:23:43] [INFO ] After 457ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:23:43] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:23:43] [INFO ] After 175ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:23:44] [INFO ] Deduced a trap composed of 3 places in 400 ms of which 0 ms to minimize.
[2024-05-24 15:23:44] [INFO ] Deduced a trap composed of 15 places in 397 ms of which 1 ms to minimize.
[2024-05-24 15:23:44] [INFO ] Deduced a trap composed of 23 places in 378 ms of which 1 ms to minimize.
[2024-05-24 15:23:45] [INFO ] Deduced a trap composed of 30 places in 400 ms of which 1 ms to minimize.
[2024-05-24 15:23:45] [INFO ] Deduced a trap composed of 13 places in 414 ms of which 1 ms to minimize.
[2024-05-24 15:23:46] [INFO ] Deduced a trap composed of 3 places in 341 ms of which 1 ms to minimize.
[2024-05-24 15:23:46] [INFO ] Deduced a trap composed of 27 places in 293 ms of which 1 ms to minimize.
[2024-05-24 15:23:46] [INFO ] Deduced a trap composed of 3 places in 289 ms of which 1 ms to minimize.
[2024-05-24 15:23:47] [INFO ] Deduced a trap composed of 3 places in 228 ms of which 0 ms to minimize.
[2024-05-24 15:23:47] [INFO ] Deduced a trap composed of 29 places in 231 ms of which 1 ms to minimize.
[2024-05-24 15:23:47] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 0 ms to minimize.
[2024-05-24 15:23:48] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 1 ms to minimize.
[2024-05-24 15:23:48] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2024-05-24 15:23:48] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4639 ms
[2024-05-24 15:23:48] [INFO ] After 4904ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 108 ms.
[2024-05-24 15:23:48] [INFO ] After 5657ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 166 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 486/486 places, 2907/2907 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 326260 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 326260 steps, saw 204934 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:23:51] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:23:51] [INFO ] Invariant cache hit.
[2024-05-24 15:23:51] [INFO ] [Real]Absence check using 19 positive place invariants in 21 ms returned sat
[2024-05-24 15:23:51] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 15:23:52] [INFO ] After 654ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:23:52] [INFO ] [Nat]Absence check using 19 positive place invariants in 21 ms returned sat
[2024-05-24 15:23:52] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 15:23:52] [INFO ] After 473ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:23:52] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:23:53] [INFO ] After 189ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:23:53] [INFO ] Deduced a trap composed of 3 places in 397 ms of which 1 ms to minimize.
[2024-05-24 15:23:54] [INFO ] Deduced a trap composed of 15 places in 398 ms of which 0 ms to minimize.
[2024-05-24 15:23:54] [INFO ] Deduced a trap composed of 23 places in 398 ms of which 1 ms to minimize.
[2024-05-24 15:23:55] [INFO ] Deduced a trap composed of 30 places in 403 ms of which 1 ms to minimize.
[2024-05-24 15:23:55] [INFO ] Deduced a trap composed of 13 places in 407 ms of which 1 ms to minimize.
[2024-05-24 15:23:55] [INFO ] Deduced a trap composed of 3 places in 368 ms of which 1 ms to minimize.
[2024-05-24 15:23:56] [INFO ] Deduced a trap composed of 27 places in 281 ms of which 0 ms to minimize.
[2024-05-24 15:23:56] [INFO ] Deduced a trap composed of 3 places in 276 ms of which 1 ms to minimize.
[2024-05-24 15:23:56] [INFO ] Deduced a trap composed of 3 places in 236 ms of which 0 ms to minimize.
[2024-05-24 15:23:57] [INFO ] Deduced a trap composed of 29 places in 246 ms of which 1 ms to minimize.
[2024-05-24 15:23:57] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 3 ms to minimize.
[2024-05-24 15:23:57] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 1 ms to minimize.
[2024-05-24 15:23:57] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2024-05-24 15:23:57] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4674 ms
[2024-05-24 15:23:57] [INFO ] After 4957ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 108 ms.
[2024-05-24 15:23:58] [INFO ] After 5736ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 167 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 166 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 15:23:58] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:23:58] [INFO ] Invariant cache hit.
[2024-05-24 15:23:59] [INFO ] Implicit Places using invariants in 1226 ms returned []
[2024-05-24 15:23:59] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:23:59] [INFO ] Invariant cache hit.
[2024-05-24 15:24:00] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:24:03] [INFO ] Implicit Places using invariants and state equation in 3769 ms returned []
Implicit Place search using SMT with State Equation took 4996 ms to find 0 implicit places.
[2024-05-24 15:24:03] [INFO ] Redundant transitions in 102 ms returned []
[2024-05-24 15:24:03] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:24:03] [INFO ] Invariant cache hit.
[2024-05-24 15:24:05] [INFO ] Dead Transitions using invariants and state equation in 1631 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6901 ms. Remains : 486/486 places, 2907/2907 transitions.
Graph (trivial) has 2702 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 414 transition count 515
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 317 transition count 515
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 195 place count 317 transition count 496
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 242 place count 289 transition count 496
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 528 place count 146 transition count 353
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 598 place count 146 transition count 283
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 614 place count 138 transition count 283
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 622 place count 138 transition count 275
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 631 place count 138 transition count 266
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 704 place count 138 transition count 193
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 777 place count 65 transition count 193
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 786 place count 65 transition count 193
Applied a total of 786 rules in 24 ms. Remains 65 /486 variables (removed 421) and now considering 193/2907 (removed 2714) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 65 cols
[2024-05-24 15:24:05] [INFO ] Computed 19 invariants in 0 ms
[2024-05-24 15:24:05] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 15:24:05] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:24:05] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-24 15:24:05] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:24:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 15:24:05] [INFO ] After 19ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:24:05] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-24 15:24:05] [INFO ] After 199ms 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 107 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 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 423 ms.
Product exploration explored 100000 steps with 0 reset in 459 ms.
Built C files in :
/tmp/ltsmin4239742940436699036
[2024-05-24 15:24:06] [INFO ] Too many transitions (2907) to apply POR reductions. Disabling POR matrices.
[2024-05-24 15:24:06] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4239742940436699036
Running compilation step : cd /tmp/ltsmin4239742940436699036;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4239742940436699036;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4239742940436699036;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 103 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 15:24:09] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 15:24:09] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 15:24:10] [INFO ] Implicit Places using invariants in 843 ms returned []
[2024-05-24 15:24:10] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:24:10] [INFO ] Invariant cache hit.
[2024-05-24 15:24:11] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:24:14] [INFO ] Implicit Places using invariants and state equation in 3761 ms returned []
Implicit Place search using SMT with State Equation took 4613 ms to find 0 implicit places.
[2024-05-24 15:24:14] [INFO ] Redundant transitions in 99 ms returned []
[2024-05-24 15:24:14] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:24:14] [INFO ] Invariant cache hit.
[2024-05-24 15:24:17] [INFO ] Dead Transitions using invariants and state equation in 2550 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7371 ms. Remains : 486/486 places, 2907/2907 transitions.
Built C files in :
/tmp/ltsmin14861096144459781949
[2024-05-24 15:24:17] [INFO ] Too many transitions (2907) to apply POR reductions. Disabling POR matrices.
[2024-05-24 15:24:17] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14861096144459781949
Running compilation step : cd /tmp/ltsmin14861096144459781949;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14861096144459781949;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14861096144459781949;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 15:24:20] [INFO ] Flatten gal took : 75 ms
[2024-05-24 15:24:20] [INFO ] Flatten gal took : 90 ms
[2024-05-24 15:24:20] [INFO ] Time to serialize gal into /tmp/LTL6430176376901907095.gal : 13 ms
[2024-05-24 15:24:20] [INFO ] Time to serialize properties into /tmp/LTL12543476789272217340.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/LTL6430176376901907095.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3125553077738598963.hoa' '-atoms' '/tmp/LTL12543476789272217340.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/LTL12543476789272217340.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3125553077738598963.hoa
Detected timeout of ITS tools.
[2024-05-24 15:24:35] [INFO ] Flatten gal took : 73 ms
[2024-05-24 15:24:35] [INFO ] Flatten gal took : 76 ms
[2024-05-24 15:24:35] [INFO ] Time to serialize gal into /tmp/LTL9337951481411983301.gal : 10 ms
[2024-05-24 15:24:35] [INFO ] Time to serialize properties into /tmp/LTL3370679004309470984.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/LTL9337951481411983301.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3370679004309470984.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("(((turn_1!=1)||(flag_1_waiting!=1))||(p25_4_7!=1))"))))
Formula 0 simplified : GF!"(((turn_1!=1)||(flag_1_waiting!=1))||(p25_4_7!=1))"
Detected timeout of ITS tools.
[2024-05-24 15:24:50] [INFO ] Flatten gal took : 73 ms
[2024-05-24 15:24:50] [INFO ] Applying decomposition
[2024-05-24 15:24:50] [INFO ] Flatten gal took : 77 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/graph231928687466913889.txt' '-o' '/tmp/graph231928687466913889.bin' '-w' '/tmp/graph231928687466913889.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph231928687466913889.bin' '-l' '-1' '-v' '-w' '/tmp/graph231928687466913889.weights' '-q' '0' '-e' '0.001'
[2024-05-24 15:24:50] [INFO ] Decomposing Gal with order
[2024-05-24 15:24:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 15:24:51] [INFO ] Removed a total of 6283 redundant transitions.
[2024-05-24 15:24:51] [INFO ] Flatten gal took : 218 ms
[2024-05-24 15:24:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 711 labels/synchronizations in 66 ms.
[2024-05-24 15:24:51] [INFO ] Time to serialize gal into /tmp/LTL17774383764589758053.gal : 14 ms
[2024-05-24 15:24:51] [INFO ] Time to serialize properties into /tmp/LTL2130120216399322496.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/LTL17774383764589758053.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2130120216399322496.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(((i4.u6.turn_1!=1)||(i0.u1.flag_1_waiting!=1))||(i12.u5.p25_4_7!=1))"))))
Formula 0 simplified : GF!"(((i4.u6.turn_1!=1)||(i0.u1.flag_1_waiting!=1))||(i12.u5.p25_4_7!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15114432359258816842
[2024-05-24 15:25:06] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15114432359258816842
Running compilation step : cd /tmp/ltsmin15114432359258816842;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15114432359258816842;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15114432359258816842;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-10 finished in 137406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((!p1 U (G(!p1)||(!p1&&G(!p2))))||p0))))'
Support contains 4 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 819 transition count 3240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 819 transition count 3240
Applied a total of 8 rules in 42 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2024-05-24 15:25:09] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
// Phase 1: matrix 1161 rows 819 cols
[2024-05-24 15:25:09] [INFO ] Computed 28 invariants in 7 ms
[2024-05-24 15:25:10] [INFO ] Implicit Places using invariants in 1194 ms returned []
[2024-05-24 15:25:10] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 15:25:10] [INFO ] Invariant cache hit.
[2024-05-24 15:25:11] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:25:18] [INFO ] Implicit Places using invariants and state equation in 7846 ms returned []
Implicit Place search using SMT with State Equation took 9042 ms to find 0 implicit places.
[2024-05-24 15:25:18] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 15:25:18] [INFO ] Invariant cache hit.
[2024-05-24 15:25:21] [INFO ] Dead Transitions using invariants and state equation in 2876 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 819/823 places, 3240/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11966 ms. Remains : 819/823 places, 3240/3276 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2)), (OR p2 (AND (NOT p0) p1))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p0) p1) (AND p2 p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 5}], [{ cond=(OR (AND (NOT p0) p1) p2), acceptance={} source=5 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(AND (EQ s17 1) (EQ s677 1)), p2:(AND (EQ s20 1) (EQ s170 1)), p0:(OR (EQ s17 0) (EQ s677 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 390 ms.
Product exploration explored 100000 steps with 0 reset in 432 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p2 p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 178 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 210 ms :[true, p1, (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2)), (OR p2 (AND (NOT p0) p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-24 15:25:23] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 15:25:23] [INFO ] Invariant cache hit.
[2024-05-24 15:25:23] [INFO ] [Real]Absence check using 19 positive place invariants in 32 ms returned sat
[2024-05-24 15:25:23] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 9 ms returned sat
[2024-05-24 15:25:24] [INFO ] After 999ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2024-05-24 15:25:24] [INFO ] [Nat]Absence check using 19 positive place invariants in 32 ms returned sat
[2024-05-24 15:25:24] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 8 ms returned sat
[2024-05-24 15:25:25] [INFO ] After 787ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2024-05-24 15:25:25] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:25:25] [INFO ] After 312ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :3 sat :4
[2024-05-24 15:25:26] [INFO ] Deduced a trap composed of 3 places in 571 ms of which 1 ms to minimize.
[2024-05-24 15:25:27] [INFO ] Deduced a trap composed of 72 places in 737 ms of which 1 ms to minimize.
[2024-05-24 15:25:28] [INFO ] Deduced a trap composed of 56 places in 796 ms of which 2 ms to minimize.
[2024-05-24 15:25:28] [INFO ] Deduced a trap composed of 3 places in 755 ms of which 1 ms to minimize.
[2024-05-24 15:25:29] [INFO ] Deduced a trap composed of 3 places in 752 ms of which 1 ms to minimize.
[2024-05-24 15:25:30] [INFO ] Deduced a trap composed of 87 places in 651 ms of which 2 ms to minimize.
[2024-05-24 15:25:31] [INFO ] Deduced a trap composed of 90 places in 613 ms of which 2 ms to minimize.
[2024-05-24 15:25:31] [INFO ] Deduced a trap composed of 39 places in 535 ms of which 1 ms to minimize.
[2024-05-24 15:25:32] [INFO ] Deduced a trap composed of 95 places in 529 ms of which 2 ms to minimize.
[2024-05-24 15:25:32] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 0 ms to minimize.
[2024-05-24 15:25:33] [INFO ] Deduced a trap composed of 3 places in 284 ms of which 1 ms to minimize.
[2024-05-24 15:25:33] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 0 ms to minimize.
[2024-05-24 15:25:33] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 7890 ms
[2024-05-24 15:25:34] [INFO ] After 8717ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 338 ms.
[2024-05-24 15:25:34] [INFO ] After 10162ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 4 out of 819 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 819/819 places, 3240/3240 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 819 transition count 3231
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 810 transition count 3231
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 18 place count 810 transition count 2981
Deduced a syphon composed of 250 places in 4 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 518 place count 560 transition count 2981
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 662 place count 488 transition count 2909
Applied a total of 662 rules in 279 ms. Remains 488 /819 variables (removed 331) and now considering 2909/3240 (removed 331) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 279 ms. Remains : 488/819 places, 2909/3240 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 123640 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 123640 steps, saw 84154 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 15:25:38] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2024-05-24 15:25:38] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 15:25:38] [INFO ] [Real]Absence check using 19 positive place invariants in 20 ms returned sat
[2024-05-24 15:25:38] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 15:25:38] [INFO ] After 805ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 15:25:39] [INFO ] [Nat]Absence check using 19 positive place invariants in 21 ms returned sat
[2024-05-24 15:25:39] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 11 ms returned sat
[2024-05-24 15:25:39] [INFO ] After 585ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 15:25:39] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:25:40] [INFO ] After 286ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 15:25:40] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-24 15:25:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2024-05-24 15:25:40] [INFO ] After 768ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 207 ms.
[2024-05-24 15:25:40] [INFO ] After 1851ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 171 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 488/488 places, 2909/2909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 167 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
[2024-05-24 15:25:41] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 15:25:41] [INFO ] Invariant cache hit.
[2024-05-24 15:25:42] [INFO ] Implicit Places using invariants in 1098 ms returned []
[2024-05-24 15:25:42] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 15:25:42] [INFO ] Invariant cache hit.
[2024-05-24 15:25:42] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:25:47] [INFO ] Implicit Places using invariants and state equation in 4758 ms returned []
Implicit Place search using SMT with State Equation took 5858 ms to find 0 implicit places.
[2024-05-24 15:25:47] [INFO ] Redundant transitions in 153 ms returned []
[2024-05-24 15:25:47] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 15:25:47] [INFO ] Invariant cache hit.
[2024-05-24 15:25:49] [INFO ] Dead Transitions using invariants and state equation in 2086 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8273 ms. Remains : 488/488 places, 2909/2909 transitions.
Graph (trivial) has 2721 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 0 ms
Free SCC test removed 71 places
Drop transitions removed 275 transitions
Ensure Unique test removed 2017 transitions
Reduce isomorphic transitions removed 2292 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 417 transition count 519
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 319 transition count 519
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 197 place count 319 transition count 501
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 241 place count 293 transition count 501
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 1 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 527 place count 150 transition count 358
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 599 place count 150 transition count 286
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 613 place count 143 transition count 287
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 620 place count 143 transition count 280
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 626 place count 143 transition count 274
Free-agglomeration rule applied 71 times.
Iterating global reduction 4 with 71 rules applied. Total rules applied 697 place count 143 transition count 203
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 4 with 71 rules applied. Total rules applied 768 place count 72 transition count 203
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 776 place count 72 transition count 203
Applied a total of 776 rules in 24 ms. Remains 72 /488 variables (removed 416) and now considering 203/2909 (removed 2706) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 203 rows 72 cols
[2024-05-24 15:25:49] [INFO ] Computed 20 invariants in 2 ms
[2024-05-24 15:25:49] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 15:25:49] [INFO ] [Real]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 15:25:49] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 15:25:49] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 15:25:49] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 15:25:49] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 15:25:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 15:25:49] [INFO ] After 31ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 15:25:49] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-24 15:25:49] [INFO ] After 239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p2 p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1)))), (G (NOT (AND p2 (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p2) p0 p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p2 (NOT p1))), (F (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (F (OR p2 (AND (NOT p0) p1)))]
Knowledge based reduction with 18 factoid took 910 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0)]
Support contains 2 out of 819 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 : 819/819 places, 3240/3240 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 819 transition count 3231
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 810 transition count 3231
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 18 place count 810 transition count 2981
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 518 place count 560 transition count 2981
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 662 place count 488 transition count 2909
Applied a total of 662 rules in 276 ms. Remains 488 /819 variables (removed 331) and now considering 2909/3240 (removed 331) transitions.
[2024-05-24 15:25:50] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2024-05-24 15:25:50] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 15:25:52] [INFO ] Implicit Places using invariants in 1253 ms returned []
[2024-05-24 15:25:52] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 15:25:52] [INFO ] Invariant cache hit.
[2024-05-24 15:25:52] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:25:57] [INFO ] Implicit Places using invariants and state equation in 5329 ms returned []
Implicit Place search using SMT with State Equation took 6584 ms to find 0 implicit places.
[2024-05-24 15:25:57] [INFO ] Redundant transitions in 158 ms returned []
[2024-05-24 15:25:57] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 15:25:57] [INFO ] Invariant cache hit.
[2024-05-24 15:26:00] [INFO ] Dead Transitions using invariants and state equation in 2440 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/819 places, 2909/3240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9466 ms. Remains : 488/819 places, 2909/3240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 76 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 46 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 342960 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 342960 steps, saw 216570 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:26:03] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 15:26:03] [INFO ] Invariant cache hit.
[2024-05-24 15:26:03] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:26:03] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-24 15:26:03] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 15:26:03] [INFO ] After 386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:26:03] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:26:04] [INFO ] After 160ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:26:04] [INFO ] After 251ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2024-05-24 15:26:04] [INFO ] After 823ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 488 transition count 2908
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 487 transition count 2908
Applied a total of 2 rules in 183 ms. Remains 487 /488 variables (removed 1) and now considering 2908/2909 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 487/488 places, 2908/2909 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 321850 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 321850 steps, saw 204053 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:26:07] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-05-24 15:26:07] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 15:26:07] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:26:07] [INFO ] [Nat]Absence check using 19 positive place invariants in 21 ms returned sat
[2024-05-24 15:26:07] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 11 ms returned sat
[2024-05-24 15:26:08] [INFO ] After 456ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:26:08] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:26:08] [INFO ] After 140ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:26:08] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-05-24 15:26:08] [INFO ] After 894ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 155 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 487/487 places, 2908/2908 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 170 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2024-05-24 15:26:08] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:26:08] [INFO ] Invariant cache hit.
[2024-05-24 15:26:10] [INFO ] Implicit Places using invariants in 1233 ms returned []
[2024-05-24 15:26:10] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:26:10] [INFO ] Invariant cache hit.
[2024-05-24 15:26:10] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:26:14] [INFO ] Implicit Places using invariants and state equation in 4825 ms returned []
Implicit Place search using SMT with State Equation took 6059 ms to find 0 implicit places.
[2024-05-24 15:26:15] [INFO ] Redundant transitions in 153 ms returned []
[2024-05-24 15:26:15] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:26:15] [INFO ] Invariant cache hit.
[2024-05-24 15:26:17] [INFO ] Dead Transitions using invariants and state equation in 2248 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8639 ms. Remains : 487/487 places, 2908/2908 transitions.
Graph (trivial) has 2724 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 415 transition count 515
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 317 transition count 515
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 317 transition count 496
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 289 transition count 496
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 146 transition count 353
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 146 transition count 281
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 618 place count 138 transition count 281
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 626 place count 138 transition count 273
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 634 place count 138 transition count 265
Free-agglomeration rule applied 71 times.
Iterating global reduction 4 with 71 rules applied. Total rules applied 705 place count 138 transition count 194
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 4 with 71 rules applied. Total rules applied 776 place count 67 transition count 194
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 784 place count 67 transition count 194
Applied a total of 784 rules in 24 ms. Remains 67 /487 variables (removed 420) and now considering 194/2908 (removed 2714) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 194 rows 67 cols
[2024-05-24 15:26:17] [INFO ] Computed 19 invariants in 0 ms
[2024-05-24 15:26:17] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:26:17] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 15:26:17] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:26:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 15:26:17] [INFO ] After 8ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:26:17] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-24 15:26:17] [INFO ] After 117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 72 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 45 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 423 ms.
Product exploration explored 100000 steps with 0 reset in 500 ms.
Built C files in :
/tmp/ltsmin5333194242424857737
[2024-05-24 15:26:18] [INFO ] Too many transitions (2909) to apply POR reductions. Disabling POR matrices.
[2024-05-24 15:26:18] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5333194242424857737
Running compilation step : cd /tmp/ltsmin5333194242424857737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5333194242424857737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5333194242424857737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 488 transition count 2908
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 487 transition count 2908
Applied a total of 2 rules in 110 ms. Remains 487 /488 variables (removed 1) and now considering 2908/2909 (removed 1) transitions.
[2024-05-24 15:26:21] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-05-24 15:26:21] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 15:26:22] [INFO ] Implicit Places using invariants in 983 ms returned []
[2024-05-24 15:26:22] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:26:22] [INFO ] Invariant cache hit.
[2024-05-24 15:26:23] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:26:27] [INFO ] Implicit Places using invariants and state equation in 4229 ms returned []
Implicit Place search using SMT with State Equation took 5214 ms to find 0 implicit places.
[2024-05-24 15:26:27] [INFO ] Redundant transitions in 136 ms returned []
[2024-05-24 15:26:27] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:26:27] [INFO ] Invariant cache hit.
[2024-05-24 15:26:29] [INFO ] Dead Transitions using invariants and state equation in 1834 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/488 places, 2908/2909 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7304 ms. Remains : 487/488 places, 2908/2909 transitions.
Built C files in :
/tmp/ltsmin5065186719753458489
[2024-05-24 15:26:29] [INFO ] Too many transitions (2908) to apply POR reductions. Disabling POR matrices.
[2024-05-24 15:26:29] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5065186719753458489
Running compilation step : cd /tmp/ltsmin5065186719753458489;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5065186719753458489;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5065186719753458489;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 15:26:32] [INFO ] Flatten gal took : 77 ms
[2024-05-24 15:26:32] [INFO ] Flatten gal took : 124 ms
[2024-05-24 15:26:32] [INFO ] Time to serialize gal into /tmp/LTL18286511602245696708.gal : 16 ms
[2024-05-24 15:26:32] [INFO ] Time to serialize properties into /tmp/LTL17270807271315683326.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/LTL18286511602245696708.gal' '-t' 'CGAL' '-hoa' '/tmp/aut165773793481729450.hoa' '-atoms' '/tmp/LTL17270807271315683326.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/LTL17270807271315683326.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut165773793481729450.hoa
Detected timeout of ITS tools.
[2024-05-24 15:26:47] [INFO ] Flatten gal took : 75 ms
[2024-05-24 15:26:47] [INFO ] Flatten gal took : 76 ms
[2024-05-24 15:26:47] [INFO ] Time to serialize gal into /tmp/LTL14575922485939872101.gal : 11 ms
[2024-05-24 15:26:47] [INFO ] Time to serialize properties into /tmp/LTL1787504458836427953.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/LTL14575922485939872101.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1787504458836427953.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("((flag_2_active==0)||(p33_4_2==0))")||((!("((flag_2_active==1)&&(p33_4_2==1))"))U((G(!("((flag_2_active==1)&&(p33_4_2==1))"))...253
Formula 0 simplified : XF(!"((flag_2_active==0)||(p33_4_2==0))" & (F"((flag_3_active==1)&&(p09_4_3==1))" U "((flag_2_active==1)&&(p33_4_2==1))"))
Detected timeout of ITS tools.
[2024-05-24 15:27:02] [INFO ] Flatten gal took : 82 ms
[2024-05-24 15:27:02] [INFO ] Applying decomposition
[2024-05-24 15:27:02] [INFO ] Flatten gal took : 74 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/graph16154153718149030099.txt' '-o' '/tmp/graph16154153718149030099.bin' '-w' '/tmp/graph16154153718149030099.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16154153718149030099.bin' '-l' '-1' '-v' '-w' '/tmp/graph16154153718149030099.weights' '-q' '0' '-e' '0.001'
[2024-05-24 15:27:02] [INFO ] Decomposing Gal with order
[2024-05-24 15:27:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 15:27:03] [INFO ] Removed a total of 6325 redundant transitions.
[2024-05-24 15:27:03] [INFO ] Flatten gal took : 215 ms
[2024-05-24 15:27:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 641 labels/synchronizations in 71 ms.
[2024-05-24 15:27:03] [INFO ] Time to serialize gal into /tmp/LTL16493902859684275891.gal : 15 ms
[2024-05-24 15:27:03] [INFO ] Time to serialize properties into /tmp/LTL13667548980957471201.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/LTL16493902859684275891.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13667548980957471201.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i4.u8.flag_2_active==0)||(i4.u41.p33_4_2==0))")||((!("((i4.u8.flag_2_active==1)&&(i4.u41.p33_4_2==1))"))U((G(!("((i4.u8.fla...319
Formula 0 simplified : XF(!"((i4.u8.flag_2_active==0)||(i4.u41.p33_4_2==0))" & (F"((i4.u8.flag_3_active==1)&&(i11.u18.p09_4_3==1))" U "((i4.u8.flag_2_activ...185
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10918893932227785580
[2024-05-24 15:27:18] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10918893932227785580
Running compilation step : cd /tmp/ltsmin10918893932227785580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10918893932227785580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10918893932227785580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-11 finished in 132059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(X(F(p1)))))))'
Support contains 5 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 820 transition count 3249
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 820 transition count 3249
Applied a total of 6 rules in 42 ms. Remains 820 /823 variables (removed 3) and now considering 3249/3276 (removed 27) transitions.
[2024-05-24 15:27:21] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2024-05-24 15:27:21] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 15:27:22] [INFO ] Implicit Places using invariants in 1214 ms returned []
[2024-05-24 15:27:22] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 15:27:22] [INFO ] Invariant cache hit.
[2024-05-24 15:27:23] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:27:29] [INFO ] Implicit Places using invariants and state equation in 6862 ms returned []
Implicit Place search using SMT with State Equation took 8077 ms to find 0 implicit places.
[2024-05-24 15:27:29] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 15:27:29] [INFO ] Invariant cache hit.
[2024-05-24 15:27:32] [INFO ] Dead Transitions using invariants and state equation in 3110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 820/823 places, 3249/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11230 ms. Remains : 820/823 places, 3249/3276 transitions.
Stuttering acceptance computed with spot in 194 ms :[(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 : EisenbergMcGuire-PT-09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s207 1)), p1:(OR (EQ s1 0) (EQ s13 0) (EQ s587 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1331 ms.
Product exploration explored 100000 steps with 25000 reset in 882 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 300360 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 300360 steps, saw 225232 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:27:38] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 15:27:38] [INFO ] Invariant cache hit.
[2024-05-24 15:27:38] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:27:38] [INFO ] [Nat]Absence check using 19 positive place invariants in 47 ms returned sat
[2024-05-24 15:27:38] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 14 ms returned sat
[2024-05-24 15:27:39] [INFO ] After 804ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:27:39] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:27:39] [INFO ] After 315ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:27:40] [INFO ] Deduced a trap composed of 3 places in 625 ms of which 2 ms to minimize.
[2024-05-24 15:27:41] [INFO ] Deduced a trap composed of 3 places in 533 ms of which 1 ms to minimize.
[2024-05-24 15:27:41] [INFO ] Deduced a trap composed of 3 places in 386 ms of which 1 ms to minimize.
[2024-05-24 15:27:42] [INFO ] Deduced a trap composed of 45 places in 485 ms of which 1 ms to minimize.
[2024-05-24 15:27:43] [INFO ] Deduced a trap composed of 3 places in 538 ms of which 0 ms to minimize.
[2024-05-24 15:27:43] [INFO ] Deduced a trap composed of 3 places in 394 ms of which 1 ms to minimize.
[2024-05-24 15:27:44] [INFO ] Deduced a trap composed of 3 places in 284 ms of which 1 ms to minimize.
[2024-05-24 15:27:44] [INFO ] Deduced a trap composed of 3 places in 288 ms of which 0 ms to minimize.
[2024-05-24 15:27:44] [INFO ] Deduced a trap composed of 45 places in 290 ms of which 1 ms to minimize.
[2024-05-24 15:27:45] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 1 ms to minimize.
[2024-05-24 15:27:45] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 0 ms to minimize.
[2024-05-24 15:27:45] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5447 ms
[2024-05-24 15:27:45] [INFO ] After 5932ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 220 ms.
[2024-05-24 15:27:45] [INFO ] After 7216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 820 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 811 transition count 2988
Deduced a syphon composed of 252 places in 5 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 559 transition count 2988
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 666 place count 487 transition count 2916
Applied a total of 666 rules in 282 ms. Remains 487 /820 variables (removed 333) and now considering 2916/3249 (removed 333) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 282 ms. Remains : 487/820 places, 2916/3249 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 328460 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 328460 steps, saw 207485 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:27:49] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 15:27:49] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 15:27:49] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:27:49] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-24 15:27:49] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2024-05-24 15:27:49] [INFO ] After 334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:27:49] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:27:49] [INFO ] After 119ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:27:50] [INFO ] Deduced a trap composed of 3 places in 230 ms of which 0 ms to minimize.
[2024-05-24 15:27:50] [INFO ] Deduced a trap composed of 3 places in 382 ms of which 1 ms to minimize.
[2024-05-24 15:27:51] [INFO ] Deduced a trap composed of 12 places in 393 ms of which 1 ms to minimize.
[2024-05-24 15:27:51] [INFO ] Deduced a trap composed of 12 places in 384 ms of which 1 ms to minimize.
[2024-05-24 15:27:51] [INFO ] Deduced a trap composed of 38 places in 398 ms of which 0 ms to minimize.
[2024-05-24 15:27:52] [INFO ] Deduced a trap composed of 23 places in 383 ms of which 1 ms to minimize.
[2024-05-24 15:27:52] [INFO ] Deduced a trap composed of 3 places in 482 ms of which 1 ms to minimize.
[2024-05-24 15:27:53] [INFO ] Deduced a trap composed of 28 places in 388 ms of which 1 ms to minimize.
[2024-05-24 15:27:53] [INFO ] Deduced a trap composed of 3 places in 331 ms of which 1 ms to minimize.
[2024-05-24 15:27:54] [INFO ] Deduced a trap composed of 28 places in 337 ms of which 1 ms to minimize.
[2024-05-24 15:27:54] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 0 ms to minimize.
[2024-05-24 15:27:54] [INFO ] Deduced a trap composed of 29 places in 228 ms of which 1 ms to minimize.
[2024-05-24 15:27:55] [INFO ] Deduced a trap composed of 31 places in 252 ms of which 0 ms to minimize.
[2024-05-24 15:27:55] [INFO ] Deduced a trap composed of 20 places in 264 ms of which 1 ms to minimize.
[2024-05-24 15:27:55] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5653 ms
[2024-05-24 15:27:55] [INFO ] After 5862ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 118 ms.
[2024-05-24 15:27:55] [INFO ] After 6440ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 171 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 487/487 places, 2916/2916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 167 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 15:27:56] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:27:56] [INFO ] Invariant cache hit.
[2024-05-24 15:27:57] [INFO ] Implicit Places using invariants in 1185 ms returned []
[2024-05-24 15:27:57] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:27:57] [INFO ] Invariant cache hit.
[2024-05-24 15:27:57] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:28:01] [INFO ] Implicit Places using invariants and state equation in 3838 ms returned []
Implicit Place search using SMT with State Equation took 5025 ms to find 0 implicit places.
[2024-05-24 15:28:01] [INFO ] Redundant transitions in 149 ms returned []
[2024-05-24 15:28:01] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:28:01] [INFO ] Invariant cache hit.
[2024-05-24 15:28:03] [INFO ] Dead Transitions using invariants and state equation in 1836 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7184 ms. Remains : 487/487 places, 2916/2916 transitions.
Graph (trivial) has 2700 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions removed 277 transitions
Ensure Unique test removed 2024 transitions
Reduce isomorphic transitions removed 2301 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 518
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 518
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 318 transition count 500
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 292 transition count 500
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 525 place count 149 transition count 357
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 595 place count 149 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 609 place count 142 transition count 287
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 616 place count 142 transition count 280
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 625 place count 142 transition count 271
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 699 place count 142 transition count 197
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 773 place count 68 transition count 197
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 782 place count 68 transition count 197
Applied a total of 782 rules in 24 ms. Remains 68 /487 variables (removed 419) and now considering 197/2916 (removed 2719) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 197 rows 68 cols
[2024-05-24 15:28:03] [INFO ] Computed 20 invariants in 1 ms
[2024-05-24 15:28:03] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:28:03] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 15:28:03] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 15:28:03] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:28:03] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 15:28:03] [INFO ] After 24ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:28:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-24 15:28:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-24 15:28:03] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-24 15:28:03] [INFO ] After 231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(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 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 820 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Applied a total of 0 rules in 35 ms. Remains 820 /820 variables (removed 0) and now considering 3249/3249 (removed 0) transitions.
[2024-05-24 15:28:03] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2024-05-24 15:28:03] [INFO ] Computed 28 invariants in 4 ms
[2024-05-24 15:28:05] [INFO ] Implicit Places using invariants in 1319 ms returned []
[2024-05-24 15:28:05] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 15:28:05] [INFO ] Invariant cache hit.
[2024-05-24 15:28:06] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:28:12] [INFO ] Implicit Places using invariants and state equation in 7257 ms returned []
Implicit Place search using SMT with State Equation took 8577 ms to find 0 implicit places.
[2024-05-24 15:28:12] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 15:28:12] [INFO ] Invariant cache hit.
[2024-05-24 15:28:15] [INFO ] Dead Transitions using invariants and state equation in 2621 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11235 ms. Remains : 820/820 places, 3249/3249 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 288230 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 288230 steps, saw 216219 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:28:18] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 15:28:18] [INFO ] Invariant cache hit.
[2024-05-24 15:28:18] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:28:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 46 ms returned sat
[2024-05-24 15:28:19] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 13 ms returned sat
[2024-05-24 15:28:19] [INFO ] After 738ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:28:19] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:28:19] [INFO ] After 212ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:28:20] [INFO ] Deduced a trap composed of 3 places in 553 ms of which 1 ms to minimize.
[2024-05-24 15:28:21] [INFO ] Deduced a trap composed of 3 places in 530 ms of which 1 ms to minimize.
[2024-05-24 15:28:21] [INFO ] Deduced a trap composed of 3 places in 419 ms of which 1 ms to minimize.
[2024-05-24 15:28:22] [INFO ] Deduced a trap composed of 45 places in 484 ms of which 1 ms to minimize.
[2024-05-24 15:28:23] [INFO ] Deduced a trap composed of 3 places in 515 ms of which 1 ms to minimize.
[2024-05-24 15:28:23] [INFO ] Deduced a trap composed of 3 places in 399 ms of which 0 ms to minimize.
[2024-05-24 15:28:23] [INFO ] Deduced a trap composed of 3 places in 305 ms of which 1 ms to minimize.
[2024-05-24 15:28:24] [INFO ] Deduced a trap composed of 3 places in 293 ms of which 1 ms to minimize.
[2024-05-24 15:28:24] [INFO ] Deduced a trap composed of 45 places in 288 ms of which 0 ms to minimize.
[2024-05-24 15:28:25] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 1 ms to minimize.
[2024-05-24 15:28:25] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 1 ms to minimize.
[2024-05-24 15:28:25] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5373 ms
[2024-05-24 15:28:25] [INFO ] After 5720ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 220 ms.
[2024-05-24 15:28:25] [INFO ] After 6964ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 820 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 811 transition count 2988
Deduced a syphon composed of 252 places in 5 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 559 transition count 2988
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 666 place count 487 transition count 2916
Applied a total of 666 rules in 276 ms. Remains 487 /820 variables (removed 333) and now considering 2916/3249 (removed 333) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 487/820 places, 2916/3249 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 325440 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 325440 steps, saw 205796 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:28:29] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 15:28:29] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 15:28:29] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:28:29] [INFO ] [Nat]Absence check using 19 positive place invariants in 21 ms returned sat
[2024-05-24 15:28:29] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 11 ms returned sat
[2024-05-24 15:28:29] [INFO ] After 499ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:28:29] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:28:30] [INFO ] After 178ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:28:30] [INFO ] Deduced a trap composed of 3 places in 345 ms of which 1 ms to minimize.
[2024-05-24 15:28:30] [INFO ] Deduced a trap composed of 3 places in 386 ms of which 0 ms to minimize.
[2024-05-24 15:28:31] [INFO ] Deduced a trap composed of 12 places in 394 ms of which 1 ms to minimize.
[2024-05-24 15:28:31] [INFO ] Deduced a trap composed of 12 places in 388 ms of which 1 ms to minimize.
[2024-05-24 15:28:32] [INFO ] Deduced a trap composed of 38 places in 422 ms of which 1 ms to minimize.
[2024-05-24 15:28:32] [INFO ] Deduced a trap composed of 23 places in 377 ms of which 1 ms to minimize.
[2024-05-24 15:28:33] [INFO ] Deduced a trap composed of 3 places in 490 ms of which 1 ms to minimize.
[2024-05-24 15:28:33] [INFO ] Deduced a trap composed of 28 places in 373 ms of which 1 ms to minimize.
[2024-05-24 15:28:34] [INFO ] Deduced a trap composed of 3 places in 345 ms of which 1 ms to minimize.
[2024-05-24 15:28:34] [INFO ] Deduced a trap composed of 28 places in 331 ms of which 1 ms to minimize.
[2024-05-24 15:28:34] [INFO ] Deduced a trap composed of 5 places in 282 ms of which 1 ms to minimize.
[2024-05-24 15:28:35] [INFO ] Deduced a trap composed of 29 places in 229 ms of which 0 ms to minimize.
[2024-05-24 15:28:35] [INFO ] Deduced a trap composed of 31 places in 246 ms of which 0 ms to minimize.
[2024-05-24 15:28:35] [INFO ] Deduced a trap composed of 20 places in 272 ms of which 0 ms to minimize.
[2024-05-24 15:28:35] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5842 ms
[2024-05-24 15:28:35] [INFO ] After 6138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 117 ms.
[2024-05-24 15:28:36] [INFO ] After 6935ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 166 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 487/487 places, 2916/2916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 170 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 15:28:36] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:28:36] [INFO ] Invariant cache hit.
[2024-05-24 15:28:37] [INFO ] Implicit Places using invariants in 1182 ms returned []
[2024-05-24 15:28:37] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:28:37] [INFO ] Invariant cache hit.
[2024-05-24 15:28:38] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:28:42] [INFO ] Implicit Places using invariants and state equation in 4584 ms returned []
Implicit Place search using SMT with State Equation took 5769 ms to find 0 implicit places.
[2024-05-24 15:28:42] [INFO ] Redundant transitions in 152 ms returned []
[2024-05-24 15:28:42] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:28:42] [INFO ] Invariant cache hit.
[2024-05-24 15:28:44] [INFO ] Dead Transitions using invariants and state equation in 2456 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8558 ms. Remains : 487/487 places, 2916/2916 transitions.
Graph (trivial) has 2700 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions removed 277 transitions
Ensure Unique test removed 2024 transitions
Reduce isomorphic transitions removed 2301 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 518
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 518
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 318 transition count 500
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 292 transition count 500
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 525 place count 149 transition count 357
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 595 place count 149 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 609 place count 142 transition count 287
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 616 place count 142 transition count 280
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 625 place count 142 transition count 271
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 699 place count 142 transition count 197
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 773 place count 68 transition count 197
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 782 place count 68 transition count 197
Applied a total of 782 rules in 24 ms. Remains 68 /487 variables (removed 419) and now considering 197/2916 (removed 2719) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 197 rows 68 cols
[2024-05-24 15:28:44] [INFO ] Computed 20 invariants in 1 ms
[2024-05-24 15:28:44] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:28:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-24 15:28:44] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 15:28:44] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:28:44] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 15:28:44] [INFO ] After 14ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:28:45] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-24 15:28:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-24 15:28:45] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-24 15:28:45] [INFO ] After 174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(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 207 ms :[(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 207 ms :[(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 1223 ms.
Product exploration explored 100000 steps with 25000 reset in 893 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 820 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 820 transition count 3249
Performed 243 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 243 Pre rules applied. Total rules applied 9 place count 820 transition count 3663
Deduced a syphon composed of 252 places in 6 ms
Iterating global reduction 1 with 243 rules applied. Total rules applied 252 place count 820 transition count 3663
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 333 places in 6 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 333 place count 820 transition count 3663
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 342 place count 811 transition count 3654
Deduced a syphon composed of 324 places in 5 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 351 place count 811 transition count 3654
Deduced a syphon composed of 324 places in 6 ms
Applied a total of 351 rules in 504 ms. Remains 811 /820 variables (removed 9) and now considering 3654/3249 (removed -405) transitions.
[2024-05-24 15:28:48] [INFO ] Redundant transitions in 167 ms returned []
[2024-05-24 15:28:48] [INFO ] Flow matrix only has 1368 transitions (discarded 2286 similar events)
// Phase 1: matrix 1368 rows 811 cols
[2024-05-24 15:28:48] [INFO ] Computed 28 invariants in 4 ms
[2024-05-24 15:28:52] [INFO ] Dead Transitions using invariants and state equation in 3412 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 811/820 places, 3654/3249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4092 ms. Remains : 811/820 places, 3654/3249 transitions.
Built C files in :
/tmp/ltsmin11004872105285933101
[2024-05-24 15:28:52] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11004872105285933101
Running compilation step : cd /tmp/ltsmin11004872105285933101;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11004872105285933101;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11004872105285933101;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 820 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Applied a total of 0 rules in 43 ms. Remains 820 /820 variables (removed 0) and now considering 3249/3249 (removed 0) transitions.
[2024-05-24 15:28:55] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2024-05-24 15:28:55] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 15:28:56] [INFO ] Implicit Places using invariants in 1179 ms returned []
[2024-05-24 15:28:56] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 15:28:56] [INFO ] Invariant cache hit.
[2024-05-24 15:28:57] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:29:03] [INFO ] Implicit Places using invariants and state equation in 7169 ms returned []
Implicit Place search using SMT with State Equation took 8349 ms to find 0 implicit places.
[2024-05-24 15:29:03] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 15:29:03] [INFO ] Invariant cache hit.
[2024-05-24 15:29:06] [INFO ] Dead Transitions using invariants and state equation in 2962 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11354 ms. Remains : 820/820 places, 3249/3249 transitions.
Built C files in :
/tmp/ltsmin1091027702184725530
[2024-05-24 15:29:06] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1091027702184725530
Running compilation step : cd /tmp/ltsmin1091027702184725530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1091027702184725530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1091027702184725530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 15:29:09] [INFO ] Flatten gal took : 80 ms
[2024-05-24 15:29:09] [INFO ] Flatten gal took : 85 ms
[2024-05-24 15:29:09] [INFO ] Time to serialize gal into /tmp/LTL4156839031294647901.gal : 11 ms
[2024-05-24 15:29:09] [INFO ] Time to serialize properties into /tmp/LTL154395110194408696.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/LTL4156839031294647901.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17285055076631613080.hoa' '-atoms' '/tmp/LTL154395110194408696.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...317
Loading property file /tmp/LTL154395110194408696.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17285055076631613080.hoa
Detected timeout of ITS tools.
[2024-05-24 15:29:25] [INFO ] Flatten gal took : 80 ms
[2024-05-24 15:29:25] [INFO ] Flatten gal took : 85 ms
[2024-05-24 15:29:25] [INFO ] Time to serialize gal into /tmp/LTL6097090099425943907.gal : 13 ms
[2024-05-24 15:29:25] [INFO ] Time to serialize properties into /tmp/LTL8422409248479319519.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/LTL6097090099425943907.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8422409248479319519.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((X(X(F("(((turn_1==0)||(flag_1_waiting==0))||(p25_5_1==0))"))))||("((turn_3==1)&&(p10_8_2==1))")))))
Formula 0 simplified : XG(!"((turn_3==1)&&(p10_8_2==1))" & XXG!"(((turn_1==0)||(flag_1_waiting==0))||(p25_5_1==0))")
Detected timeout of ITS tools.
[2024-05-24 15:29:40] [INFO ] Flatten gal took : 80 ms
[2024-05-24 15:29:40] [INFO ] Applying decomposition
[2024-05-24 15:29:40] [INFO ] Flatten gal took : 83 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/graph12333050668311437028.txt' '-o' '/tmp/graph12333050668311437028.bin' '-w' '/tmp/graph12333050668311437028.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12333050668311437028.bin' '-l' '-1' '-v' '-w' '/tmp/graph12333050668311437028.weights' '-q' '0' '-e' '0.001'
[2024-05-24 15:29:40] [INFO ] Decomposing Gal with order
[2024-05-24 15:29:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 15:29:40] [INFO ] Removed a total of 6423 redundant transitions.
[2024-05-24 15:29:41] [INFO ] Flatten gal took : 349 ms
[2024-05-24 15:29:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 742 labels/synchronizations in 113 ms.
[2024-05-24 15:29:41] [INFO ] Time to serialize gal into /tmp/LTL14163673697099313941.gal : 15 ms
[2024-05-24 15:29:41] [INFO ] Time to serialize properties into /tmp/LTL16470095010897998080.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/LTL14163673697099313941.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16470095010897998080.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F((X(X(F("(((i14.u2.turn_1==0)||(i10.u201.flag_1_waiting==0))||(i21.i1.i2.u205.p25_5_1==0))"))))||("((i14.u2.turn_3==1)&&(i4.u74....173
Formula 0 simplified : XG(!"((i14.u2.turn_3==1)&&(i4.u74.p10_8_2==1))" & XXG!"(((i14.u2.turn_1==0)||(i10.u201.flag_1_waiting==0))||(i21.i1.i2.u205.p25_5_1=...161
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6949201972591375894
[2024-05-24 15:29:56] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6949201972591375894
Running compilation step : cd /tmp/ltsmin6949201972591375894;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6949201972591375894;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6949201972591375894;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-13 finished in 157930 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||F((F(p2)&&p1))))'
Support contains 7 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 820 transition count 3249
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 820 transition count 3249
Applied a total of 6 rules in 57 ms. Remains 820 /823 variables (removed 3) and now considering 3249/3276 (removed 27) transitions.
[2024-05-24 15:29:59] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2024-05-24 15:29:59] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 15:30:00] [INFO ] Implicit Places using invariants in 1079 ms returned []
[2024-05-24 15:30:00] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 15:30:00] [INFO ] Invariant cache hit.
[2024-05-24 15:30:01] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:30:08] [INFO ] Implicit Places using invariants and state equation in 7683 ms returned []
Implicit Place search using SMT with State Equation took 8763 ms to find 0 implicit places.
[2024-05-24 15:30:08] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 15:30:08] [INFO ] Invariant cache hit.
[2024-05-24 15:30:11] [INFO ] Dead Transitions using invariants and state equation in 3043 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 820/823 places, 3249/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11865 ms. Remains : 820/823 places, 3249/3276 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s22 1) (EQ s154 1)), p2:(AND (EQ s4 1) (EQ s207 1)), p0:(AND (EQ s3 1) (EQ s19 1) (EQ s596 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 25 reset in 297 ms.
Stack based approach found an accepted trace after 66 steps with 0 reset with depth 67 and stack size 67 in 1 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-14 finished in 12294 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)||(X(F(X(F(X(F(p1)))))) U p2))))'
Support contains 5 out of 823 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 : 823/823 places, 3276/3276 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 814 transition count 3015
Deduced a syphon composed of 252 places in 4 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 562 transition count 3015
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 526 place count 558 transition count 2979
Iterating global reduction 2 with 4 rules applied. Total rules applied 530 place count 558 transition count 2979
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 674 place count 486 transition count 2907
Applied a total of 674 rules in 306 ms. Remains 486 /823 variables (removed 337) and now considering 2907/3276 (removed 369) transitions.
[2024-05-24 15:30:11] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 15:30:11] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 15:30:12] [INFO ] Implicit Places using invariants in 875 ms returned []
[2024-05-24 15:30:12] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:30:12] [INFO ] Invariant cache hit.
[2024-05-24 15:30:13] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:30:17] [INFO ] Implicit Places using invariants and state equation in 5038 ms returned []
Implicit Place search using SMT with State Equation took 5915 ms to find 0 implicit places.
[2024-05-24 15:30:17] [INFO ] Redundant transitions in 100 ms returned []
[2024-05-24 15:30:17] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 15:30:17] [INFO ] Invariant cache hit.
[2024-05-24 15:30:20] [INFO ] Dead Transitions using invariants and state equation in 2361 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 486/823 places, 2907/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8690 ms. Remains : 486/823 places, 2907/3276 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s22 1) (EQ s342 1)), p2:(AND (EQ s23 1) (EQ s472 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 131 reset in 306 ms.
Stack based approach found an accepted trace after 34 steps with 0 reset with depth 35 and stack size 35 in 1 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-15 finished in 9057 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))))'
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' '!(X(G((G(p1)||p0))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-09-LTLFireability-06
Stuttering acceptance computed with spot in 169 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 823 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 814 transition count 3015
Deduced a syphon composed of 252 places in 4 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 562 transition count 3015
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 525 place count 559 transition count 2988
Iterating global reduction 2 with 3 rules applied. Total rules applied 528 place count 559 transition count 2988
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 672 place count 487 transition count 2916
Applied a total of 672 rules in 211 ms. Remains 487 /823 variables (removed 336) and now considering 2916/3276 (removed 360) transitions.
[2024-05-24 15:30:21] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 15:30:21] [INFO ] Computed 28 invariants in 4 ms
[2024-05-24 15:30:22] [INFO ] Implicit Places using invariants in 941 ms returned []
[2024-05-24 15:30:22] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:30:22] [INFO ] Invariant cache hit.
[2024-05-24 15:30:22] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:30:26] [INFO ] Implicit Places using invariants and state equation in 3972 ms returned []
Implicit Place search using SMT with State Equation took 4914 ms to find 0 implicit places.
[2024-05-24 15:30:26] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:30:26] [INFO ] Invariant cache hit.
[2024-05-24 15:30:28] [INFO ] Dead Transitions using invariants and state equation in 2187 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 487/823 places, 2916/3276 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 7313 ms. Remains : 487/823 places, 2916/3276 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s6 0) (EQ s135 0)), p0:(OR (EQ s5 0) (EQ s26 0) (EQ s366 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 296 ms.
Product exploration explored 100000 steps with 0 reset in 359 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 104 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 167730 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 167730 steps, saw 110963 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 15:30:32] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:30:32] [INFO ] Invariant cache hit.
[2024-05-24 15:30:33] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 15:30:33] [INFO ] [Nat]Absence check using 19 positive place invariants in 21 ms returned sat
[2024-05-24 15:30:33] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 11 ms returned sat
[2024-05-24 15:30:33] [INFO ] After 640ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-24 15:30:33] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:30:34] [INFO ] After 413ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-24 15:30:34] [INFO ] Deduced a trap composed of 12 places in 484 ms of which 1 ms to minimize.
[2024-05-24 15:30:35] [INFO ] Deduced a trap composed of 4 places in 386 ms of which 1 ms to minimize.
[2024-05-24 15:30:35] [INFO ] Deduced a trap composed of 55 places in 394 ms of which 1 ms to minimize.
[2024-05-24 15:30:36] [INFO ] Deduced a trap composed of 6 places in 413 ms of which 0 ms to minimize.
[2024-05-24 15:30:36] [INFO ] Deduced a trap composed of 3 places in 411 ms of which 1 ms to minimize.
[2024-05-24 15:30:37] [INFO ] Deduced a trap composed of 3 places in 389 ms of which 0 ms to minimize.
[2024-05-24 15:30:37] [INFO ] Deduced a trap composed of 19 places in 406 ms of which 1 ms to minimize.
[2024-05-24 15:30:38] [INFO ] Deduced a trap composed of 61 places in 370 ms of which 1 ms to minimize.
[2024-05-24 15:30:38] [INFO ] Deduced a trap composed of 37 places in 374 ms of which 0 ms to minimize.
[2024-05-24 15:30:38] [INFO ] Deduced a trap composed of 3 places in 251 ms of which 1 ms to minimize.
[2024-05-24 15:30:39] [INFO ] Deduced a trap composed of 3 places in 316 ms of which 1 ms to minimize.
[2024-05-24 15:30:39] [INFO ] Deduced a trap composed of 59 places in 325 ms of which 1 ms to minimize.
[2024-05-24 15:30:39] [INFO ] Deduced a trap composed of 27 places in 275 ms of which 1 ms to minimize.
[2024-05-24 15:30:40] [INFO ] Deduced a trap composed of 35 places in 250 ms of which 0 ms to minimize.
[2024-05-24 15:30:40] [INFO ] Deduced a trap composed of 3 places in 251 ms of which 1 ms to minimize.
[2024-05-24 15:30:40] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 1 ms to minimize.
[2024-05-24 15:30:41] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2024-05-24 15:30:41] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 6752 ms
[2024-05-24 15:30:41] [INFO ] Deduced a trap composed of 3 places in 348 ms of which 1 ms to minimize.
[2024-05-24 15:30:41] [INFO ] Deduced a trap composed of 23 places in 257 ms of which 0 ms to minimize.
[2024-05-24 15:30:42] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 0 ms to minimize.
[2024-05-24 15:30:42] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 1 ms to minimize.
[2024-05-24 15:30:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1263 ms
[2024-05-24 15:30:42] [INFO ] After 8725ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 330 ms.
[2024-05-24 15:30:43] [INFO ] After 9918ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 175 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 487/487 places, 2916/2916 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 189680 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 189680 steps, saw 124331 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 15:30:46] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:30:46] [INFO ] Invariant cache hit.
[2024-05-24 15:30:46] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 15:30:46] [INFO ] [Nat]Absence check using 19 positive place invariants in 22 ms returned sat
[2024-05-24 15:30:46] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 11 ms returned sat
[2024-05-24 15:30:47] [INFO ] After 634ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 15:30:47] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:30:47] [INFO ] After 380ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 15:30:48] [INFO ] Deduced a trap composed of 3 places in 386 ms of which 0 ms to minimize.
[2024-05-24 15:30:48] [INFO ] Deduced a trap composed of 3 places in 420 ms of which 1 ms to minimize.
[2024-05-24 15:30:49] [INFO ] Deduced a trap composed of 12 places in 464 ms of which 0 ms to minimize.
[2024-05-24 15:30:49] [INFO ] Deduced a trap composed of 51 places in 438 ms of which 1 ms to minimize.
[2024-05-24 15:30:50] [INFO ] Deduced a trap composed of 49 places in 480 ms of which 1 ms to minimize.
[2024-05-24 15:30:50] [INFO ] Deduced a trap composed of 5 places in 422 ms of which 1 ms to minimize.
[2024-05-24 15:30:51] [INFO ] Deduced a trap composed of 3 places in 439 ms of which 1 ms to minimize.
[2024-05-24 15:30:51] [INFO ] Deduced a trap composed of 28 places in 358 ms of which 0 ms to minimize.
[2024-05-24 15:30:52] [INFO ] Deduced a trap composed of 25 places in 369 ms of which 1 ms to minimize.
[2024-05-24 15:30:52] [INFO ] Deduced a trap composed of 31 places in 316 ms of which 0 ms to minimize.
[2024-05-24 15:30:52] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 0 ms to minimize.
[2024-05-24 15:30:53] [INFO ] Deduced a trap composed of 35 places in 316 ms of which 1 ms to minimize.
[2024-05-24 15:30:53] [INFO ] Deduced a trap composed of 15 places in 315 ms of which 0 ms to minimize.
[2024-05-24 15:30:54] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 1 ms to minimize.
[2024-05-24 15:30:54] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 1 ms to minimize.
[2024-05-24 15:30:54] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 1 ms to minimize.
[2024-05-24 15:30:54] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 0 ms to minimize.
[2024-05-24 15:30:54] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 1 ms to minimize.
[2024-05-24 15:30:55] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 7054 ms
[2024-05-24 15:30:55] [INFO ] Deduced a trap composed of 29 places in 265 ms of which 1 ms to minimize.
[2024-05-24 15:30:55] [INFO ] Deduced a trap composed of 42 places in 259 ms of which 0 ms to minimize.
[2024-05-24 15:30:56] [INFO ] Deduced a trap composed of 21 places in 270 ms of which 1 ms to minimize.
[2024-05-24 15:30:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1039 ms
[2024-05-24 15:30:56] [INFO ] After 8789ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 320 ms.
[2024-05-24 15:30:56] [INFO ] After 9984ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 27 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 170 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 487/487 places, 2916/2916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 169 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 15:30:57] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:30:57] [INFO ] Invariant cache hit.
[2024-05-24 15:30:58] [INFO ] Implicit Places using invariants in 1139 ms returned []
[2024-05-24 15:30:58] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:30:58] [INFO ] Invariant cache hit.
[2024-05-24 15:30:58] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:31:02] [INFO ] Implicit Places using invariants and state equation in 4728 ms returned []
Implicit Place search using SMT with State Equation took 5876 ms to find 0 implicit places.
[2024-05-24 15:31:02] [INFO ] Redundant transitions in 100 ms returned []
[2024-05-24 15:31:02] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:31:02] [INFO ] Invariant cache hit.
[2024-05-24 15:31:05] [INFO ] Dead Transitions using invariants and state equation in 2353 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8506 ms. Remains : 487/487 places, 2916/2916 transitions.
Graph (trivial) has 2700 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions removed 277 transitions
Ensure Unique test removed 2024 transitions
Reduce isomorphic transitions removed 2301 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 518
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 518
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 318 transition count 500
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 292 transition count 500
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 525 place count 149 transition count 357
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 595 place count 149 transition count 287
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 611 place count 141 transition count 287
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 619 place count 141 transition count 279
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 629 place count 141 transition count 269
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 703 place count 141 transition count 195
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 777 place count 67 transition count 195
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 786 place count 67 transition count 195
Applied a total of 786 rules in 26 ms. Remains 67 /487 variables (removed 420) and now considering 195/2916 (removed 2721) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 195 rows 67 cols
[2024-05-24 15:31:05] [INFO ] Computed 20 invariants in 0 ms
[2024-05-24 15:31:05] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 15:31:05] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 15:31:05] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 15:31:05] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 15:31:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 15:31:05] [INFO ] After 33ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 15:31:05] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-24 15:31:05] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-24 15:31:05] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-05-24 15:31:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 75 ms
[2024-05-24 15:31:05] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 43 ms.
[2024-05-24 15:31:05] [INFO ] After 319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 172 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 174 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 15:31:06] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 15:31:06] [INFO ] Computed 28 invariants in 5 ms
[2024-05-24 15:31:07] [INFO ] Implicit Places using invariants in 1089 ms returned []
[2024-05-24 15:31:07] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:31:07] [INFO ] Invariant cache hit.
[2024-05-24 15:31:07] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:31:11] [INFO ] Implicit Places using invariants and state equation in 4535 ms returned []
Implicit Place search using SMT with State Equation took 5627 ms to find 0 implicit places.
[2024-05-24 15:31:12] [INFO ] Redundant transitions in 148 ms returned []
[2024-05-24 15:31:12] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:31:12] [INFO ] Invariant cache hit.
[2024-05-24 15:31:14] [INFO ] Dead Transitions using invariants and state equation in 2314 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8271 ms. Remains : 487/487 places, 2916/2916 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 106 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 170320 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 170320 steps, saw 112749 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 15:31:17] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:31:17] [INFO ] Invariant cache hit.
[2024-05-24 15:31:18] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 15:31:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 20 ms returned sat
[2024-05-24 15:31:18] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 9 ms returned sat
[2024-05-24 15:31:18] [INFO ] After 600ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-24 15:31:18] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:31:19] [INFO ] After 399ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-24 15:31:19] [INFO ] Deduced a trap composed of 12 places in 427 ms of which 1 ms to minimize.
[2024-05-24 15:31:20] [INFO ] Deduced a trap composed of 4 places in 391 ms of which 1 ms to minimize.
[2024-05-24 15:31:20] [INFO ] Deduced a trap composed of 55 places in 407 ms of which 1 ms to minimize.
[2024-05-24 15:31:21] [INFO ] Deduced a trap composed of 6 places in 419 ms of which 1 ms to minimize.
[2024-05-24 15:31:21] [INFO ] Deduced a trap composed of 3 places in 404 ms of which 1 ms to minimize.
[2024-05-24 15:31:22] [INFO ] Deduced a trap composed of 3 places in 378 ms of which 1 ms to minimize.
[2024-05-24 15:31:22] [INFO ] Deduced a trap composed of 19 places in 380 ms of which 1 ms to minimize.
[2024-05-24 15:31:23] [INFO ] Deduced a trap composed of 61 places in 396 ms of which 0 ms to minimize.
[2024-05-24 15:31:23] [INFO ] Deduced a trap composed of 37 places in 377 ms of which 0 ms to minimize.
[2024-05-24 15:31:23] [INFO ] Deduced a trap composed of 3 places in 247 ms of which 1 ms to minimize.
[2024-05-24 15:31:24] [INFO ] Deduced a trap composed of 3 places in 332 ms of which 1 ms to minimize.
[2024-05-24 15:31:24] [INFO ] Deduced a trap composed of 59 places in 327 ms of which 1 ms to minimize.
[2024-05-24 15:31:25] [INFO ] Deduced a trap composed of 27 places in 334 ms of which 0 ms to minimize.
[2024-05-24 15:31:25] [INFO ] Deduced a trap composed of 35 places in 252 ms of which 1 ms to minimize.
[2024-05-24 15:31:25] [INFO ] Deduced a trap composed of 3 places in 264 ms of which 1 ms to minimize.
[2024-05-24 15:31:25] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 1 ms to minimize.
[2024-05-24 15:31:26] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 0 ms to minimize.
[2024-05-24 15:31:26] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 6810 ms
[2024-05-24 15:31:26] [INFO ] Deduced a trap composed of 3 places in 352 ms of which 0 ms to minimize.
[2024-05-24 15:31:27] [INFO ] Deduced a trap composed of 23 places in 272 ms of which 1 ms to minimize.
[2024-05-24 15:31:27] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 1 ms to minimize.
[2024-05-24 15:31:27] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 1 ms to minimize.
[2024-05-24 15:31:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1295 ms
[2024-05-24 15:31:27] [INFO ] After 8796ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 321 ms.
[2024-05-24 15:31:28] [INFO ] After 9950ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 168 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 487/487 places, 2916/2916 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 137140 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 137140 steps, saw 93033 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 15:31:31] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:31:31] [INFO ] Invariant cache hit.
[2024-05-24 15:31:31] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 15:31:32] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-24 15:31:32] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 15:31:32] [INFO ] After 585ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 15:31:32] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:31:33] [INFO ] After 381ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 15:31:33] [INFO ] Deduced a trap composed of 3 places in 416 ms of which 1 ms to minimize.
[2024-05-24 15:31:34] [INFO ] Deduced a trap composed of 3 places in 425 ms of which 1 ms to minimize.
[2024-05-24 15:31:34] [INFO ] Deduced a trap composed of 12 places in 437 ms of which 0 ms to minimize.
[2024-05-24 15:31:35] [INFO ] Deduced a trap composed of 51 places in 459 ms of which 0 ms to minimize.
[2024-05-24 15:31:35] [INFO ] Deduced a trap composed of 49 places in 430 ms of which 1 ms to minimize.
[2024-05-24 15:31:36] [INFO ] Deduced a trap composed of 5 places in 393 ms of which 1 ms to minimize.
[2024-05-24 15:31:36] [INFO ] Deduced a trap composed of 3 places in 429 ms of which 1 ms to minimize.
[2024-05-24 15:31:36] [INFO ] Deduced a trap composed of 28 places in 371 ms of which 1 ms to minimize.
[2024-05-24 15:31:37] [INFO ] Deduced a trap composed of 25 places in 359 ms of which 1 ms to minimize.
[2024-05-24 15:31:37] [INFO ] Deduced a trap composed of 31 places in 311 ms of which 1 ms to minimize.
[2024-05-24 15:31:38] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 1 ms to minimize.
[2024-05-24 15:31:38] [INFO ] Deduced a trap composed of 35 places in 308 ms of which 1 ms to minimize.
[2024-05-24 15:31:38] [INFO ] Deduced a trap composed of 15 places in 306 ms of which 0 ms to minimize.
[2024-05-24 15:31:39] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 1 ms to minimize.
[2024-05-24 15:31:39] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 0 ms to minimize.
[2024-05-24 15:31:39] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 1 ms to minimize.
[2024-05-24 15:31:39] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 1 ms to minimize.
[2024-05-24 15:31:39] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 0 ms to minimize.
[2024-05-24 15:31:40] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 6937 ms
[2024-05-24 15:31:40] [INFO ] Deduced a trap composed of 29 places in 263 ms of which 1 ms to minimize.
[2024-05-24 15:31:40] [INFO ] Deduced a trap composed of 42 places in 268 ms of which 1 ms to minimize.
[2024-05-24 15:31:41] [INFO ] Deduced a trap composed of 21 places in 270 ms of which 0 ms to minimize.
[2024-05-24 15:31:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1046 ms
[2024-05-24 15:31:41] [INFO ] After 8680ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 326 ms.
[2024-05-24 15:31:41] [INFO ] After 9759ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 15 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 168 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 487/487 places, 2916/2916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 167 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 15:31:42] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:31:42] [INFO ] Invariant cache hit.
[2024-05-24 15:31:43] [INFO ] Implicit Places using invariants in 1173 ms returned []
[2024-05-24 15:31:43] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:31:43] [INFO ] Invariant cache hit.
[2024-05-24 15:31:43] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:31:47] [INFO ] Implicit Places using invariants and state equation in 4580 ms returned []
Implicit Place search using SMT with State Equation took 5764 ms to find 0 implicit places.
[2024-05-24 15:31:47] [INFO ] Redundant transitions in 105 ms returned []
[2024-05-24 15:31:47] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:31:47] [INFO ] Invariant cache hit.
[2024-05-24 15:31:49] [INFO ] Dead Transitions using invariants and state equation in 2017 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8062 ms. Remains : 487/487 places, 2916/2916 transitions.
Graph (trivial) has 2700 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions removed 277 transitions
Ensure Unique test removed 2024 transitions
Reduce isomorphic transitions removed 2301 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 518
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 518
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 318 transition count 500
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 292 transition count 500
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 525 place count 149 transition count 357
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 595 place count 149 transition count 287
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 611 place count 141 transition count 287
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 619 place count 141 transition count 279
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 629 place count 141 transition count 269
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 703 place count 141 transition count 195
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 777 place count 67 transition count 195
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 786 place count 67 transition count 195
Applied a total of 786 rules in 26 ms. Remains 67 /487 variables (removed 420) and now considering 195/2916 (removed 2721) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 195 rows 67 cols
[2024-05-24 15:31:49] [INFO ] Computed 20 invariants in 0 ms
[2024-05-24 15:31:50] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 15:31:50] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 15:31:50] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 15:31:50] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 15:31:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 15:31:50] [INFO ] After 33ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 15:31:50] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-24 15:31:50] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-24 15:31:50] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-24 15:31:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 102 ms
[2024-05-24 15:31:50] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 50 ms.
[2024-05-24 15:31:50] [INFO ] After 374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 177 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 470 ms.
Product exploration explored 100000 steps with 0 reset in 575 ms.
Built C files in :
/tmp/ltsmin12099519471819234
[2024-05-24 15:31:52] [INFO ] Too many transitions (2916) to apply POR reductions. Disabling POR matrices.
[2024-05-24 15:31:52] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12099519471819234
Running compilation step : cd /tmp/ltsmin12099519471819234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12099519471819234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12099519471819234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 104 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 15:31:55] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 15:31:55] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 15:31:56] [INFO ] Implicit Places using invariants in 890 ms returned []
[2024-05-24 15:31:56] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:31:56] [INFO ] Invariant cache hit.
[2024-05-24 15:31:56] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:32:00] [INFO ] Implicit Places using invariants and state equation in 4219 ms returned []
Implicit Place search using SMT with State Equation took 5109 ms to find 0 implicit places.
[2024-05-24 15:32:00] [INFO ] Redundant transitions in 96 ms returned []
[2024-05-24 15:32:00] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:32:00] [INFO ] Invariant cache hit.
[2024-05-24 15:32:02] [INFO ] Dead Transitions using invariants and state equation in 2455 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7771 ms. Remains : 487/487 places, 2916/2916 transitions.
Built C files in :
/tmp/ltsmin7600029724921139110
[2024-05-24 15:32:02] [INFO ] Too many transitions (2916) to apply POR reductions. Disabling POR matrices.
[2024-05-24 15:32:02] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7600029724921139110
Running compilation step : cd /tmp/ltsmin7600029724921139110;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7600029724921139110;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7600029724921139110;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 15:32:06] [INFO ] Flatten gal took : 74 ms
[2024-05-24 15:32:06] [INFO ] Flatten gal took : 76 ms
[2024-05-24 15:32:06] [INFO ] Time to serialize gal into /tmp/LTL8019409997557688936.gal : 13 ms
[2024-05-24 15:32:06] [INFO ] Time to serialize properties into /tmp/LTL1780385649948368285.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/LTL8019409997557688936.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6093381589010046491.hoa' '-atoms' '/tmp/LTL1780385649948368285.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...317
Loading property file /tmp/LTL1780385649948368285.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6093381589010046491.hoa
Detected timeout of ITS tools.
[2024-05-24 15:32:21] [INFO ] Flatten gal took : 83 ms
[2024-05-24 15:32:21] [INFO ] Flatten gal took : 86 ms
[2024-05-24 15:32:21] [INFO ] Time to serialize gal into /tmp/LTL14750569160339207379.gal : 12 ms
[2024-05-24 15:32:21] [INFO ] Time to serialize properties into /tmp/LTL12767484330848920770.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/LTL14750569160339207379.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12767484330848920770.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...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("((turn_5==0)||(flag_5_active==0))")||(("(p25_8_4==0)")||(G("((turn_6==0)||(p10_5_0==0))")))))))
Formula 0 simplified : XF(!"((turn_5==0)||(flag_5_active==0))" & !"(p25_8_4==0)" & F!"((turn_6==0)||(p10_5_0==0))")
Detected timeout of ITS tools.
[2024-05-24 15:32:36] [INFO ] Flatten gal took : 73 ms
[2024-05-24 15:32:36] [INFO ] Applying decomposition
[2024-05-24 15:32:36] [INFO ] Flatten gal took : 75 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/graph1319400290559116103.txt' '-o' '/tmp/graph1319400290559116103.bin' '-w' '/tmp/graph1319400290559116103.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1319400290559116103.bin' '-l' '-1' '-v' '-w' '/tmp/graph1319400290559116103.weights' '-q' '0' '-e' '0.001'
[2024-05-24 15:32:36] [INFO ] Decomposing Gal with order
[2024-05-24 15:32:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 15:32:37] [INFO ] Removed a total of 6378 redundant transitions.
[2024-05-24 15:32:37] [INFO ] Flatten gal took : 340 ms
[2024-05-24 15:32:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 663 labels/synchronizations in 99 ms.
[2024-05-24 15:32:37] [INFO ] Time to serialize gal into /tmp/LTL8775902756265098102.gal : 19 ms
[2024-05-24 15:32:37] [INFO ] Time to serialize properties into /tmp/LTL8148411417027771549.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/LTL8775902756265098102.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8148411417027771549.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i3.u4.turn_5==0)||(i5.u7.flag_5_active==0))")||(("(i12.i0.u8.p25_8_4==0)")||(G("((i3.u73.turn_6==0)||(u14.p10_5_0==0))"))))...158
Formula 0 simplified : XF(!"((i3.u4.turn_5==0)||(i5.u7.flag_5_active==0))" & !"(i12.i0.u8.p25_8_4==0)" & F!"((i3.u73.turn_6==0)||(u14.p10_5_0==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18147401279746210178
[2024-05-24 15:32:52] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18147401279746210178
Running compilation step : cd /tmp/ltsmin18147401279746210178;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18147401279746210178;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18147401279746210178;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-06 finished in 154337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((X(p1)||G(p2)))||p0))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-09-LTLFireability-07
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 823 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 814 transition count 3016
Deduced a syphon composed of 251 places in 3 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 563 transition count 3016
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 523 place count 560 transition count 2989
Iterating global reduction 2 with 3 rules applied. Total rules applied 526 place count 560 transition count 2989
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 670 place count 488 transition count 2917
Applied a total of 670 rules in 144 ms. Remains 488 /823 variables (removed 335) and now considering 2917/3276 (removed 359) transitions.
[2024-05-24 15:32:55] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2024-05-24 15:32:55] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 15:32:56] [INFO ] Implicit Places using invariants in 959 ms returned []
[2024-05-24 15:32:56] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:32:56] [INFO ] Invariant cache hit.
[2024-05-24 15:32:57] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:33:01] [INFO ] Implicit Places using invariants and state equation in 4549 ms returned []
Implicit Place search using SMT with State Equation took 5509 ms to find 0 implicit places.
[2024-05-24 15:33:01] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:33:01] [INFO ] Invariant cache hit.
[2024-05-24 15:33:03] [INFO ] Dead Transitions using invariants and state equation in 1773 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 488/823 places, 2917/3276 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 7428 ms. Remains : 488/823 places, 2917/3276 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s32 0) (EQ s135 0)), p2:(OR (EQ s6 0) (EQ s136 0)), p1:(OR (EQ s32 0) (EQ s135 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 90 reset in 277 ms.
Product exploration explored 100000 steps with 89 reset in 297 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), true, (X (X p0)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 103 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:33:03] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:33:03] [INFO ] Invariant cache hit.
[2024-05-24 15:33:04] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:33:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 22 ms returned sat
[2024-05-24 15:33:04] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 15:33:04] [INFO ] After 503ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:33:04] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:33:05] [INFO ] After 276ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:33:05] [INFO ] Deduced a trap composed of 3 places in 357 ms of which 1 ms to minimize.
[2024-05-24 15:33:05] [INFO ] Deduced a trap composed of 3 places in 360 ms of which 0 ms to minimize.
[2024-05-24 15:33:06] [INFO ] Deduced a trap composed of 3 places in 355 ms of which 1 ms to minimize.
[2024-05-24 15:33:06] [INFO ] Deduced a trap composed of 30 places in 369 ms of which 1 ms to minimize.
[2024-05-24 15:33:07] [INFO ] Deduced a trap composed of 23 places in 339 ms of which 1 ms to minimize.
[2024-05-24 15:33:07] [INFO ] Deduced a trap composed of 3 places in 334 ms of which 1 ms to minimize.
[2024-05-24 15:33:07] [INFO ] Deduced a trap composed of 37 places in 284 ms of which 0 ms to minimize.
[2024-05-24 15:33:08] [INFO ] Deduced a trap composed of 3 places in 262 ms of which 0 ms to minimize.
[2024-05-24 15:33:08] [INFO ] Deduced a trap composed of 29 places in 215 ms of which 1 ms to minimize.
[2024-05-24 15:33:08] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 1 ms to minimize.
[2024-05-24 15:33:09] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 1 ms to minimize.
[2024-05-24 15:33:09] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 1 ms to minimize.
[2024-05-24 15:33:09] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4164 ms
[2024-05-24 15:33:09] [INFO ] After 4527ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2024-05-24 15:33:09] [INFO ] After 5336ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 169 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 488/488 places, 2917/2917 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 324060 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 324060 steps, saw 203111 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:33:12] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:33:12] [INFO ] Invariant cache hit.
[2024-05-24 15:33:12] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:33:12] [INFO ] [Nat]Absence check using 19 positive place invariants in 19 ms returned sat
[2024-05-24 15:33:12] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 9 ms returned sat
[2024-05-24 15:33:13] [INFO ] After 476ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:33:13] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:33:13] [INFO ] After 275ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:33:14] [INFO ] Deduced a trap composed of 3 places in 387 ms of which 1 ms to minimize.
[2024-05-24 15:33:14] [INFO ] Deduced a trap composed of 3 places in 369 ms of which 1 ms to minimize.
[2024-05-24 15:33:15] [INFO ] Deduced a trap composed of 3 places in 376 ms of which 1 ms to minimize.
[2024-05-24 15:33:15] [INFO ] Deduced a trap composed of 30 places in 348 ms of which 0 ms to minimize.
[2024-05-24 15:33:15] [INFO ] Deduced a trap composed of 23 places in 347 ms of which 1 ms to minimize.
[2024-05-24 15:33:16] [INFO ] Deduced a trap composed of 3 places in 342 ms of which 1 ms to minimize.
[2024-05-24 15:33:16] [INFO ] Deduced a trap composed of 37 places in 283 ms of which 1 ms to minimize.
[2024-05-24 15:33:16] [INFO ] Deduced a trap composed of 3 places in 275 ms of which 1 ms to minimize.
[2024-05-24 15:33:17] [INFO ] Deduced a trap composed of 29 places in 224 ms of which 0 ms to minimize.
[2024-05-24 15:33:17] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 1 ms to minimize.
[2024-05-24 15:33:17] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 0 ms to minimize.
[2024-05-24 15:33:17] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 1 ms to minimize.
[2024-05-24 15:33:18] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4258 ms
[2024-05-24 15:33:18] [INFO ] After 4619ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 99 ms.
[2024-05-24 15:33:18] [INFO ] After 5392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 173 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 488/488 places, 2917/2917 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 173 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-05-24 15:33:18] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:33:18] [INFO ] Invariant cache hit.
[2024-05-24 15:33:19] [INFO ] Implicit Places using invariants in 857 ms returned []
[2024-05-24 15:33:19] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:33:19] [INFO ] Invariant cache hit.
[2024-05-24 15:33:19] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:33:23] [INFO ] Implicit Places using invariants and state equation in 4272 ms returned []
Implicit Place search using SMT with State Equation took 5130 ms to find 0 implicit places.
[2024-05-24 15:33:23] [INFO ] Redundant transitions in 103 ms returned []
[2024-05-24 15:33:23] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:33:23] [INFO ] Invariant cache hit.
[2024-05-24 15:33:25] [INFO ] Dead Transitions using invariants and state equation in 2124 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7538 ms. Remains : 488/488 places, 2917/2917 transitions.
Graph (trivial) has 2722 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 0 ms
Free SCC test removed 71 places
Drop transitions removed 272 transitions
Ensure Unique test removed 2027 transitions
Reduce isomorphic transitions removed 2299 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 417 transition count 520
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 319 transition count 520
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 197 place count 319 transition count 503
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 238 place count 295 transition count 503
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 526 place count 151 transition count 359
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 598 place count 151 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 612 place count 144 transition count 288
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 618 place count 144 transition count 282
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 625 place count 144 transition count 275
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 698 place count 144 transition count 202
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 771 place count 71 transition count 202
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 780 place count 71 transition count 202
Applied a total of 780 rules in 26 ms. Remains 71 /488 variables (removed 417) and now considering 202/2917 (removed 2715) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 202 rows 71 cols
[2024-05-24 15:33:25] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 15:33:25] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:33:25] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 15:33:25] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-24 15:33:26] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:33:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 15:33:26] [INFO ] After 14ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:33:26] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-24 15:33:26] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p2 p1), (X p0), true, (X (X p0)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 6 factoid took 175 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 174 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-05-24 15:33:26] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2024-05-24 15:33:26] [INFO ] Computed 28 invariants in 4 ms
[2024-05-24 15:33:27] [INFO ] Implicit Places using invariants in 1211 ms returned []
[2024-05-24 15:33:27] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:33:27] [INFO ] Invariant cache hit.
[2024-05-24 15:33:28] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:33:32] [INFO ] Implicit Places using invariants and state equation in 4504 ms returned []
Implicit Place search using SMT with State Equation took 5716 ms to find 0 implicit places.
[2024-05-24 15:33:32] [INFO ] Redundant transitions in 101 ms returned []
[2024-05-24 15:33:32] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:33:32] [INFO ] Invariant cache hit.
[2024-05-24 15:33:34] [INFO ] Dead Transitions using invariants and state equation in 1930 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7927 ms. Remains : 488/488 places, 2917/2917 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:33:34] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:33:34] [INFO ] Invariant cache hit.
[2024-05-24 15:33:34] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:33:34] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2024-05-24 15:33:34] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 15:33:35] [INFO ] After 378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:33:35] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:33:35] [INFO ] After 223ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:33:35] [INFO ] Deduced a trap composed of 3 places in 335 ms of which 1 ms to minimize.
[2024-05-24 15:33:36] [INFO ] Deduced a trap composed of 3 places in 339 ms of which 0 ms to minimize.
[2024-05-24 15:33:36] [INFO ] Deduced a trap composed of 3 places in 357 ms of which 1 ms to minimize.
[2024-05-24 15:33:37] [INFO ] Deduced a trap composed of 30 places in 337 ms of which 0 ms to minimize.
[2024-05-24 15:33:37] [INFO ] Deduced a trap composed of 23 places in 338 ms of which 1 ms to minimize.
[2024-05-24 15:33:37] [INFO ] Deduced a trap composed of 3 places in 333 ms of which 1 ms to minimize.
[2024-05-24 15:33:38] [INFO ] Deduced a trap composed of 37 places in 275 ms of which 1 ms to minimize.
[2024-05-24 15:33:38] [INFO ] Deduced a trap composed of 3 places in 282 ms of which 0 ms to minimize.
[2024-05-24 15:33:38] [INFO ] Deduced a trap composed of 29 places in 190 ms of which 0 ms to minimize.
[2024-05-24 15:33:39] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 1 ms to minimize.
[2024-05-24 15:33:39] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 0 ms to minimize.
[2024-05-24 15:33:39] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 1 ms to minimize.
[2024-05-24 15:33:39] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4056 ms
[2024-05-24 15:33:39] [INFO ] After 4356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2024-05-24 15:33:39] [INFO ] After 4980ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 167 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 488/488 places, 2917/2917 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 316320 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{}
Probabilistic random walk after 316320 steps, saw 198703 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:33:42] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:33:42] [INFO ] Invariant cache hit.
[2024-05-24 15:33:43] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:33:43] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-24 15:33:43] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 15:33:43] [INFO ] After 318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:33:43] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:33:43] [INFO ] After 172ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:33:44] [INFO ] Deduced a trap composed of 3 places in 364 ms of which 1 ms to minimize.
[2024-05-24 15:33:44] [INFO ] Deduced a trap composed of 3 places in 349 ms of which 1 ms to minimize.
[2024-05-24 15:33:44] [INFO ] Deduced a trap composed of 3 places in 368 ms of which 1 ms to minimize.
[2024-05-24 15:33:45] [INFO ] Deduced a trap composed of 30 places in 368 ms of which 1 ms to minimize.
[2024-05-24 15:33:45] [INFO ] Deduced a trap composed of 23 places in 337 ms of which 1 ms to minimize.
[2024-05-24 15:33:46] [INFO ] Deduced a trap composed of 3 places in 363 ms of which 0 ms to minimize.
[2024-05-24 15:33:46] [INFO ] Deduced a trap composed of 37 places in 277 ms of which 0 ms to minimize.
[2024-05-24 15:33:46] [INFO ] Deduced a trap composed of 3 places in 283 ms of which 1 ms to minimize.
[2024-05-24 15:33:47] [INFO ] Deduced a trap composed of 29 places in 212 ms of which 1 ms to minimize.
[2024-05-24 15:33:47] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 1 ms to minimize.
[2024-05-24 15:33:47] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 0 ms to minimize.
[2024-05-24 15:33:47] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 1 ms to minimize.
[2024-05-24 15:33:47] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4221 ms
[2024-05-24 15:33:47] [INFO ] After 4479ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2024-05-24 15:33:48] [INFO ] After 5018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 169 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 488/488 places, 2917/2917 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 168 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-05-24 15:33:48] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:33:48] [INFO ] Invariant cache hit.
[2024-05-24 15:33:49] [INFO ] Implicit Places using invariants in 1154 ms returned []
[2024-05-24 15:33:49] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:33:49] [INFO ] Invariant cache hit.
[2024-05-24 15:33:50] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:33:53] [INFO ] Implicit Places using invariants and state equation in 4047 ms returned []
Implicit Place search using SMT with State Equation took 5203 ms to find 0 implicit places.
[2024-05-24 15:33:53] [INFO ] Redundant transitions in 141 ms returned []
[2024-05-24 15:33:53] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:33:53] [INFO ] Invariant cache hit.
[2024-05-24 15:33:56] [INFO ] Dead Transitions using invariants and state equation in 2317 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7835 ms. Remains : 488/488 places, 2917/2917 transitions.
Graph (trivial) has 2722 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 0 ms
Free SCC test removed 71 places
Drop transitions removed 272 transitions
Ensure Unique test removed 2027 transitions
Reduce isomorphic transitions removed 2299 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 417 transition count 520
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 319 transition count 520
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 197 place count 319 transition count 503
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 238 place count 295 transition count 503
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 526 place count 151 transition count 359
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 598 place count 151 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 612 place count 144 transition count 288
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 618 place count 144 transition count 282
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 625 place count 144 transition count 275
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 698 place count 144 transition count 202
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 771 place count 71 transition count 202
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 780 place count 71 transition count 202
Applied a total of 780 rules in 25 ms. Remains 71 /488 variables (removed 417) and now considering 202/2917 (removed 2715) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 202 rows 71 cols
[2024-05-24 15:33:56] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 15:33:56] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:33:56] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-24 15:33:56] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-24 15:33:56] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:33:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 15:33:56] [INFO ] After 20ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:33:56] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-24 15:33:56] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 5 factoid took 209 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 92 reset in 428 ms.
Product exploration explored 100000 steps with 92 reset in 462 ms.
Built C files in :
/tmp/ltsmin962642373422845221
[2024-05-24 15:33:57] [INFO ] Too many transitions (2917) to apply POR reductions. Disabling POR matrices.
[2024-05-24 15:33:57] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin962642373422845221
Running compilation step : cd /tmp/ltsmin962642373422845221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin962642373422845221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin962642373422845221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 106 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-05-24 15:34:01] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2024-05-24 15:34:01] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 15:34:01] [INFO ] Implicit Places using invariants in 875 ms returned []
[2024-05-24 15:34:01] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:34:01] [INFO ] Invariant cache hit.
[2024-05-24 15:34:02] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:34:05] [INFO ] Implicit Places using invariants and state equation in 3689 ms returned []
Implicit Place search using SMT with State Equation took 4566 ms to find 0 implicit places.
[2024-05-24 15:34:05] [INFO ] Redundant transitions in 160 ms returned []
[2024-05-24 15:34:05] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 15:34:05] [INFO ] Invariant cache hit.
[2024-05-24 15:34:08] [INFO ] Dead Transitions using invariants and state equation in 2575 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7415 ms. Remains : 488/488 places, 2917/2917 transitions.
Built C files in :
/tmp/ltsmin16160079203314905169
[2024-05-24 15:34:08] [INFO ] Too many transitions (2917) to apply POR reductions. Disabling POR matrices.
[2024-05-24 15:34:08] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16160079203314905169
Running compilation step : cd /tmp/ltsmin16160079203314905169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16160079203314905169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16160079203314905169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 15:34:11] [INFO ] Flatten gal took : 73 ms
[2024-05-24 15:34:11] [INFO ] Flatten gal took : 75 ms
[2024-05-24 15:34:11] [INFO ] Time to serialize gal into /tmp/LTL15655882531735363954.gal : 11 ms
[2024-05-24 15:34:11] [INFO ] Time to serialize properties into /tmp/LTL8905604422941882295.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/LTL15655882531735363954.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4185795739623750210.hoa' '-atoms' '/tmp/LTL8905604422941882295.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/LTL8905604422941882295.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4185795739623750210.hoa
Detected timeout of ITS tools.
[2024-05-24 15:34:26] [INFO ] Flatten gal took : 102 ms
[2024-05-24 15:34:26] [INFO ] Flatten gal took : 123 ms
[2024-05-24 15:34:26] [INFO ] Time to serialize gal into /tmp/LTL3539212155443160618.gal : 17 ms
[2024-05-24 15:34:26] [INFO ] Time to serialize properties into /tmp/LTL13620081792191967441.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/LTL3539212155443160618.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13620081792191967441.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("((flag_7_active==0)||(p09_3_7==0))")||(F((X("((flag_7_active==0)||(p09_3_7==0))"))||(G("((turn_6==0)||(p10_1_2==0))"))))))))
Formula 0 simplified : XF(!"((flag_7_active==0)||(p09_3_7==0))" & G(X!"((flag_7_active==0)||(p09_3_7==0))" & F!"((turn_6==0)||(p10_1_2==0))"))
Detected timeout of ITS tools.
[2024-05-24 15:34:42] [INFO ] Flatten gal took : 74 ms
[2024-05-24 15:34:42] [INFO ] Applying decomposition
[2024-05-24 15:34:42] [INFO ] Flatten gal took : 76 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/graph5439968026244302190.txt' '-o' '/tmp/graph5439968026244302190.bin' '-w' '/tmp/graph5439968026244302190.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5439968026244302190.bin' '-l' '-1' '-v' '-w' '/tmp/graph5439968026244302190.weights' '-q' '0' '-e' '0.001'
[2024-05-24 15:34:42] [INFO ] Decomposing Gal with order
[2024-05-24 15:34:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 15:34:42] [INFO ] Removed a total of 6373 redundant transitions.
[2024-05-24 15:34:42] [INFO ] Flatten gal took : 344 ms
[2024-05-24 15:34:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 700 labels/synchronizations in 103 ms.
[2024-05-24 15:34:42] [INFO ] Time to serialize gal into /tmp/LTL10178319189905908213.gal : 20 ms
[2024-05-24 15:34:42] [INFO ] Time to serialize properties into /tmp/LTL11449389455248203613.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/LTL10178319189905908213.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11449389455248203613.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i4.u0.flag_7_active==0)||(i9.u14.p09_3_7==0))")||(F((X("((i4.u0.flag_7_active==0)||(i9.u14.p09_3_7==0))"))||(G("((i1.u3.tur...189
Formula 0 simplified : XF(!"((i4.u0.flag_7_active==0)||(i9.u14.p09_3_7==0))" & G(X!"((i4.u0.flag_7_active==0)||(i9.u14.p09_3_7==0))" & F!"((i1.u3.turn_6==0...177
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1505815497438958843
[2024-05-24 15:34:57] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1505815497438958843
Running compilation step : cd /tmp/ltsmin1505815497438958843;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1505815497438958843;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1505815497438958843;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-07 finished in 125546 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' '!(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' '!(X(G(((!p1 U (G(!p1)||(!p1&&G(!p2))))||p0))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-09-LTLFireability-11
Stuttering acceptance computed with spot in 247 ms :[true, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2)), (OR p2 (AND (NOT p0) p1))]
Support contains 4 out of 823 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 18 place count 814 transition count 3017
Deduced a syphon composed of 250 places in 4 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 518 place count 564 transition count 3017
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 522 place count 560 transition count 2981
Iterating global reduction 2 with 4 rules applied. Total rules applied 526 place count 560 transition count 2981
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 670 place count 488 transition count 2909
Applied a total of 670 rules in 143 ms. Remains 488 /823 variables (removed 335) and now considering 2909/3276 (removed 367) transitions.
[2024-05-24 15:35:01] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2024-05-24 15:35:01] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 15:35:02] [INFO ] Implicit Places using invariants in 1213 ms returned []
[2024-05-24 15:35:02] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 15:35:02] [INFO ] Invariant cache hit.
[2024-05-24 15:35:03] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:35:07] [INFO ] Implicit Places using invariants and state equation in 4593 ms returned []
Implicit Place search using SMT with State Equation took 5808 ms to find 0 implicit places.
[2024-05-24 15:35:07] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 15:35:07] [INFO ] Invariant cache hit.
[2024-05-24 15:35:09] [INFO ] Dead Transitions using invariants and state equation in 2071 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 488/823 places, 2909/3276 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8034 ms. Remains : 488/823 places, 2909/3276 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p0) p1) (AND p2 p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 5}], [{ cond=(OR (AND (NOT p0) p1) p2), acceptance={} source=5 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(AND (EQ s17 1) (EQ s383 1)), p2:(AND (EQ s20 1) (EQ s135 1)), p0:(OR (EQ s17 0) (EQ s383 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 339 ms.
Product exploration explored 100000 steps with 0 reset in 406 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p2 p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 174 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[true, p1, (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2)), (OR p2 (AND (NOT p0) p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-24 15:35:11] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 15:35:11] [INFO ] Invariant cache hit.
[2024-05-24 15:35:11] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-24 15:35:11] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 15:35:11] [INFO ] After 570ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2024-05-24 15:35:12] [INFO ] [Nat]Absence check using 19 positive place invariants in 20 ms returned sat
[2024-05-24 15:35:12] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 15:35:12] [INFO ] After 601ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2024-05-24 15:35:12] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:35:13] [INFO ] After 317ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :3 sat :4
[2024-05-24 15:35:13] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2024-05-24 15:35:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2024-05-24 15:35:13] [INFO ] After 813ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 207 ms.
[2024-05-24 15:35:13] [INFO ] After 1952ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 168 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 488/488 places, 2909/2909 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 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 2 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 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 166510 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 166510 steps, saw 110861 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 15:35:17] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 15:35:17] [INFO ] Invariant cache hit.
[2024-05-24 15:35:17] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-24 15:35:17] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 8 ms returned sat
[2024-05-24 15:35:18] [INFO ] After 537ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:1
[2024-05-24 15:35:18] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:35:18] [INFO ] After 279ms SMT Verify possible using 356 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 15:35:18] [INFO ] After 1013ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 15:35:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 22 ms returned sat
[2024-05-24 15:35:18] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 15:35:19] [INFO ] After 594ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 15:35:19] [INFO ] After 298ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 15:35:19] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-24 15:35:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2024-05-24 15:35:20] [INFO ] After 801ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 216 ms.
[2024-05-24 15:35:20] [INFO ] After 1887ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 168 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 488/488 places, 2909/2909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 168 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
[2024-05-24 15:35:20] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 15:35:20] [INFO ] Invariant cache hit.
[2024-05-24 15:35:21] [INFO ] Implicit Places using invariants in 1210 ms returned []
[2024-05-24 15:35:21] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 15:35:21] [INFO ] Invariant cache hit.
[2024-05-24 15:35:22] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:35:26] [INFO ] Implicit Places using invariants and state equation in 4761 ms returned []
Implicit Place search using SMT with State Equation took 5977 ms to find 0 implicit places.
[2024-05-24 15:35:26] [INFO ] Redundant transitions in 129 ms returned []
[2024-05-24 15:35:26] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 15:35:26] [INFO ] Invariant cache hit.
[2024-05-24 15:35:28] [INFO ] Dead Transitions using invariants and state equation in 1945 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8227 ms. Remains : 488/488 places, 2909/2909 transitions.
Graph (trivial) has 2721 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 1 ms
Free SCC test removed 71 places
Drop transitions removed 275 transitions
Ensure Unique test removed 2017 transitions
Reduce isomorphic transitions removed 2292 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 417 transition count 519
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 319 transition count 519
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 197 place count 319 transition count 501
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 241 place count 293 transition count 501
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 527 place count 150 transition count 358
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 599 place count 150 transition count 286
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 613 place count 143 transition count 287
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 620 place count 143 transition count 280
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 626 place count 143 transition count 274
Free-agglomeration rule applied 71 times.
Iterating global reduction 4 with 71 rules applied. Total rules applied 697 place count 143 transition count 203
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 4 with 71 rules applied. Total rules applied 768 place count 72 transition count 203
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 776 place count 72 transition count 203
Applied a total of 776 rules in 26 ms. Remains 72 /488 variables (removed 416) and now considering 203/2909 (removed 2706) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 203 rows 72 cols
[2024-05-24 15:35:28] [INFO ] Computed 20 invariants in 1 ms
[2024-05-24 15:35:28] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-24 15:35:28] [INFO ] [Real]Absence check using 19 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 15:35:28] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 15:35:28] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 15:35:28] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 15:35:28] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 15:35:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 15:35:29] [INFO ] After 32ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 15:35:29] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-24 15:35:29] [INFO ] After 250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p2 p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1)))), (G (NOT (AND p2 (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p2) p0 p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p2 (NOT p1))), (F (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (F (OR p2 (AND (NOT p0) p1)))]
Knowledge based reduction with 18 factoid took 796 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0)]
Support contains 2 out of 488 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 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 172 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
[2024-05-24 15:35:30] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2024-05-24 15:35:30] [INFO ] Computed 28 invariants in 8 ms
[2024-05-24 15:35:31] [INFO ] Implicit Places using invariants in 1215 ms returned []
[2024-05-24 15:35:31] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 15:35:31] [INFO ] Invariant cache hit.
[2024-05-24 15:35:32] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:35:35] [INFO ] Implicit Places using invariants and state equation in 4369 ms returned []
Implicit Place search using SMT with State Equation took 5586 ms to find 0 implicit places.
[2024-05-24 15:35:35] [INFO ] Redundant transitions in 101 ms returned []
[2024-05-24 15:35:35] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 15:35:35] [INFO ] Invariant cache hit.
[2024-05-24 15:35:38] [INFO ] Dead Transitions using invariants and state equation in 2430 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8297 ms. Remains : 488/488 places, 2909/2909 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 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 45 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 333990 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 333990 steps, saw 211690 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:35:41] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 15:35:41] [INFO ] Invariant cache hit.
[2024-05-24 15:35:41] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:35:41] [INFO ] [Nat]Absence check using 19 positive place invariants in 22 ms returned sat
[2024-05-24 15:35:41] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 15:35:42] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:35:42] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:35:42] [INFO ] After 165ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:35:42] [INFO ] After 257ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2024-05-24 15:35:42] [INFO ] After 940ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 488 transition count 2908
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 487 transition count 2908
Applied a total of 2 rules in 184 ms. Remains 487 /488 variables (removed 1) and now considering 2908/2909 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 487/488 places, 2908/2909 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 332210 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 332210 steps, saw 210246 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:35:45] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-05-24 15:35:45] [INFO ] Computed 28 invariants in 1 ms
[2024-05-24 15:35:45] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:35:46] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-24 15:35:46] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 15:35:46] [INFO ] After 392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:35:46] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:35:46] [INFO ] After 154ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:35:46] [INFO ] After 248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2024-05-24 15:35:46] [INFO ] After 825ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 169 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 487/487 places, 2908/2908 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 169 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2024-05-24 15:35:47] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:35:47] [INFO ] Invariant cache hit.
[2024-05-24 15:35:48] [INFO ] Implicit Places using invariants in 1204 ms returned []
[2024-05-24 15:35:48] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:35:48] [INFO ] Invariant cache hit.
[2024-05-24 15:35:48] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:35:53] [INFO ] Implicit Places using invariants and state equation in 4741 ms returned []
Implicit Place search using SMT with State Equation took 5946 ms to find 0 implicit places.
[2024-05-24 15:35:53] [INFO ] Redundant transitions in 121 ms returned []
[2024-05-24 15:35:53] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:35:53] [INFO ] Invariant cache hit.
[2024-05-24 15:35:55] [INFO ] Dead Transitions using invariants and state equation in 2295 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8539 ms. Remains : 487/487 places, 2908/2908 transitions.
Graph (trivial) has 2724 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 415 transition count 515
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 317 transition count 515
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 317 transition count 496
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 289 transition count 496
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 146 transition count 353
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 146 transition count 281
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 618 place count 138 transition count 281
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 626 place count 138 transition count 273
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 634 place count 138 transition count 265
Free-agglomeration rule applied 71 times.
Iterating global reduction 4 with 71 rules applied. Total rules applied 705 place count 138 transition count 194
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 4 with 71 rules applied. Total rules applied 776 place count 67 transition count 194
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 784 place count 67 transition count 194
Applied a total of 784 rules in 29 ms. Remains 67 /487 variables (removed 420) and now considering 194/2908 (removed 2714) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 194 rows 67 cols
[2024-05-24 15:35:55] [INFO ] Computed 19 invariants in 0 ms
[2024-05-24 15:35:55] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:35:55] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 15:35:55] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:35:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 15:35:55] [INFO ] After 9ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:35:55] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-24 15:35:55] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 103 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 63 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 396 ms.
Product exploration explored 100000 steps with 0 reset in 480 ms.
Built C files in :
/tmp/ltsmin5903318163366686447
[2024-05-24 15:35:56] [INFO ] Too many transitions (2909) to apply POR reductions. Disabling POR matrices.
[2024-05-24 15:35:56] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5903318163366686447
Running compilation step : cd /tmp/ltsmin5903318163366686447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5903318163366686447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5903318163366686447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 488 transition count 2908
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 487 transition count 2908
Applied a total of 2 rules in 111 ms. Remains 487 /488 variables (removed 1) and now considering 2908/2909 (removed 1) transitions.
[2024-05-24 15:36:00] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-05-24 15:36:00] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 15:36:01] [INFO ] Implicit Places using invariants in 1126 ms returned []
[2024-05-24 15:36:01] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:36:01] [INFO ] Invariant cache hit.
[2024-05-24 15:36:01] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 15:36:05] [INFO ] Implicit Places using invariants and state equation in 4388 ms returned []
Implicit Place search using SMT with State Equation took 5514 ms to find 0 implicit places.
[2024-05-24 15:36:05] [INFO ] Redundant transitions in 129 ms returned []
[2024-05-24 15:36:05] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 15:36:05] [INFO ] Invariant cache hit.
[2024-05-24 15:36:07] [INFO ] Dead Transitions using invariants and state equation in 2179 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/488 places, 2908/2909 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7942 ms. Remains : 487/488 places, 2908/2909 transitions.
Built C files in :
/tmp/ltsmin6254470489183936560
[2024-05-24 15:36:07] [INFO ] Too many transitions (2908) to apply POR reductions. Disabling POR matrices.
[2024-05-24 15:36:07] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6254470489183936560
Running compilation step : cd /tmp/ltsmin6254470489183936560;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6254470489183936560;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6254470489183936560;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 15:36:11] [INFO ] Flatten gal took : 72 ms
[2024-05-24 15:36:11] [INFO ] Flatten gal took : 74 ms
[2024-05-24 15:36:11] [INFO ] Time to serialize gal into /tmp/LTL8769708946575414452.gal : 10 ms
[2024-05-24 15:36:11] [INFO ] Time to serialize properties into /tmp/LTL12369489155218960082.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/LTL8769708946575414452.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8960181093888609037.hoa' '-atoms' '/tmp/LTL12369489155218960082.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/LTL12369489155218960082.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8960181093888609037.hoa
Detected timeout of ITS tools.
[2024-05-24 15:36:26] [INFO ] Flatten gal took : 75 ms
[2024-05-24 15:36:26] [INFO ] Flatten gal took : 75 ms
[2024-05-24 15:36:26] [INFO ] Time to serialize gal into /tmp/LTL2049219305693645204.gal : 11 ms
[2024-05-24 15:36:26] [INFO ] Time to serialize properties into /tmp/LTL13143992234937684050.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/LTL2049219305693645204.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13143992234937684050.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("((flag_2_active==0)||(p33_4_2==0))")||((!("((flag_2_active==1)&&(p33_4_2==1))"))U((G(!("((flag_2_active==1)&&(p33_4_2==1))"))...253
Formula 0 simplified : XF(!"((flag_2_active==0)||(p33_4_2==0))" & (F"((flag_3_active==1)&&(p09_4_3==1))" U "((flag_2_active==1)&&(p33_4_2==1))"))
Detected timeout of ITS tools.
[2024-05-24 15:36:41] [INFO ] Flatten gal took : 73 ms
[2024-05-24 15:36:41] [INFO ] Applying decomposition
[2024-05-24 15:36:41] [INFO ] Flatten gal took : 75 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/graph11829879103488301938.txt' '-o' '/tmp/graph11829879103488301938.bin' '-w' '/tmp/graph11829879103488301938.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11829879103488301938.bin' '-l' '-1' '-v' '-w' '/tmp/graph11829879103488301938.weights' '-q' '0' '-e' '0.001'
[2024-05-24 15:36:41] [INFO ] Decomposing Gal with order
[2024-05-24 15:36:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 15:36:42] [INFO ] Removed a total of 6295 redundant transitions.
[2024-05-24 15:36:42] [INFO ] Flatten gal took : 326 ms
[2024-05-24 15:36:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 742 labels/synchronizations in 105 ms.
[2024-05-24 15:36:42] [INFO ] Time to serialize gal into /tmp/LTL4880970697727064156.gal : 19 ms
[2024-05-24 15:36:42] [INFO ] Time to serialize properties into /tmp/LTL9365740940634786595.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/LTL4880970697727064156.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9365740940634786595.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i17.u69.flag_2_active==0)||(i17.u71.p33_4_2==0))")||((!("((i17.u69.flag_2_active==1)&&(i17.u71.p33_4_2==1))"))U((G(!("((i17...330
Formula 0 simplified : XF(!"((i17.u69.flag_2_active==0)||(i17.u71.p33_4_2==0))" & (F"((i1.u1.flag_3_active==1)&&(i9.u18.p09_4_3==1))" U "((i17.u69.flag_2_a...190
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16855553490207940440
[2024-05-24 15:36:57] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16855553490207940440
Running compilation step : cd /tmp/ltsmin16855553490207940440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16855553490207940440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16855553490207940440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-11 finished in 119165 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(X(F(p1)))))))'
Found a Shortening insensitive property : EisenbergMcGuire-PT-09-LTLFireability-13
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 823 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 814 transition count 3015
Deduced a syphon composed of 252 places in 2 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 562 transition count 3015
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 525 place count 559 transition count 2988
Iterating global reduction 2 with 3 rules applied. Total rules applied 528 place count 559 transition count 2988
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 672 place count 487 transition count 2916
Applied a total of 672 rules in 114 ms. Remains 487 /823 variables (removed 336) and now considering 2916/3276 (removed 360) transitions.
[2024-05-24 15:37:00] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 15:37:00] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 15:37:01] [INFO ] Implicit Places using invariants in 1023 ms returned []
[2024-05-24 15:37:01] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:37:01] [INFO ] Invariant cache hit.
[2024-05-24 15:37:02] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:37:05] [INFO ] Implicit Places using invariants and state equation in 3809 ms returned []
Implicit Place search using SMT with State Equation took 4833 ms to find 0 implicit places.
[2024-05-24 15:37:05] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:37:05] [INFO ] Invariant cache hit.
[2024-05-24 15:37:08] [INFO ] Dead Transitions using invariants and state equation in 2595 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 487/823 places, 2916/3276 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 7544 ms. Remains : 487/823 places, 2916/3276 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s135 1)), p1:(OR (EQ s1 0) (EQ s13 0) (EQ s339 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1101 ms.
Product exploration explored 100000 steps with 25000 reset in 747 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 314360 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 314360 steps, saw 199090 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:37:13] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:37:13] [INFO ] Invariant cache hit.
[2024-05-24 15:37:13] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:37:13] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-24 15:37:13] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 15:37:13] [INFO ] After 400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:37:13] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:37:14] [INFO ] After 190ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:37:14] [INFO ] Deduced a trap composed of 3 places in 382 ms of which 1 ms to minimize.
[2024-05-24 15:37:15] [INFO ] Deduced a trap composed of 3 places in 384 ms of which 0 ms to minimize.
[2024-05-24 15:37:15] [INFO ] Deduced a trap composed of 3 places in 339 ms of which 1 ms to minimize.
[2024-05-24 15:37:15] [INFO ] Deduced a trap composed of 3 places in 291 ms of which 1 ms to minimize.
[2024-05-24 15:37:16] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 1 ms to minimize.
[2024-05-24 15:37:16] [INFO ] Deduced a trap composed of 31 places in 208 ms of which 0 ms to minimize.
[2024-05-24 15:37:16] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 1 ms to minimize.
[2024-05-24 15:37:16] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 0 ms to minimize.
[2024-05-24 15:37:16] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 0 ms to minimize.
[2024-05-24 15:37:17] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 0 ms to minimize.
[2024-05-24 15:37:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3039 ms
[2024-05-24 15:37:17] [INFO ] After 3321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 112 ms.
[2024-05-24 15:37:17] [INFO ] After 3966ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 168 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 487/487 places, 2916/2916 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 322910 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 322910 steps, saw 204235 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:37:20] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:37:20] [INFO ] Invariant cache hit.
[2024-05-24 15:37:20] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:37:20] [INFO ] [Nat]Absence check using 19 positive place invariants in 23 ms returned sat
[2024-05-24 15:37:20] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 15:37:21] [INFO ] After 494ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:37:21] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:37:21] [INFO ] After 187ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:37:22] [INFO ] Deduced a trap composed of 3 places in 400 ms of which 1 ms to minimize.
[2024-05-24 15:37:22] [INFO ] Deduced a trap composed of 3 places in 382 ms of which 1 ms to minimize.
[2024-05-24 15:37:22] [INFO ] Deduced a trap composed of 3 places in 325 ms of which 0 ms to minimize.
[2024-05-24 15:37:23] [INFO ] Deduced a trap composed of 3 places in 270 ms of which 1 ms to minimize.
[2024-05-24 15:37:23] [INFO ] Deduced a trap composed of 3 places in 200 ms of which 1 ms to minimize.
[2024-05-24 15:37:23] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 1 ms to minimize.
[2024-05-24 15:37:23] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 1 ms to minimize.
[2024-05-24 15:37:24] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 1 ms to minimize.
[2024-05-24 15:37:24] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 0 ms to minimize.
[2024-05-24 15:37:24] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 1 ms to minimize.
[2024-05-24 15:37:24] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3025 ms
[2024-05-24 15:37:24] [INFO ] After 3300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 116 ms.
[2024-05-24 15:37:24] [INFO ] After 4100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 168 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 487/487 places, 2916/2916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 168 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 15:37:25] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:37:25] [INFO ] Invariant cache hit.
[2024-05-24 15:37:26] [INFO ] Implicit Places using invariants in 1182 ms returned []
[2024-05-24 15:37:26] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:37:26] [INFO ] Invariant cache hit.
[2024-05-24 15:37:26] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:37:31] [INFO ] Implicit Places using invariants and state equation in 4827 ms returned []
Implicit Place search using SMT with State Equation took 6011 ms to find 0 implicit places.
[2024-05-24 15:37:31] [INFO ] Redundant transitions in 148 ms returned []
[2024-05-24 15:37:31] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:37:31] [INFO ] Invariant cache hit.
[2024-05-24 15:37:33] [INFO ] Dead Transitions using invariants and state equation in 2627 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8963 ms. Remains : 487/487 places, 2916/2916 transitions.
Graph (trivial) has 2700 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions removed 277 transitions
Ensure Unique test removed 2024 transitions
Reduce isomorphic transitions removed 2301 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 518
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 518
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 318 transition count 500
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 292 transition count 500
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 525 place count 149 transition count 357
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 595 place count 149 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 609 place count 142 transition count 287
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 616 place count 142 transition count 280
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 625 place count 142 transition count 271
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 699 place count 142 transition count 197
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 773 place count 68 transition count 197
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 782 place count 68 transition count 197
Applied a total of 782 rules in 28 ms. Remains 68 /487 variables (removed 419) and now considering 197/2916 (removed 2719) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 197 rows 68 cols
[2024-05-24 15:37:33] [INFO ] Computed 20 invariants in 0 ms
[2024-05-24 15:37:33] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:37:33] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 15:37:33] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 15:37:34] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:37:34] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 15:37:34] [INFO ] After 15ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:37:34] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-24 15:37:34] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(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 212 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 25 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 15:37:34] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 15:37:34] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 15:37:35] [INFO ] Implicit Places using invariants in 1207 ms returned []
[2024-05-24 15:37:35] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:37:35] [INFO ] Invariant cache hit.
[2024-05-24 15:37:36] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:37:39] [INFO ] Implicit Places using invariants and state equation in 3870 ms returned []
Implicit Place search using SMT with State Equation took 5078 ms to find 0 implicit places.
[2024-05-24 15:37:39] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:37:39] [INFO ] Invariant cache hit.
[2024-05-24 15:37:42] [INFO ] Dead Transitions using invariants and state equation in 2490 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7596 ms. Remains : 487/487 places, 2916/2916 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 283210 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 283210 steps, saw 180666 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:37:45] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:37:45] [INFO ] Invariant cache hit.
[2024-05-24 15:37:45] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:37:45] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2024-05-24 15:37:45] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 15:37:46] [INFO ] After 502ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:37:46] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:37:46] [INFO ] After 175ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:37:46] [INFO ] Deduced a trap composed of 3 places in 365 ms of which 1 ms to minimize.
[2024-05-24 15:37:47] [INFO ] Deduced a trap composed of 3 places in 397 ms of which 1 ms to minimize.
[2024-05-24 15:37:47] [INFO ] Deduced a trap composed of 3 places in 331 ms of which 0 ms to minimize.
[2024-05-24 15:37:48] [INFO ] Deduced a trap composed of 3 places in 275 ms of which 1 ms to minimize.
[2024-05-24 15:37:48] [INFO ] Deduced a trap composed of 3 places in 203 ms of which 0 ms to minimize.
[2024-05-24 15:37:48] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 1 ms to minimize.
[2024-05-24 15:37:48] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 1 ms to minimize.
[2024-05-24 15:37:48] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 1 ms to minimize.
[2024-05-24 15:37:49] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 0 ms to minimize.
[2024-05-24 15:37:49] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 1 ms to minimize.
[2024-05-24 15:37:49] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3012 ms
[2024-05-24 15:37:49] [INFO ] After 3275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 116 ms.
[2024-05-24 15:37:49] [INFO ] After 4026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 168 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 487/487 places, 2916/2916 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 311220 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 311220 steps, saw 197428 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:37:52] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:37:52] [INFO ] Invariant cache hit.
[2024-05-24 15:37:52] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:37:53] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-24 15:37:53] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2024-05-24 15:37:53] [INFO ] After 438ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:37:53] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:37:53] [INFO ] After 186ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:37:54] [INFO ] Deduced a trap composed of 3 places in 400 ms of which 1 ms to minimize.
[2024-05-24 15:37:54] [INFO ] Deduced a trap composed of 3 places in 390 ms of which 1 ms to minimize.
[2024-05-24 15:37:55] [INFO ] Deduced a trap composed of 3 places in 337 ms of which 1 ms to minimize.
[2024-05-24 15:37:55] [INFO ] Deduced a trap composed of 3 places in 268 ms of which 1 ms to minimize.
[2024-05-24 15:37:55] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 1 ms to minimize.
[2024-05-24 15:37:55] [INFO ] Deduced a trap composed of 31 places in 207 ms of which 1 ms to minimize.
[2024-05-24 15:37:56] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 1 ms to minimize.
[2024-05-24 15:37:56] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 0 ms to minimize.
[2024-05-24 15:37:56] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
[2024-05-24 15:37:56] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 1 ms to minimize.
[2024-05-24 15:37:56] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3048 ms
[2024-05-24 15:37:56] [INFO ] After 3325ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 113 ms.
[2024-05-24 15:37:56] [INFO ] After 4007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 168 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 487/487 places, 2916/2916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 171 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 15:37:57] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:37:57] [INFO ] Invariant cache hit.
[2024-05-24 15:37:58] [INFO ] Implicit Places using invariants in 1164 ms returned []
[2024-05-24 15:37:58] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:37:58] [INFO ] Invariant cache hit.
[2024-05-24 15:37:59] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:38:02] [INFO ] Implicit Places using invariants and state equation in 4175 ms returned []
Implicit Place search using SMT with State Equation took 5341 ms to find 0 implicit places.
[2024-05-24 15:38:02] [INFO ] Redundant transitions in 117 ms returned []
[2024-05-24 15:38:02] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:38:02] [INFO ] Invariant cache hit.
[2024-05-24 15:38:04] [INFO ] Dead Transitions using invariants and state equation in 2123 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7760 ms. Remains : 487/487 places, 2916/2916 transitions.
Graph (trivial) has 2700 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions removed 277 transitions
Ensure Unique test removed 2024 transitions
Reduce isomorphic transitions removed 2301 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 518
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 518
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 318 transition count 500
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 292 transition count 500
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 525 place count 149 transition count 357
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 595 place count 149 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 609 place count 142 transition count 287
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 616 place count 142 transition count 280
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 625 place count 142 transition count 271
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 699 place count 142 transition count 197
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 773 place count 68 transition count 197
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 782 place count 68 transition count 197
Applied a total of 782 rules in 32 ms. Remains 68 /487 variables (removed 419) and now considering 197/2916 (removed 2719) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 197 rows 68 cols
[2024-05-24 15:38:04] [INFO ] Computed 20 invariants in 1 ms
[2024-05-24 15:38:04] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:38:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 15:38:04] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 15:38:05] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:38:05] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 15:38:05] [INFO ] After 15ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:38:05] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-24 15:38:05] [INFO ] After 144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(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 202 ms :[(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 214 ms :[(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 1067 ms.
Product exploration explored 100000 steps with 25000 reset in 728 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 130 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 15:38:08] [INFO ] Redundant transitions in 120 ms returned []
[2024-05-24 15:38:08] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 15:38:08] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 15:38:10] [INFO ] Dead Transitions using invariants and state equation in 2399 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2657 ms. Remains : 487/487 places, 2916/2916 transitions.
Built C files in :
/tmp/ltsmin16593287320096055805
[2024-05-24 15:38:10] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16593287320096055805
Running compilation step : cd /tmp/ltsmin16593287320096055805;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16593287320096055805;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16593287320096055805;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 16 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 15:38:13] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:38:13] [INFO ] Invariant cache hit.
[2024-05-24 15:38:14] [INFO ] Implicit Places using invariants in 846 ms returned []
[2024-05-24 15:38:14] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:38:14] [INFO ] Invariant cache hit.
[2024-05-24 15:38:14] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 15:38:18] [INFO ] Implicit Places using invariants and state equation in 4381 ms returned []
Implicit Place search using SMT with State Equation took 5229 ms to find 0 implicit places.
[2024-05-24 15:38:18] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 15:38:18] [INFO ] Invariant cache hit.
[2024-05-24 15:38:20] [INFO ] Dead Transitions using invariants and state equation in 1700 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6946 ms. Remains : 487/487 places, 2916/2916 transitions.
Built C files in :
/tmp/ltsmin8645044380366392171
[2024-05-24 15:38:20] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8645044380366392171
Running compilation step : cd /tmp/ltsmin8645044380366392171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8645044380366392171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8645044380366392171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 15:38:23] [INFO ] Flatten gal took : 73 ms
[2024-05-24 15:38:23] [INFO ] Flatten gal took : 76 ms
[2024-05-24 15:38:23] [INFO ] Time to serialize gal into /tmp/LTL1229954478587303972.gal : 14 ms
[2024-05-24 15:38:23] [INFO ] Time to serialize properties into /tmp/LTL12653983809998207064.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/LTL1229954478587303972.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5613433766038490650.hoa' '-atoms' '/tmp/LTL12653983809998207064.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/LTL12653983809998207064.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5613433766038490650.hoa
Detected timeout of ITS tools.
[2024-05-24 15:38:38] [INFO ] Flatten gal took : 73 ms
[2024-05-24 15:38:38] [INFO ] Flatten gal took : 75 ms
[2024-05-24 15:38:38] [INFO ] Time to serialize gal into /tmp/LTL17742089048704089232.gal : 10 ms
[2024-05-24 15:38:38] [INFO ] Time to serialize properties into /tmp/LTL15386369200574269075.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/LTL17742089048704089232.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15386369200574269075.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...277
Read 1 LTL properties
Checking formula 0 : !((X(F((X(X(F("(((turn_1==0)||(flag_1_waiting==0))||(p25_5_1==0))"))))||("((turn_3==1)&&(p10_8_2==1))")))))
Formula 0 simplified : XG(!"((turn_3==1)&&(p10_8_2==1))" & XXG!"(((turn_1==0)||(flag_1_waiting==0))||(p25_5_1==0))")
Detected timeout of ITS tools.
[2024-05-24 15:38:54] [INFO ] Flatten gal took : 73 ms
[2024-05-24 15:38:54] [INFO ] Applying decomposition
[2024-05-24 15:38:54] [INFO ] Flatten gal took : 75 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/graph5857894801069438503.txt' '-o' '/tmp/graph5857894801069438503.bin' '-w' '/tmp/graph5857894801069438503.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5857894801069438503.bin' '-l' '-1' '-v' '-w' '/tmp/graph5857894801069438503.weights' '-q' '0' '-e' '0.001'
[2024-05-24 15:38:54] [INFO ] Decomposing Gal with order
[2024-05-24 15:38:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 15:38:54] [INFO ] Removed a total of 6339 redundant transitions.
[2024-05-24 15:38:54] [INFO ] Flatten gal took : 338 ms
[2024-05-24 15:38:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 570 labels/synchronizations in 82 ms.
[2024-05-24 15:38:54] [INFO ] Time to serialize gal into /tmp/LTL11510769334280899487.gal : 18 ms
[2024-05-24 15:38:54] [INFO ] Time to serialize properties into /tmp/LTL17088317049195115731.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/LTL11510769334280899487.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17088317049195115731.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F((X(X(F("(((i3.u62.turn_1==0)||(i3.u4.flag_1_waiting==0))||(i3.u4.p25_5_1==0))"))))||("((i14.u6.turn_3==1)&&(u14.p10_8_2==1))"))...158
Formula 0 simplified : XG(!"((i14.u6.turn_3==1)&&(u14.p10_8_2==1))" & XXG!"(((i3.u62.turn_1==0)||(i3.u4.flag_1_waiting==0))||(i3.u4.p25_5_1==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12944732608568262296
[2024-05-24 15:39:09] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12944732608568262296
Running compilation step : cd /tmp/ltsmin12944732608568262296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12944732608568262296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12944732608568262296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-13 finished in 132598 ms.
[2024-05-24 15:39:13] [INFO ] Flatten gal took : 81 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13514159972193343005
[2024-05-24 15:39:13] [INFO ] Too many transitions (3276) to apply POR reductions. Disabling POR matrices.
[2024-05-24 15:39:13] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13514159972193343005
Running compilation step : cd /tmp/ltsmin13514159972193343005;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '90' '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-24 15:39:13] [INFO ] Applying decomposition
[2024-05-24 15:39:13] [INFO ] Flatten gal took : 87 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/graph17801695772486897751.txt' '-o' '/tmp/graph17801695772486897751.bin' '-w' '/tmp/graph17801695772486897751.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17801695772486897751.bin' '-l' '-1' '-v' '-w' '/tmp/graph17801695772486897751.weights' '-q' '0' '-e' '0.001'
[2024-05-24 15:39:13] [INFO ] Decomposing Gal with order
[2024-05-24 15:39:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 15:39:13] [INFO ] Removed a total of 6540 redundant transitions.
[2024-05-24 15:39:13] [INFO ] Flatten gal took : 242 ms
[2024-05-24 15:39:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 928 labels/synchronizations in 115 ms.
[2024-05-24 15:39:13] [INFO ] Time to serialize gal into /tmp/LTLFireability1897825305686891646.gal : 21 ms
[2024-05-24 15:39:13] [INFO ] Time to serialize properties into /tmp/LTLFireability2874237534373966542.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/LTLFireability1897825305686891646.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2874237534373966542.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 8 LTL properties
Checking formula 0 : !((F((G("(((((i1.u2.turn_6==0)||(i0.u0.flag_6_waiting==0))||(i18.i0.u3.p25_3_7==0))&&(i16.i0.u5.flag_3_idle==1))&&(i16.i0.u207.p33_0_3...247
Formula 0 simplified : G(F!"(((((i1.u2.turn_6==0)||(i0.u0.flag_6_waiting==0))||(i18.i0.u3.p25_3_7==0))&&(i16.i0.u5.flag_3_idle==1))&&(i16.i0.u207.p33_0_3==...239
Compilation finished in 13774 ms.
Running link step : cd /tmp/ltsmin13514159972193343005;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin13514159972193343005;'/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))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin13514159972193343005;'/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))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13514159972193343005;'/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' '<>([]((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin13514159972193343005;'/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' '<>([]((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13514159972193343005;'/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([](([]((LTLAPp4==true))||(LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin13514159972193343005;'/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([](([]((LTLAPp4==true))||(LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13514159972193343005;'/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((LTLAPp6==true))||[]((LTLAPp7==true))))||(LTLAPp5==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-24 16:09:12] [INFO ] Applying decomposition
[2024-05-24 16:09:12] [INFO ] Flatten gal took : 222 ms
[2024-05-24 16:09:12] [INFO ] Decomposing Gal with order
[2024-05-24 16:09:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 16:09:13] [INFO ] Removed a total of 7632 redundant transitions.
[2024-05-24 16:09:13] [INFO ] Flatten gal took : 617 ms
[2024-05-24 16:09:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 421 labels/synchronizations in 120 ms.
[2024-05-24 16:09:13] [INFO ] Time to serialize gal into /tmp/LTLFireability13648510985068252274.gal : 31 ms
[2024-05-24 16:09:13] [INFO ] Time to serialize properties into /tmp/LTLFireability5764300399825002816.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/LTLFireability13648510985068252274.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5764300399825002816.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 8 LTL properties
Checking formula 0 : !((F((G("(((((u11.turn_6==0)||(u18.flag_6_waiting==0))||(i0.u22.p25_3_7==0))&&(u15.flag_3_idle==1))&&(i0.u23.p33_0_3==1))"))||(G("(((u...222
Formula 0 simplified : G(F!"(((((u11.turn_6==0)||(u18.flag_6_waiting==0))||(i0.u22.p25_3_7==0))&&(u15.flag_3_idle==1))&&(i0.u23.p33_0_3==1))" & F!"(((u11.t...214
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13160600 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16033560 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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="EisenbergMcGuire-PT-09"
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 EisenbergMcGuire-PT-09, 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 r175-smll-171636280000123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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