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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K 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 1.7M 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-08-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716556049763

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-08
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 13:07:33] [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 13:07:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 13:07:33] [INFO ] Load time of PNML (sax parser for PT used): 283 ms
[2024-05-24 13:07:33] [INFO ] Transformed 712 places.
[2024-05-24 13:07:33] [INFO ] Transformed 2816 transitions.
[2024-05-24 13:07:33] [INFO ] Found NUPN structural information;
[2024-05-24 13:07:33] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 430 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 663 transition count 2424
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 663 transition count 2424
Applied a total of 98 rules in 166 ms. Remains 663 /712 variables (removed 49) and now considering 2424/2816 (removed 392) transitions.
[2024-05-24 13:07:34] [INFO ] Flow matrix only has 976 transitions (discarded 1448 similar events)
// Phase 1: matrix 976 rows 663 cols
[2024-05-24 13:07:34] [INFO ] Computed 25 invariants in 34 ms
[2024-05-24 13:07:35] [INFO ] Implicit Places using invariants in 922 ms returned []
[2024-05-24 13:07:35] [INFO ] Flow matrix only has 976 transitions (discarded 1448 similar events)
[2024-05-24 13:07:35] [INFO ] Invariant cache hit.
[2024-05-24 13:07:35] [INFO ] State equation strengthened by 333 read => feed constraints.
[2024-05-24 13:07:39] [INFO ] Implicit Places using invariants and state equation in 4128 ms returned []
Implicit Place search using SMT with State Equation took 5100 ms to find 0 implicit places.
[2024-05-24 13:07:39] [INFO ] Flow matrix only has 976 transitions (discarded 1448 similar events)
[2024-05-24 13:07:39] [INFO ] Invariant cache hit.
[2024-05-24 13:07:40] [INFO ] Dead Transitions using invariants and state equation in 1815 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 663/712 places, 2424/2816 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7085 ms. Remains : 663/712 places, 2424/2816 transitions.
Support contains 38 out of 663 places after structural reductions.
[2024-05-24 13:07:41] [INFO ] Flatten gal took : 396 ms
[2024-05-24 13:07:42] [INFO ] Flatten gal took : 261 ms
[2024-05-24 13:07:42] [INFO ] Input system was already deterministic with 2424 transitions.
Support contains 35 out of 663 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 896 ms. (steps per millisecond=11 ) properties (out of 21) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) 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 16) seen :0
Running SMT prover for 16 properties.
[2024-05-24 13:07:43] [INFO ] Flow matrix only has 976 transitions (discarded 1448 similar events)
[2024-05-24 13:07:43] [INFO ] Invariant cache hit.
[2024-05-24 13:07:44] [INFO ] [Real]Absence check using 17 positive place invariants in 36 ms returned sat
[2024-05-24 13:07:44] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 12 ms returned sat
[2024-05-24 13:07:44] [INFO ] After 864ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:15
[2024-05-24 13:07:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 40 ms returned sat
[2024-05-24 13:07:45] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 11 ms returned sat
[2024-05-24 13:07:47] [INFO ] After 1746ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :15
[2024-05-24 13:07:47] [INFO ] State equation strengthened by 333 read => feed constraints.
[2024-05-24 13:07:48] [INFO ] After 1372ms SMT Verify possible using 333 Read/Feed constraints in natural domain returned unsat :1 sat :15
[2024-05-24 13:07:49] [INFO ] Deduced a trap composed of 3 places in 548 ms of which 12 ms to minimize.
[2024-05-24 13:07:49] [INFO ] Deduced a trap composed of 3 places in 298 ms of which 2 ms to minimize.
[2024-05-24 13:07:49] [INFO ] Deduced a trap composed of 44 places in 272 ms of which 2 ms to minimize.
[2024-05-24 13:07:50] [INFO ] Deduced a trap composed of 3 places in 225 ms of which 1 ms to minimize.
[2024-05-24 13:07:50] [INFO ] Deduced a trap composed of 50 places in 218 ms of which 1 ms to minimize.
[2024-05-24 13:07:50] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 1 ms to minimize.
[2024-05-24 13:07:50] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 1 ms to minimize.
[2024-05-24 13:07:51] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 1 ms to minimize.
[2024-05-24 13:07:51] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-24 13:07:51] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2554 ms
[2024-05-24 13:07:51] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 2 ms to minimize.
[2024-05-24 13:07:51] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 0 ms to minimize.
[2024-05-24 13:07:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 526 ms
[2024-05-24 13:07:52] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 1 ms to minimize.
[2024-05-24 13:07:52] [INFO ] Deduced a trap composed of 140 places in 685 ms of which 1 ms to minimize.
[2024-05-24 13:07:53] [INFO ] Deduced a trap composed of 3 places in 732 ms of which 1 ms to minimize.
[2024-05-24 13:07:54] [INFO ] Deduced a trap composed of 21 places in 728 ms of which 1 ms to minimize.
[2024-05-24 13:07:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2581 ms
[2024-05-24 13:07:54] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 0 ms to minimize.
[2024-05-24 13:07:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2024-05-24 13:07:55] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 1 ms to minimize.
[2024-05-24 13:07:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2024-05-24 13:07:55] [INFO ] Deduced a trap composed of 14 places in 224 ms of which 1 ms to minimize.
[2024-05-24 13:07:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2024-05-24 13:07:56] [INFO ] Deduced a trap composed of 26 places in 222 ms of which 2 ms to minimize.
[2024-05-24 13:07:56] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 0 ms to minimize.
[2024-05-24 13:07:56] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 1 ms to minimize.
[2024-05-24 13:07:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 772 ms
[2024-05-24 13:07:57] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 3 ms to minimize.
[2024-05-24 13:07:57] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 0 ms to minimize.
[2024-05-24 13:07:57] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 0 ms to minimize.
[2024-05-24 13:07:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 800 ms
[2024-05-24 13:07:58] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 1 ms to minimize.
[2024-05-24 13:07:58] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 1 ms to minimize.
[2024-05-24 13:07:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 566 ms
[2024-05-24 13:07:58] [INFO ] After 11538ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :15
Attempting to minimize the solution found.
Minimization took 1922 ms.
[2024-05-24 13:08:00] [INFO ] After 16011ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :15
Fused 16 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 1209 ms.
Support contains 29 out of 663 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 198 Pre rules applied. Total rules applied 16 place count 655 transition count 2218
Deduced a syphon composed of 198 places in 4 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 2 with 396 rules applied. Total rules applied 412 place count 457 transition count 2218
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 415 place count 454 transition count 2194
Iterating global reduction 2 with 3 rules applied. Total rules applied 418 place count 454 transition count 2194
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 8 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 530 place count 398 transition count 2138
Applied a total of 530 rules in 347 ms. Remains 398 /663 variables (removed 265) and now considering 2138/2424 (removed 286) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 348 ms. Remains : 398/663 places, 2138/2424 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 15) 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 15) 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 15) 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 15) 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 15) 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 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) 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 14) 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 14) 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 14) 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 14) 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 14) 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 14) 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 14) 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 14) seen :0
Interrupted probabilistic random walk after 116244 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{2=1}
Probabilistic random walk after 116244 steps, saw 71003 distinct states, run finished after 3003 ms. (steps per millisecond=38 ) properties seen :1
Running SMT prover for 13 properties.
[2024-05-24 13:08:05] [INFO ] Flow matrix only has 690 transitions (discarded 1448 similar events)
// Phase 1: matrix 690 rows 398 cols
[2024-05-24 13:08:05] [INFO ] Computed 25 invariants in 7 ms
[2024-05-24 13:08:05] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2024-05-24 13:08:06] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 8 ms returned sat
[2024-05-24 13:08:06] [INFO ] After 357ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-24 13:08:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2024-05-24 13:08:06] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 8 ms returned sat
[2024-05-24 13:08:07] [INFO ] After 876ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-05-24 13:08:07] [INFO ] State equation strengthened by 312 read => feed constraints.
[2024-05-24 13:08:08] [INFO ] After 870ms SMT Verify possible using 312 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2024-05-24 13:08:08] [INFO ] Deduced a trap composed of 3 places in 273 ms of which 1 ms to minimize.
[2024-05-24 13:08:08] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 1 ms to minimize.
[2024-05-24 13:08:09] [INFO ] Deduced a trap composed of 3 places in 216 ms of which 1 ms to minimize.
[2024-05-24 13:08:09] [INFO ] Deduced a trap composed of 3 places in 223 ms of which 1 ms to minimize.
[2024-05-24 13:08:09] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 1 ms to minimize.
[2024-05-24 13:08:09] [INFO ] Deduced a trap composed of 48 places in 183 ms of which 1 ms to minimize.
[2024-05-24 13:08:10] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 2 ms to minimize.
[2024-05-24 13:08:10] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 2 ms to minimize.
[2024-05-24 13:08:10] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 1 ms to minimize.
[2024-05-24 13:08:10] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-24 13:08:10] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 1 ms to minimize.
[2024-05-24 13:08:10] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2024-05-24 13:08:11] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2726 ms
[2024-05-24 13:08:11] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 0 ms to minimize.
[2024-05-24 13:08:11] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-24 13:08:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 375 ms
[2024-05-24 13:08:11] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 1 ms to minimize.
[2024-05-24 13:08:12] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2024-05-24 13:08:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 442 ms
[2024-05-24 13:08:12] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 1 ms to minimize.
[2024-05-24 13:08:12] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 0 ms to minimize.
[2024-05-24 13:08:12] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 0 ms to minimize.
[2024-05-24 13:08:12] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 2 ms to minimize.
[2024-05-24 13:08:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 765 ms
[2024-05-24 13:08:13] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 0 ms to minimize.
[2024-05-24 13:08:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2024-05-24 13:08:13] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 0 ms to minimize.
[2024-05-24 13:08:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2024-05-24 13:08:13] [INFO ] Deduced a trap composed of 20 places in 189 ms of which 1 ms to minimize.
[2024-05-24 13:08:14] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-05-24 13:08:14] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2024-05-24 13:08:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 582 ms
[2024-05-24 13:08:14] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 1 ms to minimize.
[2024-05-24 13:08:14] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 1 ms to minimize.
[2024-05-24 13:08:14] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2024-05-24 13:08:15] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 0 ms to minimize.
[2024-05-24 13:08:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 808 ms
[2024-05-24 13:08:15] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2024-05-24 13:08:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2024-05-24 13:08:15] [INFO ] After 8233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 1009 ms.
[2024-05-24 13:08:16] [INFO ] After 10516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 0 properties in 192 ms.
Support contains 29 out of 398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 2138/2138 transitions.
Applied a total of 0 rules in 149 ms. Remains 398 /398 variables (removed 0) and now considering 2138/2138 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 398/398 places, 2138/2138 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 470 ms. (steps per millisecond=21 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 13) 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 13) 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 13) 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 13) 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 13) 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 13) 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 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) 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 13) 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 13) seen :0
Interrupted probabilistic random walk after 109323 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109323 steps, saw 67217 distinct states, run finished after 3002 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 13 properties.
[2024-05-24 13:08:21] [INFO ] Flow matrix only has 690 transitions (discarded 1448 similar events)
[2024-05-24 13:08:21] [INFO ] Invariant cache hit.
[2024-05-24 13:08:21] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-24 13:08:21] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-24 13:08:21] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-24 13:08:21] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2024-05-24 13:08:21] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 9 ms returned sat
[2024-05-24 13:08:22] [INFO ] After 990ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-05-24 13:08:22] [INFO ] State equation strengthened by 312 read => feed constraints.
[2024-05-24 13:08:23] [INFO ] After 887ms SMT Verify possible using 312 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2024-05-24 13:08:24] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 1 ms to minimize.
[2024-05-24 13:08:24] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 1 ms to minimize.
[2024-05-24 13:08:24] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 1 ms to minimize.
[2024-05-24 13:08:24] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 1 ms to minimize.
[2024-05-24 13:08:25] [INFO ] Deduced a trap composed of 33 places in 211 ms of which 1 ms to minimize.
[2024-05-24 13:08:25] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 0 ms to minimize.
[2024-05-24 13:08:25] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2024-05-24 13:08:25] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 3 ms to minimize.
[2024-05-24 13:08:25] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1652 ms
[2024-05-24 13:08:25] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2024-05-24 13:08:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2024-05-24 13:08:26] [INFO ] Deduced a trap composed of 27 places in 248 ms of which 1 ms to minimize.
[2024-05-24 13:08:26] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 4 ms to minimize.
[2024-05-24 13:08:26] [INFO ] Deduced a trap composed of 29 places in 185 ms of which 1 ms to minimize.
[2024-05-24 13:08:26] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 0 ms to minimize.
[2024-05-24 13:08:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1058 ms
[2024-05-24 13:08:27] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 1 ms to minimize.
[2024-05-24 13:08:27] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 0 ms to minimize.
[2024-05-24 13:08:27] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 0 ms to minimize.
[2024-05-24 13:08:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 563 ms
[2024-05-24 13:08:27] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 1 ms to minimize.
[2024-05-24 13:08:27] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-05-24 13:08:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 331 ms
[2024-05-24 13:08:28] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 0 ms to minimize.
[2024-05-24 13:08:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2024-05-24 13:08:28] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 13:08:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2024-05-24 13:08:28] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2024-05-24 13:08:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2024-05-24 13:08:28] [INFO ] After 6017ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 886 ms.
[2024-05-24 13:08:29] [INFO ] After 8385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 0 properties in 171 ms.
Support contains 29 out of 398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 2138/2138 transitions.
Applied a total of 0 rules in 182 ms. Remains 398 /398 variables (removed 0) and now considering 2138/2138 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 398/398 places, 2138/2138 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 2138/2138 transitions.
Applied a total of 0 rules in 181 ms. Remains 398 /398 variables (removed 0) and now considering 2138/2138 (removed 0) transitions.
[2024-05-24 13:08:30] [INFO ] Flow matrix only has 690 transitions (discarded 1448 similar events)
[2024-05-24 13:08:30] [INFO ] Invariant cache hit.
[2024-05-24 13:08:31] [INFO ] Implicit Places using invariants in 667 ms returned []
[2024-05-24 13:08:31] [INFO ] Flow matrix only has 690 transitions (discarded 1448 similar events)
[2024-05-24 13:08:31] [INFO ] Invariant cache hit.
[2024-05-24 13:08:31] [INFO ] State equation strengthened by 312 read => feed constraints.
[2024-05-24 13:08:33] [INFO ] Implicit Places using invariants and state equation in 2547 ms returned []
Implicit Place search using SMT with State Equation took 3224 ms to find 0 implicit places.
[2024-05-24 13:08:33] [INFO ] Redundant transitions in 196 ms returned []
[2024-05-24 13:08:33] [INFO ] Flow matrix only has 690 transitions (discarded 1448 similar events)
[2024-05-24 13:08:33] [INFO ] Invariant cache hit.
[2024-05-24 13:08:35] [INFO ] Dead Transitions using invariants and state equation in 2156 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5767 ms. Remains : 398/398 places, 2138/2138 transitions.
Graph (trivial) has 1772 edges and 398 vertex of which 64 / 398 are part of one of the 8 SCC in 5 ms
Free SCC test removed 56 places
Drop transitions removed 208 transitions
Ensure Unique test removed 1428 transitions
Reduce isomorphic transitions removed 1636 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 342 transition count 432
Reduce places removed 70 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 272 transition count 431
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 143 place count 271 transition count 431
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 143 place count 271 transition count 417
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 33 rules applied. Total rules applied 176 place count 252 transition count 417
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 1 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 382 place count 149 transition count 314
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 3 with 41 rules applied. Total rules applied 423 place count 149 transition count 273
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 425 place count 148 transition count 273
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 426 place count 148 transition count 272
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 440 place count 148 transition count 258
Free-agglomeration rule applied 65 times.
Iterating global reduction 5 with 65 rules applied. Total rules applied 505 place count 148 transition count 193
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 5 with 65 rules applied. Total rules applied 570 place count 83 transition count 193
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 578 place count 83 transition count 193
Applied a total of 578 rules in 73 ms. Remains 83 /398 variables (removed 315) and now considering 193/2138 (removed 1945) transitions.
Running SMT prover for 13 properties.
// Phase 1: matrix 193 rows 83 cols
[2024-05-24 13:08:36] [INFO ] Computed 20 invariants in 6 ms
[2024-05-24 13:08:36] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-24 13:08:36] [INFO ] [Real]Absence check using 17 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-24 13:08:36] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-24 13:08:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-05-24 13:08:36] [INFO ] [Nat]Absence check using 17 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-24 13:08:36] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-05-24 13:08:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 13:08:36] [INFO ] After 169ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2024-05-24 13:08:36] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
[2024-05-24 13:08:36] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-24 13:08:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-24 13:08:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 115 ms
[2024-05-24 13:08:36] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-24 13:08:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2024-05-24 13:08:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-24 13:08:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-05-24 13:08:37] [INFO ] After 584ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 165 ms.
[2024-05-24 13:08:37] [INFO ] After 1107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
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' '!(X(G((!p0&&(p1 U p2)))))'
Support contains 4 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 658 transition count 2384
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 658 transition count 2384
Applied a total of 10 rules in 59 ms. Remains 658 /663 variables (removed 5) and now considering 2384/2424 (removed 40) transitions.
[2024-05-24 13:08:37] [INFO ] Flow matrix only has 936 transitions (discarded 1448 similar events)
// Phase 1: matrix 936 rows 658 cols
[2024-05-24 13:08:37] [INFO ] Computed 25 invariants in 5 ms
[2024-05-24 13:08:38] [INFO ] Implicit Places using invariants in 788 ms returned []
[2024-05-24 13:08:38] [INFO ] Flow matrix only has 936 transitions (discarded 1448 similar events)
[2024-05-24 13:08:38] [INFO ] Invariant cache hit.
[2024-05-24 13:08:39] [INFO ] State equation strengthened by 298 read => feed constraints.
[2024-05-24 13:08:42] [INFO ] Implicit Places using invariants and state equation in 4297 ms returned []
Implicit Place search using SMT with State Equation took 5090 ms to find 0 implicit places.
[2024-05-24 13:08:42] [INFO ] Flow matrix only has 936 transitions (discarded 1448 similar events)
[2024-05-24 13:08:42] [INFO ] Invariant cache hit.
[2024-05-24 13:08:44] [INFO ] Dead Transitions using invariants and state equation in 2052 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 658/663 places, 2384/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7205 ms. Remains : 658/663 places, 2384/2424 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 425 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), true, (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 1}, { cond=(OR p0 (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s168 1)), p2:(AND (EQ s7 1) (EQ s169 1)), p1:(OR (AND (EQ s5 1) (EQ s168 1)) (AND (EQ s7 1) (EQ s169 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-00 finished in 7731 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 656 transition count 2368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 656 transition count 2368
Applied a total of 14 rules in 90 ms. Remains 656 /663 variables (removed 7) and now considering 2368/2424 (removed 56) transitions.
[2024-05-24 13:08:45] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2024-05-24 13:08:45] [INFO ] Computed 25 invariants in 8 ms
[2024-05-24 13:08:46] [INFO ] Implicit Places using invariants in 954 ms returned []
[2024-05-24 13:08:46] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 13:08:46] [INFO ] Invariant cache hit.
[2024-05-24 13:08:46] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:08:50] [INFO ] Implicit Places using invariants and state equation in 3819 ms returned []
Implicit Place search using SMT with State Equation took 4778 ms to find 0 implicit places.
[2024-05-24 13:08:50] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 13:08:50] [INFO ] Invariant cache hit.
[2024-05-24 13:08:52] [INFO ] Dead Transitions using invariants and state equation in 2355 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/663 places, 2368/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7228 ms. Remains : 656/663 places, 2368/2424 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s4 1) (EQ s22 1) (EQ s490 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-02 finished in 7346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 422 place count 449 transition count 2168
Iterating global reduction 2 with 6 rules applied. Total rules applied 428 place count 449 transition count 2168
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 540 place count 393 transition count 2112
Applied a total of 540 rules in 224 ms. Remains 393 /663 variables (removed 270) and now considering 2112/2424 (removed 312) transitions.
[2024-05-24 13:08:52] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
// Phase 1: matrix 664 rows 393 cols
[2024-05-24 13:08:52] [INFO ] Computed 25 invariants in 6 ms
[2024-05-24 13:08:53] [INFO ] Implicit Places using invariants in 683 ms returned []
[2024-05-24 13:08:53] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 13:08:53] [INFO ] Invariant cache hit.
[2024-05-24 13:08:53] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-24 13:08:56] [INFO ] Implicit Places using invariants and state equation in 2625 ms returned []
Implicit Place search using SMT with State Equation took 3311 ms to find 0 implicit places.
[2024-05-24 13:08:56] [INFO ] Redundant transitions in 143 ms returned []
[2024-05-24 13:08:56] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 13:08:56] [INFO ] Invariant cache hit.
[2024-05-24 13:08:57] [INFO ] Dead Transitions using invariants and state equation in 1640 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 393/663 places, 2112/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5330 ms. Remains : 393/663 places, 2112/2424 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s112 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 645 reset in 528 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 1 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-03 finished in 5981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 422 place count 449 transition count 2168
Iterating global reduction 2 with 6 rules applied. Total rules applied 428 place count 449 transition count 2168
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 540 place count 393 transition count 2112
Applied a total of 540 rules in 160 ms. Remains 393 /663 variables (removed 270) and now considering 2112/2424 (removed 312) transitions.
[2024-05-24 13:08:58] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
// Phase 1: matrix 664 rows 393 cols
[2024-05-24 13:08:58] [INFO ] Computed 25 invariants in 7 ms
[2024-05-24 13:08:59] [INFO ] Implicit Places using invariants in 700 ms returned []
[2024-05-24 13:08:59] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 13:08:59] [INFO ] Invariant cache hit.
[2024-05-24 13:08:59] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-24 13:09:02] [INFO ] Implicit Places using invariants and state equation in 2747 ms returned []
Implicit Place search using SMT with State Equation took 3451 ms to find 0 implicit places.
[2024-05-24 13:09:02] [INFO ] Redundant transitions in 55 ms returned []
[2024-05-24 13:09:02] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 13:09:02] [INFO ] Invariant cache hit.
[2024-05-24 13:09:03] [INFO ] Dead Transitions using invariants and state equation in 1519 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 393/663 places, 2112/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5195 ms. Remains : 393/663 places, 2112/2424 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s112 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 303 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-04 finished in 5602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 423 place count 448 transition count 2160
Iterating global reduction 2 with 7 rules applied. Total rules applied 430 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 542 place count 392 transition count 2104
Applied a total of 542 rules in 175 ms. Remains 392 /663 variables (removed 271) and now considering 2104/2424 (removed 320) transitions.
[2024-05-24 13:09:04] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-24 13:09:04] [INFO ] Computed 25 invariants in 3 ms
[2024-05-24 13:09:05] [INFO ] Implicit Places using invariants in 683 ms returned []
[2024-05-24 13:09:05] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:09:05] [INFO ] Invariant cache hit.
[2024-05-24 13:09:05] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:09:07] [INFO ] Implicit Places using invariants and state equation in 2310 ms returned []
Implicit Place search using SMT with State Equation took 2996 ms to find 0 implicit places.
[2024-05-24 13:09:07] [INFO ] Redundant transitions in 90 ms returned []
[2024-05-24 13:09:07] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:09:07] [INFO ] Invariant cache hit.
[2024-05-24 13:09:09] [INFO ] Dead Transitions using invariants and state equation in 1852 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 392/663 places, 2104/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5130 ms. Remains : 392/663 places, 2104/2424 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s12 1) (EQ s293 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 296 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 1 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-07 finished in 5488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 3 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 421 place count 450 transition count 2176
Iterating global reduction 2 with 5 rules applied. Total rules applied 426 place count 450 transition count 2176
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 538 place count 394 transition count 2120
Applied a total of 538 rules in 179 ms. Remains 394 /663 variables (removed 269) and now considering 2120/2424 (removed 304) transitions.
[2024-05-24 13:09:09] [INFO ] Flow matrix only has 672 transitions (discarded 1448 similar events)
// Phase 1: matrix 672 rows 394 cols
[2024-05-24 13:09:09] [INFO ] Computed 25 invariants in 4 ms
[2024-05-24 13:09:10] [INFO ] Implicit Places using invariants in 572 ms returned []
[2024-05-24 13:09:10] [INFO ] Flow matrix only has 672 transitions (discarded 1448 similar events)
[2024-05-24 13:09:10] [INFO ] Invariant cache hit.
[2024-05-24 13:09:10] [INFO ] State equation strengthened by 298 read => feed constraints.
[2024-05-24 13:09:13] [INFO ] Implicit Places using invariants and state equation in 2594 ms returned []
Implicit Place search using SMT with State Equation took 3169 ms to find 0 implicit places.
[2024-05-24 13:09:13] [INFO ] Redundant transitions in 61 ms returned []
[2024-05-24 13:09:13] [INFO ] Flow matrix only has 672 transitions (discarded 1448 similar events)
[2024-05-24 13:09:13] [INFO ] Invariant cache hit.
[2024-05-24 13:09:14] [INFO ] Dead Transitions using invariants and state equation in 1546 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 394/663 places, 2120/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4966 ms. Remains : 394/663 places, 2120/2424 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s3 1) (EQ s112 1) (NOT (AND (EQ s3 1) (EQ s113 1)))), p0:(AND (EQ s3 1) (EQ s113 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 331 ms.
Stack based approach found an accepted trace after 449 steps with 0 reset with depth 450 and stack size 372 in 2 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-09 finished in 5407 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(p1)&&p0) U X(G(p2))))'
Support contains 8 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 656 transition count 2368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 656 transition count 2368
Applied a total of 14 rules in 30 ms. Remains 656 /663 variables (removed 7) and now considering 2368/2424 (removed 56) transitions.
[2024-05-24 13:09:15] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2024-05-24 13:09:15] [INFO ] Computed 25 invariants in 7 ms
[2024-05-24 13:09:16] [INFO ] Implicit Places using invariants in 846 ms returned []
[2024-05-24 13:09:16] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 13:09:16] [INFO ] Invariant cache hit.
[2024-05-24 13:09:16] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:09:20] [INFO ] Implicit Places using invariants and state equation in 4021 ms returned []
Implicit Place search using SMT with State Equation took 4870 ms to find 0 implicit places.
[2024-05-24 13:09:20] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 13:09:20] [INFO ] Invariant cache hit.
[2024-05-24 13:09:22] [INFO ] Dead Transitions using invariants and state equation in 2146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/663 places, 2368/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7049 ms. Remains : 656/663 places, 2368/2424 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p2:(AND (NOT (AND (EQ s4 1) (EQ s20 1) (EQ s487 1))) (NOT (AND (EQ s15 1) (EQ s163 1)))), p1:(AND (EQ s6 1) (EQ s27 1) (EQ s442 1)), p0:(AND (EQ s6 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 571 steps with 0 reset in 3 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-10 finished in 7306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)||(G(!p1) U p0)))))'
Support contains 6 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 656 transition count 2368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 656 transition count 2368
Applied a total of 14 rules in 48 ms. Remains 656 /663 variables (removed 7) and now considering 2368/2424 (removed 56) transitions.
[2024-05-24 13:09:22] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 13:09:22] [INFO ] Invariant cache hit.
[2024-05-24 13:09:23] [INFO ] Implicit Places using invariants in 915 ms returned []
[2024-05-24 13:09:23] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 13:09:23] [INFO ] Invariant cache hit.
[2024-05-24 13:09:24] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:09:27] [INFO ] Implicit Places using invariants and state equation in 3939 ms returned []
Implicit Place search using SMT with State Equation took 4858 ms to find 0 implicit places.
[2024-05-24 13:09:27] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 13:09:27] [INFO ] Invariant cache hit.
[2024-05-24 13:09:29] [INFO ] Dead Transitions using invariants and state equation in 2244 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/663 places, 2368/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7152 ms. Remains : 656/663 places, 2368/2424 transitions.
Stuttering acceptance computed with spot in 350 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true, p1]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s12 1) (EQ s458 1)), p1:(AND (EQ s4 1) (EQ s20 1) (EQ s452 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 288 ms.
Product exploration explored 100000 steps with 0 reset in 540 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) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 154962 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154962 steps, saw 111459 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 13:09:34] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 13:09:34] [INFO ] Invariant cache hit.
[2024-05-24 13:09:35] [INFO ] [Real]Absence check using 17 positive place invariants in 36 ms returned sat
[2024-05-24 13:09:35] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 11 ms returned sat
[2024-05-24 13:09:35] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 13:09:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 34 ms returned sat
[2024-05-24 13:09:35] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 10 ms returned sat
[2024-05-24 13:09:36] [INFO ] After 723ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 13:09:36] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:09:36] [INFO ] After 387ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 13:09:37] [INFO ] Deduced a trap composed of 3 places in 455 ms of which 1 ms to minimize.
[2024-05-24 13:09:37] [INFO ] Deduced a trap composed of 3 places in 412 ms of which 1 ms to minimize.
[2024-05-24 13:09:38] [INFO ] Deduced a trap composed of 3 places in 448 ms of which 1 ms to minimize.
[2024-05-24 13:09:38] [INFO ] Deduced a trap composed of 3 places in 376 ms of which 1 ms to minimize.
[2024-05-24 13:09:39] [INFO ] Deduced a trap composed of 3 places in 386 ms of which 1 ms to minimize.
[2024-05-24 13:09:39] [INFO ] Deduced a trap composed of 58 places in 240 ms of which 0 ms to minimize.
[2024-05-24 13:09:39] [INFO ] Deduced a trap composed of 41 places in 314 ms of which 1 ms to minimize.
[2024-05-24 13:09:40] [INFO ] Deduced a trap composed of 30 places in 254 ms of which 1 ms to minimize.
[2024-05-24 13:09:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3626 ms
[2024-05-24 13:09:40] [INFO ] Deduced a trap composed of 3 places in 314 ms of which 1 ms to minimize.
[2024-05-24 13:09:40] [INFO ] Deduced a trap composed of 3 places in 230 ms of which 1 ms to minimize.
[2024-05-24 13:09:41] [INFO ] Deduced a trap composed of 122 places in 425 ms of which 1 ms to minimize.
[2024-05-24 13:09:41] [INFO ] Deduced a trap composed of 66 places in 335 ms of which 1 ms to minimize.
[2024-05-24 13:09:42] [INFO ] Deduced a trap composed of 23 places in 295 ms of which 1 ms to minimize.
[2024-05-24 13:09:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2048 ms
[2024-05-24 13:09:42] [INFO ] Deduced a trap composed of 48 places in 383 ms of which 1 ms to minimize.
[2024-05-24 13:09:43] [INFO ] Deduced a trap composed of 83 places in 419 ms of which 1 ms to minimize.
[2024-05-24 13:09:43] [INFO ] Deduced a trap composed of 47 places in 417 ms of which 1 ms to minimize.
[2024-05-24 13:09:44] [INFO ] Deduced a trap composed of 56 places in 401 ms of which 1 ms to minimize.
[2024-05-24 13:09:44] [INFO ] Deduced a trap composed of 17 places in 321 ms of which 1 ms to minimize.
[2024-05-24 13:09:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2402 ms
[2024-05-24 13:09:44] [INFO ] After 8815ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 383 ms.
[2024-05-24 13:09:45] [INFO ] After 10231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 136 ms.
Support contains 6 out of 656 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 656 transition count 2360
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 648 transition count 2360
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 648 transition count 2160
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 528 place count 392 transition count 2104
Applied a total of 528 rules in 203 ms. Remains 392 /656 variables (removed 264) and now considering 2104/2368 (removed 264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 392/656 places, 2104/2368 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=22 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 163323 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 163323 steps, saw 99994 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 13:09:49] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-24 13:09:49] [INFO ] Computed 25 invariants in 5 ms
[2024-05-24 13:09:49] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-05-24 13:09:49] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 13 ms returned sat
[2024-05-24 13:09:49] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 13:09:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-24 13:09:49] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-24 13:09:49] [INFO ] After 383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 13:09:49] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:09:50] [INFO ] After 260ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 13:09:50] [INFO ] Deduced a trap composed of 3 places in 226 ms of which 0 ms to minimize.
[2024-05-24 13:09:50] [INFO ] Deduced a trap composed of 3 places in 263 ms of which 1 ms to minimize.
[2024-05-24 13:09:51] [INFO ] Deduced a trap composed of 3 places in 275 ms of which 0 ms to minimize.
[2024-05-24 13:09:51] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 1 ms to minimize.
[2024-05-24 13:09:51] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 1 ms to minimize.
[2024-05-24 13:09:51] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 0 ms to minimize.
[2024-05-24 13:09:51] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 0 ms to minimize.
[2024-05-24 13:09:52] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 1 ms to minimize.
[2024-05-24 13:09:52] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-05-24 13:09:52] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 1 ms to minimize.
[2024-05-24 13:09:52] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2194 ms
[2024-05-24 13:09:52] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2024-05-24 13:09:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2024-05-24 13:09:52] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 1 ms to minimize.
[2024-05-24 13:09:52] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 1 ms to minimize.
[2024-05-24 13:09:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 331 ms
[2024-05-24 13:09:53] [INFO ] After 3079ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 212 ms.
[2024-05-24 13:09:53] [INFO ] After 3845ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 116 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 113 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-24 13:09:53] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:09:53] [INFO ] Invariant cache hit.
[2024-05-24 13:09:54] [INFO ] Implicit Places using invariants in 539 ms returned []
[2024-05-24 13:09:54] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:09:54] [INFO ] Invariant cache hit.
[2024-05-24 13:09:54] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:09:56] [INFO ] Implicit Places using invariants and state equation in 2486 ms returned []
Implicit Place search using SMT with State Equation took 3032 ms to find 0 implicit places.
[2024-05-24 13:09:56] [INFO ] Redundant transitions in 55 ms returned []
[2024-05-24 13:09:56] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:09:56] [INFO ] Invariant cache hit.
[2024-05-24 13:09:58] [INFO ] Dead Transitions using invariants and state equation in 1450 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4660 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1916 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 336 transition count 411
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 155 place count 259 transition count 411
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 155 place count 259 transition count 394
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 197 place count 234 transition count 394
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 417 place count 124 transition count 284
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 2 with 52 rules applied. Total rules applied 469 place count 124 transition count 232
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 483 place count 117 transition count 232
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 490 place count 117 transition count 225
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 499 place count 117 transition count 216
Free-agglomeration rule applied 58 times.
Iterating global reduction 4 with 58 rules applied. Total rules applied 557 place count 117 transition count 158
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 615 place count 59 transition count 158
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 623 place count 59 transition count 158
Applied a total of 623 rules in 34 ms. Remains 59 /392 variables (removed 333) and now considering 158/2104 (removed 1946) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 158 rows 59 cols
[2024-05-24 13:09:58] [INFO ] Computed 17 invariants in 1 ms
[2024-05-24 13:09:58] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-24 13:09:58] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 13:09:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2024-05-24 13:09:58] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 13:09:58] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 13:09:58] [INFO ] After 32ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 13:09:58] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-24 13:09:58] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-24 13:09:58] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-05-24 13:09:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 78 ms
[2024-05-24 13:09:58] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-24 13:09:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-05-24 13:09:58] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 35 ms.
[2024-05-24 13:09:58] [INFO ] After 341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, p1]
Stuttering acceptance computed with spot in 274 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, p1]
[2024-05-24 13:09:59] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2024-05-24 13:09:59] [INFO ] Computed 25 invariants in 4 ms
[2024-05-24 13:10:01] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2024-05-24 13:10:01] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 28 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-08-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-11 finished in 39034 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 656 transition count 2368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 656 transition count 2368
Applied a total of 14 rules in 57 ms. Remains 656 /663 variables (removed 7) and now considering 2368/2424 (removed 56) transitions.
[2024-05-24 13:10:01] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 13:10:01] [INFO ] Invariant cache hit.
[2024-05-24 13:10:02] [INFO ] Implicit Places using invariants in 1047 ms returned []
[2024-05-24 13:10:02] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 13:10:02] [INFO ] Invariant cache hit.
[2024-05-24 13:10:03] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:10:06] [INFO ] Implicit Places using invariants and state equation in 4137 ms returned []
Implicit Place search using SMT with State Equation took 5187 ms to find 0 implicit places.
[2024-05-24 13:10:06] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 13:10:06] [INFO ] Invariant cache hit.
[2024-05-24 13:10:08] [INFO ] Dead Transitions using invariants and state equation in 1606 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/663 places, 2368/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6852 ms. Remains : 656/663 places, 2368/2424 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s1 1) (NEQ s11 1) (NEQ s460 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 289 ms.
Product exploration explored 100000 steps with 0 reset in 418 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) 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 305136 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :{}
Probabilistic random walk after 305136 steps, saw 214785 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 13:10:12] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 13:10:12] [INFO ] Invariant cache hit.
[2024-05-24 13:10:12] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2024-05-24 13:10:12] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 8 ms returned sat
[2024-05-24 13:10:13] [INFO ] After 626ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:10:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 37 ms returned sat
[2024-05-24 13:10:13] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 11 ms returned sat
[2024-05-24 13:10:13] [INFO ] After 603ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 13:10:13] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:10:14] [INFO ] After 259ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 13:10:14] [INFO ] Deduced a trap composed of 6 places in 620 ms of which 1 ms to minimize.
[2024-05-24 13:10:15] [INFO ] Deduced a trap composed of 3 places in 533 ms of which 1 ms to minimize.
[2024-05-24 13:10:16] [INFO ] Deduced a trap composed of 3 places in 414 ms of which 1 ms to minimize.
[2024-05-24 13:10:16] [INFO ] Deduced a trap composed of 72 places in 412 ms of which 1 ms to minimize.
[2024-05-24 13:10:16] [INFO ] Deduced a trap composed of 3 places in 328 ms of which 1 ms to minimize.
[2024-05-24 13:10:17] [INFO ] Deduced a trap composed of 66 places in 330 ms of which 1 ms to minimize.
[2024-05-24 13:10:17] [INFO ] Deduced a trap composed of 44 places in 365 ms of which 1 ms to minimize.
[2024-05-24 13:10:18] [INFO ] Deduced a trap composed of 38 places in 376 ms of which 1 ms to minimize.
[2024-05-24 13:10:18] [INFO ] Deduced a trap composed of 32 places in 350 ms of which 1 ms to minimize.
[2024-05-24 13:10:18] [INFO ] Deduced a trap composed of 26 places in 288 ms of which 0 ms to minimize.
[2024-05-24 13:10:19] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 1 ms to minimize.
[2024-05-24 13:10:19] [INFO ] Deduced a trap composed of 20 places in 187 ms of which 1 ms to minimize.
[2024-05-24 13:10:19] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 0 ms to minimize.
[2024-05-24 13:10:19] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5540 ms
[2024-05-24 13:10:19] [INFO ] After 5895ms 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 13:10:19] [INFO ] After 6855ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 656 transition count 2360
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 648 transition count 2360
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 648 transition count 2160
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 528 place count 392 transition count 2104
Applied a total of 528 rules in 206 ms. Remains 392 /656 variables (removed 264) and now considering 2104/2368 (removed 264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 392/656 places, 2104/2368 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) 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 288900 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 288900 steps, saw 163096 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 13:10:23] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-24 13:10:23] [INFO ] Computed 25 invariants in 8 ms
[2024-05-24 13:10:23] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2024-05-24 13:10:23] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 8 ms returned sat
[2024-05-24 13:10:23] [INFO ] After 538ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:10:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2024-05-24 13:10:23] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 8 ms returned sat
[2024-05-24 13:10:24] [INFO ] After 360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 13:10:24] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:10:24] [INFO ] After 141ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 13:10:24] [INFO ] Deduced a trap composed of 3 places in 369 ms of which 2 ms to minimize.
[2024-05-24 13:10:25] [INFO ] Deduced a trap composed of 3 places in 418 ms of which 1 ms to minimize.
[2024-05-24 13:10:25] [INFO ] Deduced a trap composed of 3 places in 355 ms of which 1 ms to minimize.
[2024-05-24 13:10:26] [INFO ] Deduced a trap composed of 3 places in 351 ms of which 1 ms to minimize.
[2024-05-24 13:10:26] [INFO ] Deduced a trap composed of 27 places in 286 ms of which 2 ms to minimize.
[2024-05-24 13:10:26] [INFO ] Deduced a trap composed of 3 places in 300 ms of which 2 ms to minimize.
[2024-05-24 13:10:27] [INFO ] Deduced a trap composed of 3 places in 284 ms of which 1 ms to minimize.
[2024-05-24 13:10:27] [INFO ] Deduced a trap composed of 3 places in 269 ms of which 0 ms to minimize.
[2024-05-24 13:10:27] [INFO ] Deduced a trap composed of 47 places in 282 ms of which 1 ms to minimize.
[2024-05-24 13:10:28] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 1 ms to minimize.
[2024-05-24 13:10:28] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 1 ms to minimize.
[2024-05-24 13:10:28] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 0 ms to minimize.
[2024-05-24 13:10:28] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4130 ms
[2024-05-24 13:10:28] [INFO ] After 4346ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2024-05-24 13:10:28] [INFO ] After 4962ms 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 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 112 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 109 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-24 13:10:28] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:10:28] [INFO ] Invariant cache hit.
[2024-05-24 13:10:29] [INFO ] Implicit Places using invariants in 705 ms returned []
[2024-05-24 13:10:29] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:10:29] [INFO ] Invariant cache hit.
[2024-05-24 13:10:29] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:10:32] [INFO ] Implicit Places using invariants and state equation in 3247 ms returned []
Implicit Place search using SMT with State Equation took 3953 ms to find 0 implicit places.
[2024-05-24 13:10:32] [INFO ] Redundant transitions in 79 ms returned []
[2024-05-24 13:10:32] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:10:32] [INFO ] Invariant cache hit.
[2024-05-24 13:10:34] [INFO ] Dead Transitions using invariants and state equation in 1530 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5681 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
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 491 place count 114 transition count 228
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 27 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2024-05-24 13:10:34] [INFO ] Computed 17 invariants in 1 ms
[2024-05-24 13:10:34] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-24 13:10:34] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:10:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-24 13:10:34] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 13:10:34] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 13:10:34] [INFO ] After 10ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 13:10:34] [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 8 ms.
[2024-05-24 13:10:34] [INFO ] After 112ms 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 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0)]
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 656 transition count 2360
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 648 transition count 2360
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 648 transition count 2160
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 528 place count 392 transition count 2104
Applied a total of 528 rules in 158 ms. Remains 392 /656 variables (removed 264) and now considering 2104/2368 (removed 264) transitions.
[2024-05-24 13:10:35] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-24 13:10:35] [INFO ] Computed 25 invariants in 3 ms
[2024-05-24 13:10:35] [INFO ] Implicit Places using invariants in 844 ms returned []
[2024-05-24 13:10:35] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:10:35] [INFO ] Invariant cache hit.
[2024-05-24 13:10:36] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:10:39] [INFO ] Implicit Places using invariants and state equation in 3395 ms returned []
Implicit Place search using SMT with State Equation took 4242 ms to find 0 implicit places.
[2024-05-24 13:10:39] [INFO ] Redundant transitions in 55 ms returned []
[2024-05-24 13:10:39] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:10:39] [INFO ] Invariant cache hit.
[2024-05-24 13:10:40] [INFO ] Dead Transitions using invariants and state equation in 1256 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 392/656 places, 2104/2368 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5721 ms. Remains : 392/656 places, 2104/2368 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 148 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 57 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) 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 362493 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :{}
Probabilistic random walk after 362493 steps, saw 201176 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 13:10:43] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:10:43] [INFO ] Invariant cache hit.
[2024-05-24 13:10:44] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-05-24 13:10:44] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-24 13:10:44] [INFO ] After 352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:10:44] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-24 13:10:44] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-24 13:10:44] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 13:10:44] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:10:44] [INFO ] After 122ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 13:10:45] [INFO ] Deduced a trap composed of 3 places in 262 ms of which 1 ms to minimize.
[2024-05-24 13:10:45] [INFO ] Deduced a trap composed of 3 places in 332 ms of which 1 ms to minimize.
[2024-05-24 13:10:45] [INFO ] Deduced a trap composed of 3 places in 314 ms of which 1 ms to minimize.
[2024-05-24 13:10:46] [INFO ] Deduced a trap composed of 3 places in 346 ms of which 1 ms to minimize.
[2024-05-24 13:10:46] [INFO ] Deduced a trap composed of 27 places in 286 ms of which 1 ms to minimize.
[2024-05-24 13:10:46] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 1 ms to minimize.
[2024-05-24 13:10:47] [INFO ] Deduced a trap composed of 31 places in 237 ms of which 1 ms to minimize.
[2024-05-24 13:10:47] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 1 ms to minimize.
[2024-05-24 13:10:47] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 1 ms to minimize.
[2024-05-24 13:10:47] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 0 ms to minimize.
[2024-05-24 13:10:48] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 0 ms to minimize.
[2024-05-24 13:10:48] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3216 ms
[2024-05-24 13:10:48] [INFO ] After 3390ms 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 13:10:48] [INFO ] After 3868ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 121 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) 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 357561 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 357561 steps, saw 198582 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 13:10:51] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:10:51] [INFO ] Invariant cache hit.
[2024-05-24 13:10:51] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-05-24 13:10:51] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-24 13:10:51] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:10:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-24 13:10:51] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-24 13:10:52] [INFO ] After 383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 13:10:52] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:10:52] [INFO ] After 156ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 13:10:52] [INFO ] Deduced a trap composed of 3 places in 363 ms of which 1 ms to minimize.
[2024-05-24 13:10:53] [INFO ] Deduced a trap composed of 3 places in 301 ms of which 1 ms to minimize.
[2024-05-24 13:10:53] [INFO ] Deduced a trap composed of 3 places in 275 ms of which 1 ms to minimize.
[2024-05-24 13:10:53] [INFO ] Deduced a trap composed of 3 places in 259 ms of which 1 ms to minimize.
[2024-05-24 13:10:54] [INFO ] Deduced a trap composed of 27 places in 213 ms of which 1 ms to minimize.
[2024-05-24 13:10:54] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 1 ms to minimize.
[2024-05-24 13:10:54] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 0 ms to minimize.
[2024-05-24 13:10:54] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 0 ms to minimize.
[2024-05-24 13:10:54] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 0 ms to minimize.
[2024-05-24 13:10:55] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 0 ms to minimize.
[2024-05-24 13:10:55] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
[2024-05-24 13:10:55] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2845 ms
[2024-05-24 13:10:55] [INFO ] After 3066ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2024-05-24 13:10:55] [INFO ] After 3633ms 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 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 105 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 111 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-24 13:10:55] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:10:55] [INFO ] Invariant cache hit.
[2024-05-24 13:10:56] [INFO ] Implicit Places using invariants in 717 ms returned []
[2024-05-24 13:10:56] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:10:56] [INFO ] Invariant cache hit.
[2024-05-24 13:10:56] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:10:59] [INFO ] Implicit Places using invariants and state equation in 2780 ms returned []
Implicit Place search using SMT with State Equation took 3500 ms to find 0 implicit places.
[2024-05-24 13:10:59] [INFO ] Redundant transitions in 91 ms returned []
[2024-05-24 13:10:59] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:10:59] [INFO ] Invariant cache hit.
[2024-05-24 13:11:00] [INFO ] Dead Transitions using invariants and state equation in 1411 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5130 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 1 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
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 491 place count 114 transition count 228
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 26 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2024-05-24 13:11:00] [INFO ] Computed 17 invariants in 1 ms
[2024-05-24 13:11:00] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2024-05-24 13:11:00] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:11:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2024-05-24 13:11:00] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 13:11:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 13:11:00] [INFO ] After 10ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 13:11:00] [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 13:11:00] [INFO ] After 113ms 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 106 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 69 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 421 ms.
Product exploration explored 100000 steps with 0 reset in 430 ms.
Built C files in :
/tmp/ltsmin8529411713330990972
[2024-05-24 13:11:02] [INFO ] Too many transitions (2104) to apply POR reductions. Disabling POR matrices.
[2024-05-24 13:11:02] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8529411713330990972
Running compilation step : cd /tmp/ltsmin8529411713330990972;'/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/ltsmin8529411713330990972;'/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/ltsmin8529411713330990972;'/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 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 67 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-24 13:11:05] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-24 13:11:05] [INFO ] Computed 25 invariants in 2 ms
[2024-05-24 13:11:05] [INFO ] Implicit Places using invariants in 771 ms returned []
[2024-05-24 13:11:05] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:11:05] [INFO ] Invariant cache hit.
[2024-05-24 13:11:06] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:11:08] [INFO ] Implicit Places using invariants and state equation in 2745 ms returned []
Implicit Place search using SMT with State Equation took 3519 ms to find 0 implicit places.
[2024-05-24 13:11:08] [INFO ] Redundant transitions in 53 ms returned []
[2024-05-24 13:11:08] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:11:08] [INFO ] Invariant cache hit.
[2024-05-24 13:11:10] [INFO ] Dead Transitions using invariants and state equation in 1418 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5063 ms. Remains : 392/392 places, 2104/2104 transitions.
Built C files in :
/tmp/ltsmin9550129155841306278
[2024-05-24 13:11:10] [INFO ] Too many transitions (2104) to apply POR reductions. Disabling POR matrices.
[2024-05-24 13:11:10] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9550129155841306278
Running compilation step : cd /tmp/ltsmin9550129155841306278;'/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/ltsmin9550129155841306278;'/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/ltsmin9550129155841306278;'/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 13:11:13] [INFO ] Flatten gal took : 148 ms
[2024-05-24 13:11:13] [INFO ] Flatten gal took : 144 ms
[2024-05-24 13:11:13] [INFO ] Time to serialize gal into /tmp/LTL13343201562788299482.gal : 25 ms
[2024-05-24 13:11:13] [INFO ] Time to serialize properties into /tmp/LTL11991007115606538282.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/LTL13343201562788299482.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9285659324742951574.hoa' '-atoms' '/tmp/LTL11991007115606538282.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/LTL11991007115606538282.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9285659324742951574.hoa
Detected timeout of ITS tools.
[2024-05-24 13:11:29] [INFO ] Flatten gal took : 140 ms
[2024-05-24 13:11:29] [INFO ] Flatten gal took : 136 ms
[2024-05-24 13:11:29] [INFO ] Time to serialize gal into /tmp/LTL18094321939530802680.gal : 20 ms
[2024-05-24 13:11:29] [INFO ] Time to serialize properties into /tmp/LTL5576786691212963290.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18094321939530802680.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5576786691212963290.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("(((turn_1!=1)||(flag_1_idle!=1))||(p25_3_5!=1))"))))
Formula 0 simplified : XF!"(((turn_1!=1)||(flag_1_idle!=1))||(p25_3_5!=1))"
Detected timeout of ITS tools.
[2024-05-24 13:11:44] [INFO ] Flatten gal took : 75 ms
[2024-05-24 13:11:44] [INFO ] Applying decomposition
[2024-05-24 13:11:44] [INFO ] Flatten gal took : 79 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/graph11158473258712628907.txt' '-o' '/tmp/graph11158473258712628907.bin' '-w' '/tmp/graph11158473258712628907.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11158473258712628907.bin' '-l' '-1' '-v' '-w' '/tmp/graph11158473258712628907.weights' '-q' '0' '-e' '0.001'
[2024-05-24 13:11:44] [INFO ] Decomposing Gal with order
[2024-05-24 13:11:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 13:11:45] [INFO ] Removed a total of 4443 redundant transitions.
[2024-05-24 13:11:45] [INFO ] Flatten gal took : 546 ms
[2024-05-24 13:11:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 496 labels/synchronizations in 123 ms.
[2024-05-24 13:11:46] [INFO ] Time to serialize gal into /tmp/LTL2679904900394907962.gal : 22 ms
[2024-05-24 13:11:46] [INFO ] Time to serialize properties into /tmp/LTL13049869258266152383.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/LTL2679904900394907962.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13049869258266152383.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G("(((i4.u5.turn_1!=1)||(i3.i0.u69.flag_1_idle!=1))||(i2.u3.p25_3_5!=1))"))))
Formula 0 simplified : XF!"(((i4.u5.turn_1!=1)||(i3.i0.u69.flag_1_idle!=1))||(i2.u3.p25_3_5!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9198872318506311857
[2024-05-24 13:12:01] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9198872318506311857
Running compilation step : cd /tmp/ltsmin9198872318506311857;'/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/ltsmin9198872318506311857;'/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/ltsmin9198872318506311857;'/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-08-LTLFireability-12 finished in 122622 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(p2)||p1)))))'
Support contains 6 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 198 Pre rules applied. Total rules applied 16 place count 655 transition count 2218
Deduced a syphon composed of 198 places in 2 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 2 with 396 rules applied. Total rules applied 412 place count 457 transition count 2218
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 419 place count 450 transition count 2162
Iterating global reduction 2 with 7 rules applied. Total rules applied 426 place count 450 transition count 2162
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 538 place count 394 transition count 2106
Applied a total of 538 rules in 195 ms. Remains 394 /663 variables (removed 269) and now considering 2106/2424 (removed 318) transitions.
[2024-05-24 13:12:04] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
// Phase 1: matrix 658 rows 394 cols
[2024-05-24 13:12:04] [INFO ] Computed 25 invariants in 3 ms
[2024-05-24 13:12:05] [INFO ] Implicit Places using invariants in 957 ms returned []
[2024-05-24 13:12:05] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 13:12:05] [INFO ] Invariant cache hit.
[2024-05-24 13:12:05] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:12:07] [INFO ] Implicit Places using invariants and state equation in 2412 ms returned []
Implicit Place search using SMT with State Equation took 3373 ms to find 0 implicit places.
[2024-05-24 13:12:07] [INFO ] Redundant transitions in 55 ms returned []
[2024-05-24 13:12:07] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 13:12:07] [INFO ] Invariant cache hit.
[2024-05-24 13:12:09] [INFO ] Dead Transitions using invariants and state equation in 1687 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 394/663 places, 2106/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5319 ms. Remains : 394/663 places, 2106/2424 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s17 0) (EQ s176 0)), p0:(OR (EQ s17 0) (EQ s176 0) (EQ s164 0)), p2:(OR (EQ s7 0) (EQ s29 0) (EQ s242 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 311 ms.
Product exploration explored 100000 steps with 0 reset in 386 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 p2), (X (AND p2 p0)), (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0)))), (X (AND p1 p0)), (X (NOT (OR (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (X (AND p2 p0))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (OR (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 151 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 5) 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 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) 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 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-24 13:12:10] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 13:12:10] [INFO ] Invariant cache hit.
[2024-05-24 13:12:11] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 13:12:11] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2024-05-24 13:12:11] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 9 ms returned sat
[2024-05-24 13:12:11] [INFO ] After 512ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 13:12:11] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:12:12] [INFO ] After 305ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 13:12:12] [INFO ] Deduced a trap composed of 3 places in 518 ms of which 1 ms to minimize.
[2024-05-24 13:12:13] [INFO ] Deduced a trap composed of 3 places in 304 ms of which 1 ms to minimize.
[2024-05-24 13:12:13] [INFO ] Deduced a trap composed of 3 places in 327 ms of which 1 ms to minimize.
[2024-05-24 13:12:13] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 0 ms to minimize.
[2024-05-24 13:12:14] [INFO ] Deduced a trap composed of 3 places in 251 ms of which 1 ms to minimize.
[2024-05-24 13:12:14] [INFO ] Deduced a trap composed of 3 places in 201 ms of which 1 ms to minimize.
[2024-05-24 13:12:14] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 1 ms to minimize.
[2024-05-24 13:12:14] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 1 ms to minimize.
[2024-05-24 13:12:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2528 ms
[2024-05-24 13:12:14] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2024-05-24 13:12:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2024-05-24 13:12:15] [INFO ] After 3190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 160 ms.
[2024-05-24 13:12:15] [INFO ] After 4088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 6 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 69 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 394/394 places, 2106/2106 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) 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 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 183303 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 183303 steps, saw 109662 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 13:12:18] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 13:12:18] [INFO ] Invariant cache hit.
[2024-05-24 13:12:18] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 13:12:18] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-24 13:12:18] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-24 13:12:19] [INFO ] After 472ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 13:12:19] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:12:19] [INFO ] After 297ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 13:12:20] [INFO ] Deduced a trap composed of 3 places in 378 ms of which 1 ms to minimize.
[2024-05-24 13:12:20] [INFO ] Deduced a trap composed of 3 places in 427 ms of which 2 ms to minimize.
[2024-05-24 13:12:20] [INFO ] Deduced a trap composed of 3 places in 286 ms of which 1 ms to minimize.
[2024-05-24 13:12:21] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 1 ms to minimize.
[2024-05-24 13:12:21] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 1 ms to minimize.
[2024-05-24 13:12:21] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 0 ms to minimize.
[2024-05-24 13:12:21] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-05-24 13:12:21] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 1 ms to minimize.
[2024-05-24 13:12:21] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2246 ms
[2024-05-24 13:12:22] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2024-05-24 13:12:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2024-05-24 13:12:22] [INFO ] After 2846ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 141 ms.
[2024-05-24 13:12:22] [INFO ] After 3618ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 107 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 394/394 places, 2106/2106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 107 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2024-05-24 13:12:22] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 13:12:22] [INFO ] Invariant cache hit.
[2024-05-24 13:12:23] [INFO ] Implicit Places using invariants in 843 ms returned []
[2024-05-24 13:12:23] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 13:12:23] [INFO ] Invariant cache hit.
[2024-05-24 13:12:23] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:12:25] [INFO ] Implicit Places using invariants and state equation in 2446 ms returned []
Implicit Place search using SMT with State Equation took 3291 ms to find 0 implicit places.
[2024-05-24 13:12:25] [INFO ] Redundant transitions in 57 ms returned []
[2024-05-24 13:12:25] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 13:12:25] [INFO ] Invariant cache hit.
[2024-05-24 13:12:27] [INFO ] Dead Transitions using invariants and state equation in 1523 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4985 ms. Remains : 394/394 places, 2106/2106 transitions.
Graph (trivial) has 1934 edges and 394 vertex of which 64 / 394 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 338 transition count 413
Reduce places removed 77 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 78 rules applied. Total rules applied 156 place count 261 transition count 412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 157 place count 260 transition count 412
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 157 place count 260 transition count 395
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 199 place count 235 transition count 395
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 417 place count 126 transition count 286
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 3 with 54 rules applied. Total rules applied 471 place count 126 transition count 232
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 4 with 16 rules applied. Total rules applied 487 place count 118 transition count 232
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 495 place count 118 transition count 224
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 503 place count 118 transition count 216
Free-agglomeration rule applied 55 times.
Iterating global reduction 5 with 55 rules applied. Total rules applied 558 place count 118 transition count 161
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 5 with 55 rules applied. Total rules applied 613 place count 63 transition count 161
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 620 place count 63 transition count 161
Applied a total of 620 rules in 24 ms. Remains 63 /394 variables (removed 331) and now considering 161/2106 (removed 1945) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 161 rows 63 cols
[2024-05-24 13:12:27] [INFO ] Computed 17 invariants in 0 ms
[2024-05-24 13:12:27] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 13:12:27] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2024-05-24 13:12:27] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 13:12:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 13:12:27] [INFO ] After 33ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 13:12:27] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-24 13:12:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-24 13:12:27] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-24 13:12:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-05-24 13:12:27] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-24 13:12:27] [INFO ] After 314ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p0 p2), (X (AND p2 p0)), (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0)))), (X (AND p1 p0)), (X (NOT (OR (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (X (AND p2 p0))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (OR (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 p2 (NOT p1)))]
Knowledge based reduction with 11 factoid took 279 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 6 out of 394 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 102 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2024-05-24 13:12:28] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
// Phase 1: matrix 658 rows 394 cols
[2024-05-24 13:12:28] [INFO ] Computed 25 invariants in 3 ms
[2024-05-24 13:12:29] [INFO ] Implicit Places using invariants in 903 ms returned []
[2024-05-24 13:12:29] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 13:12:29] [INFO ] Invariant cache hit.
[2024-05-24 13:12:29] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:12:32] [INFO ] Implicit Places using invariants and state equation in 2702 ms returned []
Implicit Place search using SMT with State Equation took 3608 ms to find 0 implicit places.
[2024-05-24 13:12:32] [INFO ] Redundant transitions in 85 ms returned []
[2024-05-24 13:12:32] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 13:12:32] [INFO ] Invariant cache hit.
[2024-05-24 13:12:33] [INFO ] Dead Transitions using invariants and state equation in 1618 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5423 ms. Remains : 394/394 places, 2106/2106 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 (AND p0 p1)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT (OR (NOT p0) (AND (NOT p2) (NOT p1))))), (X (AND p0 p2)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 179 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 5) 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 5) seen :2
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 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 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-24 13:12:34] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 13:12:34] [INFO ] Invariant cache hit.
[2024-05-24 13:12:34] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 13:12:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2024-05-24 13:12:34] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 7 ms returned sat
[2024-05-24 13:12:35] [INFO ] After 467ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 13:12:35] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:12:35] [INFO ] After 281ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 13:12:36] [INFO ] Deduced a trap composed of 3 places in 415 ms of which 1 ms to minimize.
[2024-05-24 13:12:36] [INFO ] Deduced a trap composed of 3 places in 391 ms of which 1 ms to minimize.
[2024-05-24 13:12:36] [INFO ] Deduced a trap composed of 3 places in 317 ms of which 1 ms to minimize.
[2024-05-24 13:12:37] [INFO ] Deduced a trap composed of 3 places in 251 ms of which 1 ms to minimize.
[2024-05-24 13:12:37] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 0 ms to minimize.
[2024-05-24 13:12:37] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 0 ms to minimize.
[2024-05-24 13:12:37] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-24 13:12:37] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 0 ms to minimize.
[2024-05-24 13:12:37] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2279 ms
[2024-05-24 13:12:38] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-24 13:12:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2024-05-24 13:12:38] [INFO ] After 2940ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 224 ms.
[2024-05-24 13:12:38] [INFO ] After 3823ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 18 ms.
Support contains 6 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 106 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 394/394 places, 2106/2106 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 340 ms. (steps per millisecond=29 ) 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 29 ms. (steps per millisecond=344 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 192519 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 192519 steps, saw 114983 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 13:12:42] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 13:12:42] [INFO ] Invariant cache hit.
[2024-05-24 13:12:42] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 13:12:42] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-24 13:12:42] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-24 13:12:42] [INFO ] After 432ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 13:12:42] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:12:43] [INFO ] After 279ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 13:12:43] [INFO ] Deduced a trap composed of 3 places in 467 ms of which 1 ms to minimize.
[2024-05-24 13:12:43] [INFO ] Deduced a trap composed of 3 places in 334 ms of which 1 ms to minimize.
[2024-05-24 13:12:44] [INFO ] Deduced a trap composed of 3 places in 308 ms of which 0 ms to minimize.
[2024-05-24 13:12:44] [INFO ] Deduced a trap composed of 3 places in 236 ms of which 0 ms to minimize.
[2024-05-24 13:12:44] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 0 ms to minimize.
[2024-05-24 13:12:44] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 1 ms to minimize.
[2024-05-24 13:12:45] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-24 13:12:45] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 1 ms to minimize.
[2024-05-24 13:12:45] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2224 ms
[2024-05-24 13:12:45] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2024-05-24 13:12:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2024-05-24 13:12:45] [INFO ] After 2870ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 217 ms.
[2024-05-24 13:12:45] [INFO ] After 3666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 19 ms.
Support contains 6 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 108 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 394/394 places, 2106/2106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 107 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2024-05-24 13:12:46] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 13:12:46] [INFO ] Invariant cache hit.
[2024-05-24 13:12:46] [INFO ] Implicit Places using invariants in 826 ms returned []
[2024-05-24 13:12:46] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 13:12:46] [INFO ] Invariant cache hit.
[2024-05-24 13:12:47] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:12:49] [INFO ] Implicit Places using invariants and state equation in 2972 ms returned []
Implicit Place search using SMT with State Equation took 3800 ms to find 0 implicit places.
[2024-05-24 13:12:49] [INFO ] Redundant transitions in 79 ms returned []
[2024-05-24 13:12:49] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 13:12:49] [INFO ] Invariant cache hit.
[2024-05-24 13:12:51] [INFO ] Dead Transitions using invariants and state equation in 1543 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5543 ms. Remains : 394/394 places, 2106/2106 transitions.
Graph (trivial) has 1934 edges and 394 vertex of which 64 / 394 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 338 transition count 413
Reduce places removed 77 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 78 rules applied. Total rules applied 156 place count 261 transition count 412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 157 place count 260 transition count 412
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 157 place count 260 transition count 395
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 199 place count 235 transition count 395
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 417 place count 126 transition count 286
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 3 with 54 rules applied. Total rules applied 471 place count 126 transition count 232
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 4 with 16 rules applied. Total rules applied 487 place count 118 transition count 232
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 495 place count 118 transition count 224
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 503 place count 118 transition count 216
Free-agglomeration rule applied 55 times.
Iterating global reduction 5 with 55 rules applied. Total rules applied 558 place count 118 transition count 161
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 5 with 55 rules applied. Total rules applied 613 place count 63 transition count 161
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 620 place count 63 transition count 161
Applied a total of 620 rules in 23 ms. Remains 63 /394 variables (removed 331) and now considering 161/2106 (removed 1945) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 161 rows 63 cols
[2024-05-24 13:12:51] [INFO ] Computed 17 invariants in 0 ms
[2024-05-24 13:12:51] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 13:12:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2024-05-24 13:12:51] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 13:12:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 13:12:51] [INFO ] After 33ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 13:12:51] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-24 13:12:51] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2024-05-24 13:12:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 54 ms
[2024-05-24 13:12:51] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-24 13:12:51] [INFO ] After 268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT (OR (NOT p0) (AND (NOT p2) (NOT p1))))), (X (AND p0 p2)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 p2)))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 11 factoid took 271 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 0 reset in 288 ms.
Product exploration explored 100000 steps with 0 reset in 326 ms.
Built C files in :
/tmp/ltsmin12829584325559420186
[2024-05-24 13:12:53] [INFO ] Too many transitions (2106) to apply POR reductions. Disabling POR matrices.
[2024-05-24 13:12:53] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12829584325559420186
Running compilation step : cd /tmp/ltsmin12829584325559420186;'/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/ltsmin12829584325559420186;'/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/ltsmin12829584325559420186;'/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 394 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 70 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2024-05-24 13:12:56] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
// Phase 1: matrix 658 rows 394 cols
[2024-05-24 13:12:56] [INFO ] Computed 25 invariants in 2 ms
[2024-05-24 13:12:56] [INFO ] Implicit Places using invariants in 667 ms returned []
[2024-05-24 13:12:56] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 13:12:56] [INFO ] Invariant cache hit.
[2024-05-24 13:12:57] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:12:59] [INFO ] Implicit Places using invariants and state equation in 2507 ms returned []
Implicit Place search using SMT with State Equation took 3181 ms to find 0 implicit places.
[2024-05-24 13:12:59] [INFO ] Redundant transitions in 79 ms returned []
[2024-05-24 13:12:59] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 13:12:59] [INFO ] Invariant cache hit.
[2024-05-24 13:13:01] [INFO ] Dead Transitions using invariants and state equation in 1777 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5115 ms. Remains : 394/394 places, 2106/2106 transitions.
Built C files in :
/tmp/ltsmin348964015903651774
[2024-05-24 13:13:01] [INFO ] Too many transitions (2106) to apply POR reductions. Disabling POR matrices.
[2024-05-24 13:13:01] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin348964015903651774
Running compilation step : cd /tmp/ltsmin348964015903651774;'/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/ltsmin348964015903651774;'/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/ltsmin348964015903651774;'/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 13:13:04] [INFO ] Flatten gal took : 73 ms
[2024-05-24 13:13:04] [INFO ] Flatten gal took : 59 ms
[2024-05-24 13:13:04] [INFO ] Time to serialize gal into /tmp/LTL11037954655281793499.gal : 11 ms
[2024-05-24 13:13:04] [INFO ] Time to serialize properties into /tmp/LTL2551351319458486466.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/LTL11037954655281793499.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3232417862243597757.hoa' '-atoms' '/tmp/LTL2551351319458486466.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/LTL2551351319458486466.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3232417862243597757.hoa
Detected timeout of ITS tools.
[2024-05-24 13:13:19] [INFO ] Flatten gal took : 53 ms
[2024-05-24 13:13:19] [INFO ] Flatten gal took : 58 ms
[2024-05-24 13:13:19] [INFO ] Time to serialize gal into /tmp/LTL906829812558766938.gal : 18 ms
[2024-05-24 13:13:19] [INFO ] Time to serialize properties into /tmp/LTL3641535154286140978.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/LTL906829812558766938.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3641535154286140978.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 : !((F(G(("(((flag_3_idle==0)||(p18_0_3==0))||(p34_7_3==0))")&&(("((flag_3_idle==0)||(p18_0_3==0))")||(G("(((turn_7==0)||(flag_7_idle==0...180
Formula 0 simplified : GF(!"(((flag_3_idle==0)||(p18_0_3==0))||(p34_7_3==0))" | (!"((flag_3_idle==0)||(p18_0_3==0))" & F!"(((turn_7==0)||(flag_7_idle==0))|...172
Detected timeout of ITS tools.
[2024-05-24 13:13:34] [INFO ] Flatten gal took : 52 ms
[2024-05-24 13:13:34] [INFO ] Applying decomposition
[2024-05-24 13:13:34] [INFO ] Flatten gal took : 60 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/graph17355742308342062580.txt' '-o' '/tmp/graph17355742308342062580.bin' '-w' '/tmp/graph17355742308342062580.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17355742308342062580.bin' '-l' '-1' '-v' '-w' '/tmp/graph17355742308342062580.weights' '-q' '0' '-e' '0.001'
[2024-05-24 13:13:35] [INFO ] Decomposing Gal with order
[2024-05-24 13:13:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 13:13:35] [INFO ] Removed a total of 4462 redundant transitions.
[2024-05-24 13:13:35] [INFO ] Flatten gal took : 308 ms
[2024-05-24 13:13:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 452 labels/synchronizations in 108 ms.
[2024-05-24 13:13:35] [INFO ] Time to serialize gal into /tmp/LTL13726990086557614749.gal : 23 ms
[2024-05-24 13:13:35] [INFO ] Time to serialize properties into /tmp/LTL17426593076929899897.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/LTL13726990086557614749.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17426593076929899897.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 : !((F(G(("(((i9.u26.flag_3_idle==0)||(i8.u0.p18_0_3==0))||(i9.u63.p34_7_3==0))")&&(("((i9.u26.flag_3_idle==0)||(i8.u0.p18_0_3==0))")||(...231
Formula 0 simplified : GF(!"(((i9.u26.flag_3_idle==0)||(i8.u0.p18_0_3==0))||(i9.u63.p34_7_3==0))" | (!"((i9.u26.flag_3_idle==0)||(i8.u0.p18_0_3==0))" & F!"...223
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2239556811906830128
[2024-05-24 13:13:50] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2239556811906830128
Running compilation step : cd /tmp/ltsmin2239556811906830128;'/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/ltsmin2239556811906830128;'/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/ltsmin2239556811906830128;'/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-08-LTLFireability-13 finished in 109714 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(F(p1)))||p0))))'
Support contains 5 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 422 place count 449 transition count 2168
Iterating global reduction 2 with 6 rules applied. Total rules applied 428 place count 449 transition count 2168
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 540 place count 393 transition count 2112
Applied a total of 540 rules in 179 ms. Remains 393 /663 variables (removed 270) and now considering 2112/2424 (removed 312) transitions.
[2024-05-24 13:13:54] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
// Phase 1: matrix 664 rows 393 cols
[2024-05-24 13:13:54] [INFO ] Computed 25 invariants in 3 ms
[2024-05-24 13:13:54] [INFO ] Implicit Places using invariants in 861 ms returned []
[2024-05-24 13:13:54] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 13:13:54] [INFO ] Invariant cache hit.
[2024-05-24 13:13:55] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-24 13:13:57] [INFO ] Implicit Places using invariants and state equation in 2731 ms returned []
Implicit Place search using SMT with State Equation took 3596 ms to find 0 implicit places.
[2024-05-24 13:13:57] [INFO ] Redundant transitions in 92 ms returned []
[2024-05-24 13:13:57] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 13:13:57] [INFO ] Invariant cache hit.
[2024-05-24 13:13:59] [INFO ] Dead Transitions using invariants and state equation in 1469 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 393/663 places, 2112/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5352 ms. Remains : 393/663 places, 2112/2424 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s6 0) (EQ s112 0)), p1:(AND (EQ s2 1) (EQ s16 1) (EQ s262 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 294 ms.
Product exploration explored 100000 steps with 0 reset in 350 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 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 131 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 218286 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 218286 steps, saw 127414 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 13:14:03] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 13:14:03] [INFO ] Invariant cache hit.
[2024-05-24 13:14:03] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 13:14:03] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-24 13:14:03] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-24 13:14:03] [INFO ] After 291ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 13:14:03] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-24 13:14:04] [INFO ] After 171ms SMT Verify possible using 291 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 13:14:04] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 1 ms to minimize.
[2024-05-24 13:14:04] [INFO ] Deduced a trap composed of 3 places in 255 ms of which 1 ms to minimize.
[2024-05-24 13:14:04] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 1 ms to minimize.
[2024-05-24 13:14:05] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2024-05-24 13:14:05] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 1 ms to minimize.
[2024-05-24 13:14:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1097 ms
[2024-05-24 13:14:05] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 0 ms to minimize.
[2024-05-24 13:14:05] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 1 ms to minimize.
[2024-05-24 13:14:05] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 0 ms to minimize.
[2024-05-24 13:14:06] [INFO ] Deduced a trap composed of 46 places in 195 ms of which 1 ms to minimize.
[2024-05-24 13:14:06] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 1 ms to minimize.
[2024-05-24 13:14:06] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2024-05-24 13:14:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1248 ms
[2024-05-24 13:14:06] [INFO ] After 2613ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 134 ms.
[2024-05-24 13:14:06] [INFO ] After 3158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 107 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 393/393 places, 2112/2112 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 217872 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 217872 steps, saw 127113 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 13:14:10] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 13:14:10] [INFO ] Invariant cache hit.
[2024-05-24 13:14:10] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 13:14:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-24 13:14:10] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-24 13:14:10] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 13:14:10] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-24 13:14:10] [INFO ] After 267ms SMT Verify possible using 291 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 13:14:11] [INFO ] Deduced a trap composed of 3 places in 294 ms of which 1 ms to minimize.
[2024-05-24 13:14:11] [INFO ] Deduced a trap composed of 3 places in 245 ms of which 1 ms to minimize.
[2024-05-24 13:14:11] [INFO ] Deduced a trap composed of 30 places in 177 ms of which 1 ms to minimize.
[2024-05-24 13:14:12] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2024-05-24 13:14:12] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 0 ms to minimize.
[2024-05-24 13:14:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1196 ms
[2024-05-24 13:14:12] [INFO ] Deduced a trap composed of 7 places in 220 ms of which 0 ms to minimize.
[2024-05-24 13:14:12] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 1 ms to minimize.
[2024-05-24 13:14:12] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 1 ms to minimize.
[2024-05-24 13:14:13] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 0 ms to minimize.
[2024-05-24 13:14:13] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 0 ms to minimize.
[2024-05-24 13:14:13] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2024-05-24 13:14:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1175 ms
[2024-05-24 13:14:13] [INFO ] After 2766ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 178 ms.
[2024-05-24 13:14:13] [INFO ] After 3457ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 112 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 393/393 places, 2112/2112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 110 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
[2024-05-24 13:14:13] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 13:14:13] [INFO ] Invariant cache hit.
[2024-05-24 13:14:14] [INFO ] Implicit Places using invariants in 893 ms returned []
[2024-05-24 13:14:14] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 13:14:14] [INFO ] Invariant cache hit.
[2024-05-24 13:14:15] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-24 13:14:18] [INFO ] Implicit Places using invariants and state equation in 3257 ms returned []
Implicit Place search using SMT with State Equation took 4150 ms to find 0 implicit places.
[2024-05-24 13:14:18] [INFO ] Redundant transitions in 81 ms returned []
[2024-05-24 13:14:18] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 13:14:18] [INFO ] Invariant cache hit.
[2024-05-24 13:14:19] [INFO ] Dead Transitions using invariants and state equation in 1710 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6058 ms. Remains : 393/393 places, 2112/2112 transitions.
Graph (trivial) has 1936 edges and 393 vertex of which 64 / 393 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions removed 214 transitions
Ensure Unique test removed 1407 transitions
Reduce isomorphic transitions removed 1621 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 337 transition count 413
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 259 transition count 413
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 157 place count 259 transition count 397
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 196 place count 236 transition count 397
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 420 place count 124 transition count 285
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 2 with 55 rules applied. Total rules applied 475 place count 124 transition count 230
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 485 place count 119 transition count 230
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 490 place count 119 transition count 225
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 497 place count 119 transition count 218
Free-agglomeration rule applied 58 times.
Iterating global reduction 4 with 58 rules applied. Total rules applied 555 place count 119 transition count 160
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 613 place count 61 transition count 160
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 621 place count 61 transition count 160
Applied a total of 621 rules in 33 ms. Remains 61 /393 variables (removed 332) and now considering 160/2112 (removed 1952) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 160 rows 61 cols
[2024-05-24 13:14:19] [INFO ] Computed 18 invariants in 1 ms
[2024-05-24 13:14:19] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 13:14:19] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2024-05-24 13:14:19] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 13:14:20] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 13:14:20] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 13:14:20] [INFO ] After 22ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 13:14:20] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-24 13:14:20] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-24 13:14:20] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2024-05-24 13:14:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 73 ms
[2024-05-24 13:14:20] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-24 13:14:20] [INFO ] After 253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 82 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 111 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
[2024-05-24 13:14:20] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
// Phase 1: matrix 664 rows 393 cols
[2024-05-24 13:14:20] [INFO ] Computed 25 invariants in 3 ms
[2024-05-24 13:14:21] [INFO ] Implicit Places using invariants in 884 ms returned []
[2024-05-24 13:14:21] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 13:14:21] [INFO ] Invariant cache hit.
[2024-05-24 13:14:21] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-24 13:14:24] [INFO ] Implicit Places using invariants and state equation in 3371 ms returned []
Implicit Place search using SMT with State Equation took 4257 ms to find 0 implicit places.
[2024-05-24 13:14:24] [INFO ] Redundant transitions in 86 ms returned []
[2024-05-24 13:14:24] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 13:14:24] [INFO ] Invariant cache hit.
[2024-05-24 13:14:26] [INFO ] Dead Transitions using invariants and state equation in 1684 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6148 ms. Remains : 393/393 places, 2112/2112 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 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 218592 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 218592 steps, saw 127616 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 13:14:29] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 13:14:29] [INFO ] Invariant cache hit.
[2024-05-24 13:14:30] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 13:14:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2024-05-24 13:14:30] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 8 ms returned sat
[2024-05-24 13:14:30] [INFO ] After 440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 13:14:30] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-24 13:14:30] [INFO ] After 278ms SMT Verify possible using 291 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 13:14:31] [INFO ] Deduced a trap composed of 3 places in 283 ms of which 1 ms to minimize.
[2024-05-24 13:14:31] [INFO ] Deduced a trap composed of 3 places in 247 ms of which 0 ms to minimize.
[2024-05-24 13:14:31] [INFO ] Deduced a trap composed of 30 places in 193 ms of which 1 ms to minimize.
[2024-05-24 13:14:31] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 2 ms to minimize.
[2024-05-24 13:14:32] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 4 ms to minimize.
[2024-05-24 13:14:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1254 ms
[2024-05-24 13:14:32] [INFO ] Deduced a trap composed of 7 places in 239 ms of which 2 ms to minimize.
[2024-05-24 13:14:32] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 0 ms to minimize.
[2024-05-24 13:14:32] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 0 ms to minimize.
[2024-05-24 13:14:33] [INFO ] Deduced a trap composed of 46 places in 187 ms of which 0 ms to minimize.
[2024-05-24 13:14:33] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 0 ms to minimize.
[2024-05-24 13:14:33] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-24 13:14:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1325 ms
[2024-05-24 13:14:33] [INFO ] After 2991ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 193 ms.
[2024-05-24 13:14:33] [INFO ] After 3810ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 111 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 393/393 places, 2112/2112 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 181656 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 181656 steps, saw 108412 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 13:14:37] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 13:14:37] [INFO ] Invariant cache hit.
[2024-05-24 13:14:37] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 13:14:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-05-24 13:14:37] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 7 ms returned sat
[2024-05-24 13:14:37] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 13:14:37] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-24 13:14:37] [INFO ] After 229ms SMT Verify possible using 291 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 13:14:38] [INFO ] Deduced a trap composed of 3 places in 231 ms of which 0 ms to minimize.
[2024-05-24 13:14:38] [INFO ] Deduced a trap composed of 3 places in 252 ms of which 0 ms to minimize.
[2024-05-24 13:14:38] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 0 ms to minimize.
[2024-05-24 13:14:39] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 1 ms to minimize.
[2024-05-24 13:14:39] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 0 ms to minimize.
[2024-05-24 13:14:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1210 ms
[2024-05-24 13:14:39] [INFO ] Deduced a trap composed of 7 places in 245 ms of which 1 ms to minimize.
[2024-05-24 13:14:39] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 1 ms to minimize.
[2024-05-24 13:14:40] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 1 ms to minimize.
[2024-05-24 13:14:40] [INFO ] Deduced a trap composed of 46 places in 205 ms of which 2 ms to minimize.
[2024-05-24 13:14:40] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 1 ms to minimize.
[2024-05-24 13:14:40] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-05-24 13:14:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1342 ms
[2024-05-24 13:14:40] [INFO ] After 2915ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 194 ms.
[2024-05-24 13:14:40] [INFO ] After 3589ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 106 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 393/393 places, 2112/2112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 106 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
[2024-05-24 13:14:41] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 13:14:41] [INFO ] Invariant cache hit.
[2024-05-24 13:14:42] [INFO ] Implicit Places using invariants in 941 ms returned []
[2024-05-24 13:14:42] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 13:14:42] [INFO ] Invariant cache hit.
[2024-05-24 13:14:42] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-24 13:14:45] [INFO ] Implicit Places using invariants and state equation in 3332 ms returned []
Implicit Place search using SMT with State Equation took 4275 ms to find 0 implicit places.
[2024-05-24 13:14:45] [INFO ] Redundant transitions in 74 ms returned []
[2024-05-24 13:14:45] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 13:14:45] [INFO ] Invariant cache hit.
[2024-05-24 13:14:47] [INFO ] Dead Transitions using invariants and state equation in 1588 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6052 ms. Remains : 393/393 places, 2112/2112 transitions.
Graph (trivial) has 1936 edges and 393 vertex of which 64 / 393 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions removed 214 transitions
Ensure Unique test removed 1407 transitions
Reduce isomorphic transitions removed 1621 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 337 transition count 413
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 259 transition count 413
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 157 place count 259 transition count 397
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 196 place count 236 transition count 397
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 420 place count 124 transition count 285
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 2 with 55 rules applied. Total rules applied 475 place count 124 transition count 230
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 485 place count 119 transition count 230
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 490 place count 119 transition count 225
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 497 place count 119 transition count 218
Free-agglomeration rule applied 58 times.
Iterating global reduction 4 with 58 rules applied. Total rules applied 555 place count 119 transition count 160
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 613 place count 61 transition count 160
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 621 place count 61 transition count 160
Applied a total of 621 rules in 23 ms. Remains 61 /393 variables (removed 332) and now considering 160/2112 (removed 1952) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 160 rows 61 cols
[2024-05-24 13:14:47] [INFO ] Computed 18 invariants in 1 ms
[2024-05-24 13:14:47] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 13:14:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2024-05-24 13:14:47] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 13:14:47] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 13:14:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 13:14:47] [INFO ] After 24ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 13:14:47] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-24 13:14:47] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-24 13:14:47] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2024-05-24 13:14:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 73 ms
[2024-05-24 13:14:47] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-24 13:14:47] [INFO ] After 249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 131 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 408 ms.
Product exploration explored 100000 steps with 0 reset in 351 ms.
Built C files in :
/tmp/ltsmin9980434551444077527
[2024-05-24 13:14:48] [INFO ] Too many transitions (2112) to apply POR reductions. Disabling POR matrices.
[2024-05-24 13:14:48] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9980434551444077527
Running compilation step : cd /tmp/ltsmin9980434551444077527;'/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/ltsmin9980434551444077527;'/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/ltsmin9980434551444077527;'/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 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 69 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
[2024-05-24 13:14:51] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
// Phase 1: matrix 664 rows 393 cols
[2024-05-24 13:14:51] [INFO ] Computed 25 invariants in 2 ms
[2024-05-24 13:14:52] [INFO ] Implicit Places using invariants in 826 ms returned []
[2024-05-24 13:14:52] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 13:14:52] [INFO ] Invariant cache hit.
[2024-05-24 13:14:53] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-24 13:14:56] [INFO ] Implicit Places using invariants and state equation in 3613 ms returned []
Implicit Place search using SMT with State Equation took 4441 ms to find 0 implicit places.
[2024-05-24 13:14:56] [INFO ] Redundant transitions in 91 ms returned []
[2024-05-24 13:14:56] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 13:14:56] [INFO ] Invariant cache hit.
[2024-05-24 13:14:57] [INFO ] Dead Transitions using invariants and state equation in 1500 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6110 ms. Remains : 393/393 places, 2112/2112 transitions.
Built C files in :
/tmp/ltsmin13495736189438836174
[2024-05-24 13:14:57] [INFO ] Too many transitions (2112) to apply POR reductions. Disabling POR matrices.
[2024-05-24 13:14:57] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13495736189438836174
Running compilation step : cd /tmp/ltsmin13495736189438836174;'/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/ltsmin13495736189438836174;'/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/ltsmin13495736189438836174;'/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 13:15:00] [INFO ] Flatten gal took : 78 ms
[2024-05-24 13:15:01] [INFO ] Flatten gal took : 90 ms
[2024-05-24 13:15:01] [INFO ] Time to serialize gal into /tmp/LTL1150563876793791294.gal : 14 ms
[2024-05-24 13:15:01] [INFO ] Time to serialize properties into /tmp/LTL12430034575804691719.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/LTL1150563876793791294.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2258521980545910483.hoa' '-atoms' '/tmp/LTL12430034575804691719.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/LTL12430034575804691719.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2258521980545910483.hoa
Detected timeout of ITS tools.
[2024-05-24 13:15:16] [INFO ] Flatten gal took : 57 ms
[2024-05-24 13:15:16] [INFO ] Flatten gal took : 61 ms
[2024-05-24 13:15:16] [INFO ] Time to serialize gal into /tmp/LTL10967522547558292318.gal : 14 ms
[2024-05-24 13:15:16] [INFO ] Time to serialize properties into /tmp/LTL15526093461083207679.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/LTL10967522547558292318.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15526093461083207679.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_6==0)||(p10_5_0==0))")||(X(X(F("(((turn_2==1)&&(flag_2_active==1))&&(p25_3_0==1))"))))))))
Formula 0 simplified : G(F!"((turn_6==0)||(p10_5_0==0))" & FG!"(((turn_2==1)&&(flag_2_active==1))&&(p25_3_0==1))")
Detected timeout of ITS tools.
[2024-05-24 13:15:31] [INFO ] Flatten gal took : 57 ms
[2024-05-24 13:15:31] [INFO ] Applying decomposition
[2024-05-24 13:15:31] [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/graph11296313430519177156.txt' '-o' '/tmp/graph11296313430519177156.bin' '-w' '/tmp/graph11296313430519177156.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11296313430519177156.bin' '-l' '-1' '-v' '-w' '/tmp/graph11296313430519177156.weights' '-q' '0' '-e' '0.001'
[2024-05-24 13:15:31] [INFO ] Decomposing Gal with order
[2024-05-24 13:15:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 13:15:31] [INFO ] Removed a total of 4396 redundant transitions.
[2024-05-24 13:15:31] [INFO ] Flatten gal took : 246 ms
[2024-05-24 13:15:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 591 labels/synchronizations in 97 ms.
[2024-05-24 13:15:32] [INFO ] Time to serialize gal into /tmp/LTL18327789393664492009.gal : 13 ms
[2024-05-24 13:15:32] [INFO ] Time to serialize properties into /tmp/LTL13531548503983074132.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/LTL18327789393664492009.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13531548503983074132.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 : !((F(G(("((i1.u1.turn_6==0)||(i12.u11.p10_5_0==0))")||(X(X(F("(((i1.u1.turn_2==1)&&(i4.u5.flag_2_active==1))&&(i3.u4.p25_3_0==1))"))))...159
Formula 0 simplified : G(F!"((i1.u1.turn_6==0)||(i12.u11.p10_5_0==0))" & FG!"(((i1.u1.turn_2==1)&&(i4.u5.flag_2_active==1))&&(i3.u4.p25_3_0==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin262830006350069077
[2024-05-24 13:15:47] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin262830006350069077
Running compilation step : cd /tmp/ltsmin262830006350069077;'/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/ltsmin262830006350069077;'/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/ltsmin262830006350069077;'/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-08-LTLFireability-14 finished in 116413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-08-LTLFireability-12
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 663 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 423 place count 448 transition count 2160
Iterating global reduction 2 with 7 rules applied. Total rules applied 430 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 542 place count 392 transition count 2104
Applied a total of 542 rules in 103 ms. Remains 392 /663 variables (removed 271) and now considering 2104/2424 (removed 320) transitions.
[2024-05-24 13:15:50] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-24 13:15:50] [INFO ] Computed 25 invariants in 2 ms
[2024-05-24 13:15:51] [INFO ] Implicit Places using invariants in 690 ms returned []
[2024-05-24 13:15:51] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:15:51] [INFO ] Invariant cache hit.
[2024-05-24 13:15:51] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:15:54] [INFO ] Implicit Places using invariants and state equation in 2705 ms returned []
Implicit Place search using SMT with State Equation took 3400 ms to find 0 implicit places.
[2024-05-24 13:15:54] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:15:54] [INFO ] Invariant cache hit.
[2024-05-24 13:15:55] [INFO ] Dead Transitions using invariants and state equation in 1878 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 392/663 places, 2104/2424 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5383 ms. Remains : 392/663 places, 2104/2424 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s1 1) (NEQ s11 1) (NEQ s265 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 259 ms.
Product exploration explored 100000 steps with 0 reset in 303 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) 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 393381 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 393381 steps, saw 216046 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 13:15:59] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:15:59] [INFO ] Invariant cache hit.
[2024-05-24 13:15:59] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-05-24 13:15:59] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-24 13:16:00] [INFO ] After 440ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:16:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2024-05-24 13:16:00] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 8 ms returned sat
[2024-05-24 13:16:00] [INFO ] After 393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 13:16:00] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:16:00] [INFO ] After 195ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 13:16:01] [INFO ] Deduced a trap composed of 3 places in 405 ms of which 1 ms to minimize.
[2024-05-24 13:16:01] [INFO ] Deduced a trap composed of 3 places in 246 ms of which 1 ms to minimize.
[2024-05-24 13:16:01] [INFO ] Deduced a trap composed of 3 places in 254 ms of which 1 ms to minimize.
[2024-05-24 13:16:02] [INFO ] Deduced a trap composed of 3 places in 207 ms of which 1 ms to minimize.
[2024-05-24 13:16:02] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 1 ms to minimize.
[2024-05-24 13:16:02] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2024-05-24 13:16:02] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 0 ms to minimize.
[2024-05-24 13:16:02] [INFO ] Deduced a trap composed of 46 places in 185 ms of which 0 ms to minimize.
[2024-05-24 13:16:03] [INFO ] Deduced a trap composed of 46 places in 185 ms of which 1 ms to minimize.
[2024-05-24 13:16:03] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
[2024-05-24 13:16:03] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2506 ms
[2024-05-24 13:16:03] [INFO ] After 2765ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2024-05-24 13:16:03] [INFO ] After 3393ms 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 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 73 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 392/392 places, 2104/2104 transitions.
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 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 375660 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 375660 steps, saw 207525 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 13:16:06] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:16:06] [INFO ] Invariant cache hit.
[2024-05-24 13:16:06] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-24 13:16:06] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-24 13:16:07] [INFO ] After 404ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:16:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2024-05-24 13:16:07] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 8 ms returned sat
[2024-05-24 13:16:07] [INFO ] After 378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 13:16:07] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:16:07] [INFO ] After 189ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 13:16:08] [INFO ] Deduced a trap composed of 3 places in 368 ms of which 1 ms to minimize.
[2024-05-24 13:16:08] [INFO ] Deduced a trap composed of 3 places in 311 ms of which 1 ms to minimize.
[2024-05-24 13:16:08] [INFO ] Deduced a trap composed of 3 places in 226 ms of which 1 ms to minimize.
[2024-05-24 13:16:09] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 1 ms to minimize.
[2024-05-24 13:16:09] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 1 ms to minimize.
[2024-05-24 13:16:09] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 0 ms to minimize.
[2024-05-24 13:16:09] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 0 ms to minimize.
[2024-05-24 13:16:09] [INFO ] Deduced a trap composed of 46 places in 190 ms of which 1 ms to minimize.
[2024-05-24 13:16:10] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 0 ms to minimize.
[2024-05-24 13:16:10] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 0 ms to minimize.
[2024-05-24 13:16:10] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2473 ms
[2024-05-24 13:16:10] [INFO ] After 2734ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2024-05-24 13:16:10] [INFO ] After 3346ms 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 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 107 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 107 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-24 13:16:10] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:16:10] [INFO ] Invariant cache hit.
[2024-05-24 13:16:11] [INFO ] Implicit Places using invariants in 903 ms returned []
[2024-05-24 13:16:11] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:16:11] [INFO ] Invariant cache hit.
[2024-05-24 13:16:11] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:16:14] [INFO ] Implicit Places using invariants and state equation in 3137 ms returned []
Implicit Place search using SMT with State Equation took 4041 ms to find 0 implicit places.
[2024-05-24 13:16:14] [INFO ] Redundant transitions in 78 ms returned []
[2024-05-24 13:16:14] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:16:14] [INFO ] Invariant cache hit.
[2024-05-24 13:16:16] [INFO ] Dead Transitions using invariants and state equation in 1400 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5636 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
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 491 place count 114 transition count 228
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 18 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2024-05-24 13:16:16] [INFO ] Computed 17 invariants in 0 ms
[2024-05-24 13:16:16] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2024-05-24 13:16:16] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:16:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-24 13:16:16] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 13:16:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 13:16:16] [INFO ] After 11ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 13:16:16] [INFO ] After 23ms 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 13:16:16] [INFO ] After 113ms 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 107 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 67 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0)]
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 110 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-24 13:16:16] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-24 13:16:16] [INFO ] Computed 25 invariants in 3 ms
[2024-05-24 13:16:17] [INFO ] Implicit Places using invariants in 915 ms returned []
[2024-05-24 13:16:17] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:16:17] [INFO ] Invariant cache hit.
[2024-05-24 13:16:18] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:16:20] [INFO ] Implicit Places using invariants and state equation in 2761 ms returned []
Implicit Place search using SMT with State Equation took 3677 ms to find 0 implicit places.
[2024-05-24 13:16:20] [INFO ] Redundant transitions in 77 ms returned []
[2024-05-24 13:16:20] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:16:20] [INFO ] Invariant cache hit.
[2024-05-24 13:16:21] [INFO ] Dead Transitions using invariants and state equation in 1326 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5198 ms. Remains : 392/392 places, 2104/2104 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 89 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)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) 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 375885 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 375885 steps, saw 207538 distinct states, run finished after 3004 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 13:16:25] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:16:25] [INFO ] Invariant cache hit.
[2024-05-24 13:16:25] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-24 13:16:25] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-24 13:16:25] [INFO ] After 371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:16:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2024-05-24 13:16:25] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 8 ms returned sat
[2024-05-24 13:16:25] [INFO ] After 397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 13:16:26] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:16:26] [INFO ] After 197ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 13:16:26] [INFO ] Deduced a trap composed of 3 places in 368 ms of which 1 ms to minimize.
[2024-05-24 13:16:27] [INFO ] Deduced a trap composed of 3 places in 318 ms of which 1 ms to minimize.
[2024-05-24 13:16:27] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 1 ms to minimize.
[2024-05-24 13:16:27] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 1 ms to minimize.
[2024-05-24 13:16:27] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 1 ms to minimize.
[2024-05-24 13:16:27] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 1 ms to minimize.
[2024-05-24 13:16:28] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 0 ms to minimize.
[2024-05-24 13:16:28] [INFO ] Deduced a trap composed of 46 places in 193 ms of which 0 ms to minimize.
[2024-05-24 13:16:28] [INFO ] Deduced a trap composed of 46 places in 187 ms of which 1 ms to minimize.
[2024-05-24 13:16:28] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 1 ms to minimize.
[2024-05-24 13:16:28] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2557 ms
[2024-05-24 13:16:28] [INFO ] After 2825ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2024-05-24 13:16:28] [INFO ] After 3469ms 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 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 107 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 392/392 places, 2104/2104 transitions.
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 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 374760 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :{}
Probabilistic random walk after 374760 steps, saw 207107 distinct states, run finished after 3003 ms. (steps per millisecond=124 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 13:16:32] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:16:32] [INFO ] Invariant cache hit.
[2024-05-24 13:16:32] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2024-05-24 13:16:32] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 9 ms returned sat
[2024-05-24 13:16:32] [INFO ] After 505ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:16:32] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2024-05-24 13:16:32] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 9 ms returned sat
[2024-05-24 13:16:33] [INFO ] After 382ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 13:16:33] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:16:33] [INFO ] After 190ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 13:16:33] [INFO ] Deduced a trap composed of 3 places in 399 ms of which 0 ms to minimize.
[2024-05-24 13:16:34] [INFO ] Deduced a trap composed of 3 places in 322 ms of which 1 ms to minimize.
[2024-05-24 13:16:34] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 0 ms to minimize.
[2024-05-24 13:16:34] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 1 ms to minimize.
[2024-05-24 13:16:34] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 0 ms to minimize.
[2024-05-24 13:16:34] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2024-05-24 13:16:34] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 1 ms to minimize.
[2024-05-24 13:16:35] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 1 ms to minimize.
[2024-05-24 13:16:35] [INFO ] Deduced a trap composed of 46 places in 179 ms of which 1 ms to minimize.
[2024-05-24 13:16:35] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2024-05-24 13:16:35] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2241 ms
[2024-05-24 13:16:35] [INFO ] After 2497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2024-05-24 13:16:35] [INFO ] After 3106ms 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 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 93 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 89 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-24 13:16:35] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:16:35] [INFO ] Invariant cache hit.
[2024-05-24 13:16:36] [INFO ] Implicit Places using invariants in 674 ms returned []
[2024-05-24 13:16:36] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:16:36] [INFO ] Invariant cache hit.
[2024-05-24 13:16:36] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:16:39] [INFO ] Implicit Places using invariants and state equation in 2459 ms returned []
Implicit Place search using SMT with State Equation took 3134 ms to find 0 implicit places.
[2024-05-24 13:16:39] [INFO ] Redundant transitions in 85 ms returned []
[2024-05-24 13:16:39] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:16:39] [INFO ] Invariant cache hit.
[2024-05-24 13:16:40] [INFO ] Dead Transitions using invariants and state equation in 1675 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4996 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
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 491 place count 114 transition count 228
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 24 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2024-05-24 13:16:40] [INFO ] Computed 17 invariants in 1 ms
[2024-05-24 13:16:40] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-24 13:16:40] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:16:40] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-05-24 13:16:41] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 13:16:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 13:16:41] [INFO ] After 16ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 13:16:41] [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 13:16:41] [INFO ] After 166ms 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 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 406 ms.
Product exploration explored 100000 steps with 0 reset in 452 ms.
Built C files in :
/tmp/ltsmin16609667686242225615
[2024-05-24 13:16:42] [INFO ] Too many transitions (2104) to apply POR reductions. Disabling POR matrices.
[2024-05-24 13:16:42] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16609667686242225615
Running compilation step : cd /tmp/ltsmin16609667686242225615;'/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/ltsmin16609667686242225615;'/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/ltsmin16609667686242225615;'/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 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 68 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-24 13:16:45] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-24 13:16:45] [INFO ] Computed 25 invariants in 2 ms
[2024-05-24 13:16:46] [INFO ] Implicit Places using invariants in 699 ms returned []
[2024-05-24 13:16:46] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:16:46] [INFO ] Invariant cache hit.
[2024-05-24 13:16:46] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 13:16:48] [INFO ] Implicit Places using invariants and state equation in 2818 ms returned []
Implicit Place search using SMT with State Equation took 3518 ms to find 0 implicit places.
[2024-05-24 13:16:48] [INFO ] Redundant transitions in 81 ms returned []
[2024-05-24 13:16:48] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 13:16:48] [INFO ] Invariant cache hit.
[2024-05-24 13:16:51] [INFO ] Dead Transitions using invariants and state equation in 2158 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5834 ms. Remains : 392/392 places, 2104/2104 transitions.
Built C files in :
/tmp/ltsmin1403185706986173422
[2024-05-24 13:16:51] [INFO ] Too many transitions (2104) to apply POR reductions. Disabling POR matrices.
[2024-05-24 13:16:51] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1403185706986173422
Running compilation step : cd /tmp/ltsmin1403185706986173422;'/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/ltsmin1403185706986173422;'/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/ltsmin1403185706986173422;'/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 13:16:54] [INFO ] Flatten gal took : 52 ms
[2024-05-24 13:16:54] [INFO ] Flatten gal took : 52 ms
[2024-05-24 13:16:54] [INFO ] Time to serialize gal into /tmp/LTL7753841154392063818.gal : 9 ms
[2024-05-24 13:16:54] [INFO ] Time to serialize properties into /tmp/LTL5110316672067086879.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/LTL7753841154392063818.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7661416446018570824.hoa' '-atoms' '/tmp/LTL5110316672067086879.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/LTL5110316672067086879.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7661416446018570824.hoa
Detected timeout of ITS tools.
[2024-05-24 13:17:09] [INFO ] Flatten gal took : 53 ms
[2024-05-24 13:17:09] [INFO ] Flatten gal took : 59 ms
[2024-05-24 13:17:09] [INFO ] Time to serialize gal into /tmp/LTL8711886769976353010.gal : 14 ms
[2024-05-24 13:17:09] [INFO ] Time to serialize properties into /tmp/LTL18004507479032894556.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/LTL8711886769976353010.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18004507479032894556.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("(((turn_1!=1)||(flag_1_idle!=1))||(p25_3_5!=1))"))))
Formula 0 simplified : XF!"(((turn_1!=1)||(flag_1_idle!=1))||(p25_3_5!=1))"
Detected timeout of ITS tools.
[2024-05-24 13:17:24] [INFO ] Flatten gal took : 51 ms
[2024-05-24 13:17:24] [INFO ] Applying decomposition
[2024-05-24 13:17:24] [INFO ] Flatten gal took : 51 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/graph13039406194906864450.txt' '-o' '/tmp/graph13039406194906864450.bin' '-w' '/tmp/graph13039406194906864450.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13039406194906864450.bin' '-l' '-1' '-v' '-w' '/tmp/graph13039406194906864450.weights' '-q' '0' '-e' '0.001'
[2024-05-24 13:17:24] [INFO ] Decomposing Gal with order
[2024-05-24 13:17:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 13:17:25] [INFO ] Removed a total of 4368 redundant transitions.
[2024-05-24 13:17:25] [INFO ] Flatten gal took : 286 ms
[2024-05-24 13:17:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 508 labels/synchronizations in 68 ms.
[2024-05-24 13:17:25] [INFO ] Time to serialize gal into /tmp/LTL10936536431758018895.gal : 16 ms
[2024-05-24 13:17:25] [INFO ] Time to serialize properties into /tmp/LTL14328386708071425755.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/LTL10936536431758018895.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14328386708071425755.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.u57.turn_1!=1)||(i3.u76.flag_1_idle!=1))||(i1.u2.p25_3_5!=1))"))))
Formula 0 simplified : XF!"(((i4.u57.turn_1!=1)||(i3.u76.flag_1_idle!=1))||(i1.u2.p25_3_5!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3287863851333414576
[2024-05-24 13:17:40] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3287863851333414576
Running compilation step : cd /tmp/ltsmin3287863851333414576;'/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/ltsmin3287863851333414576;'/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/ltsmin3287863851333414576;'/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-08-LTLFireability-12 finished in 113205 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(p2)||p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(F(p1)))||p0))))'
[2024-05-24 13:17:43] [INFO ] Flatten gal took : 59 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14044250309807416340
[2024-05-24 13:17:43] [INFO ] Too many transitions (2424) to apply POR reductions. Disabling POR matrices.
[2024-05-24 13:17:43] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14044250309807416340
Running compilation step : cd /tmp/ltsmin14044250309807416340;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-24 13:17:43] [INFO ] Applying decomposition
[2024-05-24 13:17:43] [INFO ] Flatten gal took : 62 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/graph323390665028782996.txt' '-o' '/tmp/graph323390665028782996.bin' '-w' '/tmp/graph323390665028782996.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph323390665028782996.bin' '-l' '-1' '-v' '-w' '/tmp/graph323390665028782996.weights' '-q' '0' '-e' '0.001'
[2024-05-24 13:17:43] [INFO ] Decomposing Gal with order
[2024-05-24 13:17:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 13:17:44] [INFO ] Removed a total of 4807 redundant transitions.
[2024-05-24 13:17:44] [INFO ] Flatten gal took : 179 ms
[2024-05-24 13:17:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 488 labels/synchronizations in 50 ms.
[2024-05-24 13:17:44] [INFO ] Time to serialize gal into /tmp/LTLFireability1160499578873236088.gal : 16 ms
[2024-05-24 13:17:44] [INFO ] Time to serialize properties into /tmp/LTLFireability12458914358431824387.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/LTLFireability1160499578873236088.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12458914358431824387.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((X(G("(((i19.u165.turn_1!=1)||(i10.u7.flag_1_idle!=1))||(i10.u7.p25_3_5!=1))"))))
Formula 0 simplified : XF!"(((i19.u165.turn_1!=1)||(i10.u7.flag_1_idle!=1))||(i10.u7.p25_3_5!=1))"
Compilation finished in 9413 ms.
Running link step : cd /tmp/ltsmin14044250309807416340;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin14044250309807416340;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin14044250309807416340;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14044250309807416340;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](((LTLAPp1==true)&&([]((LTLAPp3==true))||(LTLAPp2==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-24 13:41:08] [INFO ] Applying decomposition
[2024-05-24 13:41:08] [INFO ] Flatten gal took : 155 ms
[2024-05-24 13:41:08] [INFO ] Decomposing Gal with order
[2024-05-24 13:41:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 13:41:09] [INFO ] Removed a total of 5037 redundant transitions.
[2024-05-24 13:41:09] [INFO ] Flatten gal took : 630 ms
[2024-05-24 13:41:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 233 labels/synchronizations in 67 ms.
[2024-05-24 13:41:09] [INFO ] Time to serialize gal into /tmp/LTLFireability5167649792982286462.gal : 25 ms
[2024-05-24 13:41:09] [INFO ] Time to serialize properties into /tmp/LTLFireability2737369731530761708.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/LTLFireability5167649792982286462.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2737369731530761708.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !((X(G("(((u10.turn_1!=1)||(u12.flag_1_idle!=1))||(u6.p25_3_5!=1))"))))
Formula 0 simplified : XF!"(((u10.turn_1!=1)||(u12.flag_1_idle!=1))||(u6.p25_3_5!=1))"
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin14044250309807416340;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](((LTLAPp1==true)&&([]((LTLAPp3==true))||(LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14044250309807416340;'/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(<>((LTLAPp5==true))))||(LTLAPp4==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-24 14:04:34] [INFO ] Flatten gal took : 192 ms
[2024-05-24 14:04:34] [INFO ] Input system was already deterministic with 2424 transitions.
[2024-05-24 14:04:34] [INFO ] Transformed 663 places.
[2024-05-24 14:04:34] [INFO ] Transformed 2424 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 14:04:34] [INFO ] Time to serialize gal into /tmp/LTLFireability15701140280154839833.gal : 9 ms
[2024-05-24 14:04:34] [INFO ] Time to serialize properties into /tmp/LTLFireability1444942454353081789.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/LTLFireability15701140280154839833.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1444942454353081789.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G("(((turn_1!=1)||(flag_1_idle!=1))||(p25_3_5!=1))"))))
Formula 0 simplified : XF!"(((turn_1!=1)||(flag_1_idle!=1))||(p25_3_5!=1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11410728 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16036516 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-08"
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-08, 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-171636280000118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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