Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r517-tall-167987243600252.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is EisenbergMcGuire-PT-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243600252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.5K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 17K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 31 16:48 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-07-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680827555905

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-07
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2023-04-07 00:32:37] [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]
[2023-04-07 00:32:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 00:32:37] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2023-04-07 00:32:37] [INFO ] Transformed 553 places.
[2023-04-07 00:32:37] [INFO ] Transformed 1960 transitions.
[2023-04-07 00:32:37] [INFO ] Found NUPN structural information;
[2023-04-07 00:32:37] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 515 transition count 1694
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 515 transition count 1694
Applied a total of 76 rules in 91 ms. Remains 515 /553 variables (removed 38) and now considering 1694/1960 (removed 266) transitions.
[2023-04-07 00:32:37] [INFO ] Flow matrix only has 735 transitions (discarded 959 similar events)
// Phase 1: matrix 735 rows 515 cols
[2023-04-07 00:32:37] [INFO ] Computed 22 invariants in 18 ms
[2023-04-07 00:32:38] [INFO ] Implicit Places using invariants in 429 ms returned []
[2023-04-07 00:32:38] [INFO ] Flow matrix only has 735 transitions (discarded 959 similar events)
[2023-04-07 00:32:38] [INFO ] Invariant cache hit.
[2023-04-07 00:32:38] [INFO ] State equation strengthened by 244 read => feed constraints.
[2023-04-07 00:32:39] [INFO ] Implicit Places using invariants and state equation in 1400 ms returned []
Implicit Place search using SMT with State Equation took 1915 ms to find 0 implicit places.
[2023-04-07 00:32:39] [INFO ] Flow matrix only has 735 transitions (discarded 959 similar events)
[2023-04-07 00:32:39] [INFO ] Invariant cache hit.
[2023-04-07 00:32:40] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 515/553 places, 1694/1960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2560 ms. Remains : 515/553 places, 1694/1960 transitions.
Support contains 47 out of 515 places after structural reductions.
[2023-04-07 00:32:40] [INFO ] Flatten gal took : 124 ms
[2023-04-07 00:32:40] [INFO ] Flatten gal took : 77 ms
[2023-04-07 00:32:40] [INFO ] Input system was already deterministic with 1694 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 549 ms. (steps per millisecond=18 ) properties (out of 31) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
[2023-04-07 00:32:41] [INFO ] Flow matrix only has 735 transitions (discarded 959 similar events)
[2023-04-07 00:32:41] [INFO ] Invariant cache hit.
[2023-04-07 00:32:41] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2023-04-07 00:32:41] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 00:32:42] [INFO ] After 409ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-04-07 00:32:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-04-07 00:32:42] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 12 ms returned sat
[2023-04-07 00:32:43] [INFO ] After 1054ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2023-04-07 00:32:43] [INFO ] State equation strengthened by 244 read => feed constraints.
[2023-04-07 00:32:44] [INFO ] After 1151ms SMT Verify possible using 244 Read/Feed constraints in natural domain returned unsat :0 sat :27
[2023-04-07 00:32:45] [INFO ] Deduced a trap composed of 45 places in 237 ms of which 5 ms to minimize.
[2023-04-07 00:32:45] [INFO ] Deduced a trap composed of 39 places in 214 ms of which 1 ms to minimize.
[2023-04-07 00:32:45] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 1 ms to minimize.
[2023-04-07 00:32:45] [INFO ] Deduced a trap composed of 53 places in 207 ms of which 2 ms to minimize.
[2023-04-07 00:32:45] [INFO ] Deduced a trap composed of 72 places in 209 ms of which 1 ms to minimize.
[2023-04-07 00:32:46] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 1 ms to minimize.
[2023-04-07 00:32:46] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 1 ms to minimize.
[2023-04-07 00:32:46] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2023-04-07 00:32:46] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 0 ms to minimize.
[2023-04-07 00:32:46] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2023-04-07 00:32:46] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1812 ms
[2023-04-07 00:32:46] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2023-04-07 00:32:46] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2023-04-07 00:32:46] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 0 ms to minimize.
[2023-04-07 00:32:47] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-04-07 00:32:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 429 ms
[2023-04-07 00:32:47] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-04-07 00:32:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-04-07 00:32:47] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 0 ms to minimize.
[2023-04-07 00:32:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-04-07 00:32:47] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2023-04-07 00:32:47] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 1 ms to minimize.
[2023-04-07 00:32:48] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
[2023-04-07 00:32:48] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2023-04-07 00:32:48] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
[2023-04-07 00:32:48] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2023-04-07 00:32:48] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2023-04-07 00:32:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 918 ms
[2023-04-07 00:32:48] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 0 ms to minimize.
[2023-04-07 00:32:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-04-07 00:32:49] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 0 ms to minimize.
[2023-04-07 00:32:49] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2023-04-07 00:32:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 255 ms
[2023-04-07 00:32:50] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 1 ms to minimize.
[2023-04-07 00:32:50] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2023-04-07 00:32:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 221 ms
[2023-04-07 00:32:50] [INFO ] After 6786ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :27
Attempting to minimize the solution found.
Minimization took 1366 ms.
[2023-04-07 00:32:51] [INFO ] After 9761ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :27
Parikh walk visited 0 properties in 923 ms.
Support contains 43 out of 515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 515 transition count 1691
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 512 transition count 1691
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 148 Pre rules applied. Total rules applied 6 place count 512 transition count 1543
Deduced a syphon composed of 148 places in 2 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 296 rules applied. Total rules applied 302 place count 364 transition count 1543
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 303 place count 363 transition count 1536
Iterating global reduction 2 with 1 rules applied. Total rules applied 304 place count 363 transition count 1536
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 386 place count 322 transition count 1495
Applied a total of 386 rules in 161 ms. Remains 322 /515 variables (removed 193) and now considering 1495/1694 (removed 199) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 322/515 places, 1495/1694 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 27) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) seen :0
Interrupted probabilistic random walk after 199632 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{0=1, 1=1, 2=1, 8=1, 11=1, 12=1, 14=1, 16=1, 19=1, 20=1, 21=1, 22=1, 23=1}
Probabilistic random walk after 199632 steps, saw 104185 distinct states, run finished after 3002 ms. (steps per millisecond=66 ) properties seen :13
Running SMT prover for 12 properties.
[2023-04-07 00:32:56] [INFO ] Flow matrix only has 536 transitions (discarded 959 similar events)
// Phase 1: matrix 536 rows 322 cols
[2023-04-07 00:32:56] [INFO ] Computed 22 invariants in 7 ms
[2023-04-07 00:32:56] [INFO ] [Real]Absence check using 15 positive place invariants in 27 ms returned sat
[2023-04-07 00:32:56] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 5 ms returned sat
[2023-04-07 00:32:56] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-04-07 00:32:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-04-07 00:32:56] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 00:32:56] [INFO ] After 345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-04-07 00:32:56] [INFO ] State equation strengthened by 238 read => feed constraints.
[2023-04-07 00:32:57] [INFO ] After 372ms SMT Verify possible using 238 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-04-07 00:32:57] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 0 ms to minimize.
[2023-04-07 00:32:57] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 1 ms to minimize.
[2023-04-07 00:32:57] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2023-04-07 00:32:57] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 0 ms to minimize.
[2023-04-07 00:32:57] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 0 ms to minimize.
[2023-04-07 00:32:58] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2023-04-07 00:32:58] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2023-04-07 00:32:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 800 ms
[2023-04-07 00:32:58] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 0 ms to minimize.
[2023-04-07 00:32:58] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 0 ms to minimize.
[2023-04-07 00:32:58] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 0 ms to minimize.
[2023-04-07 00:32:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 305 ms
[2023-04-07 00:32:58] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2023-04-07 00:32:58] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 0 ms to minimize.
[2023-04-07 00:32:58] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2023-04-07 00:32:58] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2023-04-07 00:32:59] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 1 ms to minimize.
[2023-04-07 00:32:59] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 1 ms to minimize.
[2023-04-07 00:32:59] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 1 ms to minimize.
[2023-04-07 00:32:59] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 0 ms to minimize.
[2023-04-07 00:32:59] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 0 ms to minimize.
[2023-04-07 00:32:59] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 1 ms to minimize.
[2023-04-07 00:32:59] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2023-04-07 00:32:59] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2023-04-07 00:33:00] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2023-04-07 00:33:00] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1566 ms
[2023-04-07 00:33:00] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
[2023-04-07 00:33:00] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-04-07 00:33:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2023-04-07 00:33:00] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2023-04-07 00:33:00] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2023-04-07 00:33:00] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 3 ms to minimize.
[2023-04-07 00:33:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 288 ms
[2023-04-07 00:33:00] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2023-04-07 00:33:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-04-07 00:33:01] [INFO ] After 4073ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 408 ms.
[2023-04-07 00:33:01] [INFO ] After 5004ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 66 ms.
Support contains 24 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 1495/1495 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 322 transition count 1488
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 315 transition count 1488
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 312 transition count 1467
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 312 transition count 1467
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 311 transition count 1466
Applied a total of 22 rules in 68 ms. Remains 311 /322 variables (removed 11) and now considering 1466/1495 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 311/322 places, 1466/1495 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 199648 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 199648 steps, saw 100246 distinct states, run finished after 3002 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 12 properties.
[2023-04-07 00:33:05] [INFO ] Flow matrix only has 507 transitions (discarded 959 similar events)
// Phase 1: matrix 507 rows 311 cols
[2023-04-07 00:33:05] [INFO ] Computed 22 invariants in 10 ms
[2023-04-07 00:33:05] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 00:33:05] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 00:33:05] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-04-07 00:33:05] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 00:33:05] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 00:33:06] [INFO ] After 341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-04-07 00:33:06] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:33:06] [INFO ] After 376ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-04-07 00:33:06] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 0 ms to minimize.
[2023-04-07 00:33:06] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2023-04-07 00:33:06] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2023-04-07 00:33:06] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2023-04-07 00:33:06] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2023-04-07 00:33:07] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2023-04-07 00:33:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 603 ms
[2023-04-07 00:33:07] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
[2023-04-07 00:33:07] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2023-04-07 00:33:07] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-04-07 00:33:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 258 ms
[2023-04-07 00:33:07] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 0 ms to minimize.
[2023-04-07 00:33:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-04-07 00:33:07] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 0 ms to minimize.
[2023-04-07 00:33:07] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2023-04-07 00:33:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 188 ms
[2023-04-07 00:33:07] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2023-04-07 00:33:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-04-07 00:33:08] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2023-04-07 00:33:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-04-07 00:33:08] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 0 ms to minimize.
[2023-04-07 00:33:08] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2023-04-07 00:33:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2023-04-07 00:33:08] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2023-04-07 00:33:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-04-07 00:33:08] [INFO ] After 2363ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 370 ms.
[2023-04-07 00:33:08] [INFO ] After 3250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 53 ms.
Support contains 24 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1466/1466 transitions.
Applied a total of 0 rules in 42 ms. Remains 311 /311 variables (removed 0) and now considering 1466/1466 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 311/311 places, 1466/1466 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1466/1466 transitions.
Applied a total of 0 rules in 41 ms. Remains 311 /311 variables (removed 0) and now considering 1466/1466 (removed 0) transitions.
[2023-04-07 00:33:08] [INFO ] Flow matrix only has 507 transitions (discarded 959 similar events)
[2023-04-07 00:33:08] [INFO ] Invariant cache hit.
[2023-04-07 00:33:09] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-04-07 00:33:09] [INFO ] Flow matrix only has 507 transitions (discarded 959 similar events)
[2023-04-07 00:33:09] [INFO ] Invariant cache hit.
[2023-04-07 00:33:09] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:33:09] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1078 ms to find 0 implicit places.
[2023-04-07 00:33:10] [INFO ] Redundant transitions in 91 ms returned []
[2023-04-07 00:33:10] [INFO ] Flow matrix only has 507 transitions (discarded 959 similar events)
[2023-04-07 00:33:10] [INFO ] Invariant cache hit.
[2023-04-07 00:33:10] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1697 ms. Remains : 311/311 places, 1466/1466 transitions.
Graph (trivial) has 1179 edges and 311 vertex of which 49 / 311 are part of one of the 7 SCC in 3 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 269 transition count 325
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 213 transition count 325
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 113 place count 213 transition count 310
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 150 place count 191 transition count 310
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 300 place count 116 transition count 235
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 327 place count 116 transition count 208
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 333 place count 113 transition count 208
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 336 place count 113 transition count 205
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 347 place count 113 transition count 194
Free-agglomeration rule applied 48 times.
Iterating global reduction 4 with 48 rules applied. Total rules applied 395 place count 113 transition count 146
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 4 with 48 rules applied. Total rules applied 443 place count 65 transition count 146
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 451 place count 65 transition count 146
Applied a total of 451 rules in 37 ms. Remains 65 /311 variables (removed 246) and now considering 146/1466 (removed 1320) transitions.
Running SMT prover for 12 properties.
// Phase 1: matrix 146 rows 65 cols
[2023-04-07 00:33:10] [INFO ] Computed 15 invariants in 2 ms
[2023-04-07 00:33:10] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 00:33:10] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-04-07 00:33:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 00:33:10] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-04-07 00:33:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 00:33:10] [INFO ] After 74ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-04-07 00:33:10] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2023-04-07 00:33:10] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2023-04-07 00:33:10] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2023-04-07 00:33:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 77 ms
[2023-04-07 00:33:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-04-07 00:33:11] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2023-04-07 00:33:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 58 ms
[2023-04-07 00:33:11] [INFO ] After 307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-04-07 00:33:11] [INFO ] After 521ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
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(X(G(p0))))'
Support contains 4 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 512 transition count 1673
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 512 transition count 1673
Applied a total of 6 rules in 31 ms. Remains 512 /515 variables (removed 3) and now considering 1673/1694 (removed 21) transitions.
[2023-04-07 00:33:11] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
// Phase 1: matrix 714 rows 512 cols
[2023-04-07 00:33:11] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 00:33:11] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-04-07 00:33:11] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2023-04-07 00:33:11] [INFO ] Invariant cache hit.
[2023-04-07 00:33:12] [INFO ] State equation strengthened by 226 read => feed constraints.
[2023-04-07 00:33:13] [INFO ] Implicit Places using invariants and state equation in 1630 ms returned []
Implicit Place search using SMT with State Equation took 1954 ms to find 0 implicit places.
[2023-04-07 00:33:13] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2023-04-07 00:33:13] [INFO ] Invariant cache hit.
[2023-04-07 00:33:14] [INFO ] Dead Transitions using invariants and state equation in 549 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 512/515 places, 1673/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2535 ms. Remains : 512/515 places, 1673/1694 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 237 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s5 1) (EQ s133 1) (OR (NEQ s8 1) (NEQ s103 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-01 finished in 2836 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((((F(p2) U p3)&&p1)||p0)))||G(p3)))'
Support contains 6 out of 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 515 transition count 1687
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 508 transition count 1687
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 153 Pre rules applied. Total rules applied 14 place count 508 transition count 1534
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 320 place count 355 transition count 1534
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 324 place count 351 transition count 1506
Iterating global reduction 2 with 4 rules applied. Total rules applied 328 place count 351 transition count 1506
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 412 place count 309 transition count 1464
Applied a total of 412 rules in 146 ms. Remains 309 /515 variables (removed 206) and now considering 1464/1694 (removed 230) transitions.
[2023-04-07 00:33:14] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-07 00:33:14] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 00:33:14] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-04-07 00:33:14] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 00:33:14] [INFO ] Invariant cache hit.
[2023-04-07 00:33:14] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:33:15] [INFO ] Implicit Places using invariants and state equation in 928 ms returned []
Implicit Place search using SMT with State Equation took 1238 ms to find 0 implicit places.
[2023-04-07 00:33:15] [INFO ] Redundant transitions in 67 ms returned []
[2023-04-07 00:33:15] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 00:33:15] [INFO ] Invariant cache hit.
[2023-04-07 00:33:16] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 309/515 places, 1464/1694 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1903 ms. Remains : 309/515 places, 1464/1694 transitions.
Stuttering acceptance computed with spot in 351 ms :[(AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p2))), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(AND (EQ s4 1) (EQ s21 1) (EQ s223 1)), p1:(AND (EQ s13 1) (EQ s140 1)), p0:(OR (EQ s4 0) (EQ s21 0) (EQ s214 0)), p2:(AND (EQ s4 1) (EQ s21 1) (EQ s21...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 371 ms.
Product exploration explored 100000 steps with 0 reset in 376 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 p3) (NOT p1) p0 (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) p1 (NOT p0)))), (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p3))), true, (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 128 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) 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 6) 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 6) 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 6) 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 6) seen :0
Interrupted probabilistic random walk after 289000 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{0=1, 5=1}
Probabilistic random walk after 289000 steps, saw 133918 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :2
Running SMT prover for 4 properties.
[2023-04-07 00:33:21] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 00:33:21] [INFO ] Invariant cache hit.
[2023-04-07 00:33:21] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 00:33:21] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 00:33:21] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 00:33:21] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-04-07 00:33:21] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:33:21] [INFO ] After 53ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2023-04-07 00:33:21] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-04-07 00:33:21] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2023-04-07 00:33:21] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2023-04-07 00:33:21] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2023-04-07 00:33:21] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2023-04-07 00:33:21] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-04-07 00:33:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 534 ms
[2023-04-07 00:33:21] [INFO ] After 607ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-04-07 00:33:21] [INFO ] After 842ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 32 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 309/309 places, 1464/1464 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 643048 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 643048 steps, saw 227605 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 00:33:25] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 00:33:25] [INFO ] Invariant cache hit.
[2023-04-07 00:33:25] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 00:33:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 00:33:25] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 9 ms returned sat
[2023-04-07 00:33:25] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 00:33:25] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:33:25] [INFO ] After 48ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 00:33:25] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 0 ms to minimize.
[2023-04-07 00:33:25] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2023-04-07 00:33:25] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 0 ms to minimize.
[2023-04-07 00:33:25] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2023-04-07 00:33:25] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 0 ms to minimize.
[2023-04-07 00:33:26] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 0 ms to minimize.
[2023-04-07 00:33:26] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2023-04-07 00:33:26] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 0 ms to minimize.
[2023-04-07 00:33:26] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2023-04-07 00:33:26] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 947 ms
[2023-04-07 00:33:26] [INFO ] After 1020ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-04-07 00:33:26] [INFO ] After 1253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 34 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 309/309 places, 1464/1464 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 31 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
[2023-04-07 00:33:26] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 00:33:26] [INFO ] Invariant cache hit.
[2023-04-07 00:33:26] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-04-07 00:33:26] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 00:33:26] [INFO ] Invariant cache hit.
[2023-04-07 00:33:26] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:33:27] [INFO ] Implicit Places using invariants and state equation in 926 ms returned []
Implicit Place search using SMT with State Equation took 1171 ms to find 0 implicit places.
[2023-04-07 00:33:27] [INFO ] Redundant transitions in 21 ms returned []
[2023-04-07 00:33:27] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 00:33:27] [INFO ] Invariant cache hit.
[2023-04-07 00:33:28] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1691 ms. Remains : 309/309 places, 1464/1464 transitions.
Graph (trivial) has 1310 edges and 309 vertex of which 49 / 309 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 267 transition count 321
Reduce places removed 58 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 60 rules applied. Total rules applied 119 place count 209 transition count 319
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 121 place count 207 transition count 319
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 121 place count 207 transition count 304
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 37 rules applied. Total rules applied 158 place count 185 transition count 304
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 320 place count 104 transition count 223
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 358 place count 104 transition count 185
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 370 place count 98 transition count 185
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 376 place count 98 transition count 179
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 384 place count 98 transition count 171
Free-agglomeration rule applied 44 times.
Iterating global reduction 5 with 44 rules applied. Total rules applied 428 place count 98 transition count 127
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 5 with 44 rules applied. Total rules applied 472 place count 54 transition count 127
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 480 place count 54 transition count 127
Applied a total of 480 rules in 22 ms. Remains 54 /309 variables (removed 255) and now considering 127/1464 (removed 1337) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 54 cols
[2023-04-07 00:33:28] [INFO ] Computed 15 invariants in 1 ms
[2023-04-07 00:33:28] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 00:33:28] [INFO ] [Nat]Absence check using 15 positive place invariants in 1 ms returned sat
[2023-04-07 00:33:28] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 00:33:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 00:33:28] [INFO ] After 7ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 00:33:28] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2023-04-07 00:33:28] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2023-04-07 00:33:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 55 ms
[2023-04-07 00:33:28] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-07 00:33:28] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p1) p0 (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) p1 (NOT p0)))), (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p3))), true, (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (G (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (G (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p3))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 21 factoid took 170 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 127 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Support contains 6 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 46 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
[2023-04-07 00:33:28] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-07 00:33:28] [INFO ] Computed 22 invariants in 7 ms
[2023-04-07 00:33:28] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-04-07 00:33:28] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 00:33:28] [INFO ] Invariant cache hit.
[2023-04-07 00:33:29] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:33:29] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1196 ms to find 0 implicit places.
[2023-04-07 00:33:29] [INFO ] Redundant transitions in 24 ms returned []
[2023-04-07 00:33:29] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 00:33:29] [INFO ] Invariant cache hit.
[2023-04-07 00:33:30] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1715 ms. Remains : 309/309 places, 1464/1464 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) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 94 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 28 ms. (steps per millisecond=357 ) 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 586800 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 586800 steps, saw 210276 distinct states, run finished after 3001 ms. (steps per millisecond=195 ) properties seen :2
Running SMT prover for 1 properties.
[2023-04-07 00:33:33] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 00:33:33] [INFO ] Invariant cache hit.
[2023-04-07 00:33:33] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 00:33:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 00:33:34] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 00:33:34] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 00:33:34] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:33:34] [INFO ] After 51ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 00:33:34] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2023-04-07 00:33:34] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 0 ms to minimize.
[2023-04-07 00:33:34] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 0 ms to minimize.
[2023-04-07 00:33:34] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2023-04-07 00:33:34] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 0 ms to minimize.
[2023-04-07 00:33:34] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 0 ms to minimize.
[2023-04-07 00:33:34] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 0 ms to minimize.
[2023-04-07 00:33:35] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2023-04-07 00:33:35] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2023-04-07 00:33:35] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 925 ms
[2023-04-07 00:33:35] [INFO ] After 1003ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-04-07 00:33:35] [INFO ] After 1221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 41 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 309/309 places, 1464/1464 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 674416 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :{}
Probabilistic random walk after 674416 steps, saw 234826 distinct states, run finished after 3001 ms. (steps per millisecond=224 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 00:33:38] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 00:33:38] [INFO ] Invariant cache hit.
[2023-04-07 00:33:38] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 00:33:38] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 00:33:38] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 00:33:38] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 00:33:38] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:33:38] [INFO ] After 47ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 00:33:38] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 0 ms to minimize.
[2023-04-07 00:33:38] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 0 ms to minimize.
[2023-04-07 00:33:38] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2023-04-07 00:33:39] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 0 ms to minimize.
[2023-04-07 00:33:39] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2023-04-07 00:33:39] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2023-04-07 00:33:39] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 0 ms to minimize.
[2023-04-07 00:33:39] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 0 ms to minimize.
[2023-04-07 00:33:39] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2023-04-07 00:33:39] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 965 ms
[2023-04-07 00:33:39] [INFO ] After 1035ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-04-07 00:33:39] [INFO ] After 1251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 34 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 309/309 places, 1464/1464 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 30 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
[2023-04-07 00:33:39] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 00:33:39] [INFO ] Invariant cache hit.
[2023-04-07 00:33:39] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-04-07 00:33:39] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 00:33:39] [INFO ] Invariant cache hit.
[2023-04-07 00:33:40] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:33:40] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 1187 ms to find 0 implicit places.
[2023-04-07 00:33:40] [INFO ] Redundant transitions in 23 ms returned []
[2023-04-07 00:33:40] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 00:33:40] [INFO ] Invariant cache hit.
[2023-04-07 00:33:41] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1695 ms. Remains : 309/309 places, 1464/1464 transitions.
Graph (trivial) has 1310 edges and 309 vertex of which 49 / 309 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 267 transition count 321
Reduce places removed 58 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 60 rules applied. Total rules applied 119 place count 209 transition count 319
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 121 place count 207 transition count 319
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 121 place count 207 transition count 304
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 37 rules applied. Total rules applied 158 place count 185 transition count 304
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 320 place count 104 transition count 223
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 358 place count 104 transition count 185
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 370 place count 98 transition count 185
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 376 place count 98 transition count 179
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 384 place count 98 transition count 171
Free-agglomeration rule applied 44 times.
Iterating global reduction 5 with 44 rules applied. Total rules applied 428 place count 98 transition count 127
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 5 with 44 rules applied. Total rules applied 472 place count 54 transition count 127
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 480 place count 54 transition count 127
Applied a total of 480 rules in 16 ms. Remains 54 /309 variables (removed 255) and now considering 127/1464 (removed 1337) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 54 cols
[2023-04-07 00:33:41] [INFO ] Computed 15 invariants in 1 ms
[2023-04-07 00:33:41] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 00:33:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 00:33:41] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 00:33:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 00:33:41] [INFO ] After 6ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 00:33:41] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2023-04-07 00:33:41] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2023-04-07 00:33:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 56 ms
[2023-04-07 00:33:41] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-07 00:33:41] [INFO ] After 138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 7 factoid took 181 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 196 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 142 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 0 reset in 228 ms.
Product exploration explored 100000 steps with 0 reset in 278 ms.
Built C files in :
/tmp/ltsmin2950881815576758876
[2023-04-07 00:33:42] [INFO ] Computing symmetric may disable matrix : 1464 transitions.
[2023-04-07 00:33:42] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 00:33:42] [INFO ] Computing symmetric may enable matrix : 1464 transitions.
[2023-04-07 00:33:42] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 00:33:42] [INFO ] Computing Do-Not-Accords matrix : 1464 transitions.
[2023-04-07 00:33:43] [INFO ] Computation of Completed DNA matrix. took 61 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 00:33:43] [INFO ] Built C files in 377ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2950881815576758876
Running compilation step : cd /tmp/ltsmin2950881815576758876;'/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/ltsmin2950881815576758876;'/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/ltsmin2950881815576758876;'/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 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 33 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
[2023-04-07 00:33:46] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-07 00:33:46] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 00:33:46] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-04-07 00:33:46] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 00:33:46] [INFO ] Invariant cache hit.
[2023-04-07 00:33:46] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:33:47] [INFO ] Implicit Places using invariants and state equation in 899 ms returned []
Implicit Place search using SMT with State Equation took 1159 ms to find 0 implicit places.
[2023-04-07 00:33:47] [INFO ] Redundant transitions in 23 ms returned []
[2023-04-07 00:33:47] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 00:33:47] [INFO ] Invariant cache hit.
[2023-04-07 00:33:47] [INFO ] Dead Transitions using invariants and state equation in 415 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1639 ms. Remains : 309/309 places, 1464/1464 transitions.
Built C files in :
/tmp/ltsmin10753307779793538244
[2023-04-07 00:33:47] [INFO ] Computing symmetric may disable matrix : 1464 transitions.
[2023-04-07 00:33:47] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 00:33:47] [INFO ] Computing symmetric may enable matrix : 1464 transitions.
[2023-04-07 00:33:47] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 00:33:48] [INFO ] Computing Do-Not-Accords matrix : 1464 transitions.
[2023-04-07 00:33:48] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 00:33:48] [INFO ] Built C files in 361ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10753307779793538244
Running compilation step : cd /tmp/ltsmin10753307779793538244;'/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/ltsmin10753307779793538244;'/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/ltsmin10753307779793538244;'/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)
[2023-04-07 00:33:51] [INFO ] Flatten gal took : 49 ms
[2023-04-07 00:33:51] [INFO ] Flatten gal took : 49 ms
[2023-04-07 00:33:51] [INFO ] Time to serialize gal into /tmp/LTL2752146964394657943.gal : 11 ms
[2023-04-07 00:33:51] [INFO ] Time to serialize properties into /tmp/LTL2982937944409970458.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/LTL2752146964394657943.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9579596633348057577.hoa' '-atoms' '/tmp/LTL2982937944409970458.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/LTL2982937944409970458.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9579596633348057577.hoa
Detected timeout of ITS tools.
[2023-04-07 00:34:06] [INFO ] Flatten gal took : 65 ms
[2023-04-07 00:34:06] [INFO ] Flatten gal took : 56 ms
[2023-04-07 00:34:06] [INFO ] Time to serialize gal into /tmp/LTL8162920677950592263.gal : 7 ms
[2023-04-07 00:34:06] [INFO ] Time to serialize properties into /tmp/LTL898080818216793592.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/LTL8162920677950592263.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL898080818216793592.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !(((G(F(("((turn_4==0)||(flag_4_active==0))")||(("(p25_4_0==0)")||(("((flag_2_idle==1)&&(p18_3_2==1))")&&((F("(((turn_4==1)&&(flag_4_a...303
Formula 0 simplified : FG(!"((turn_4==0)||(flag_4_active==0))" & !"(p25_4_0==0)" & (!"((flag_2_idle==1)&&(p18_3_2==1))" | (G!"(((turn_4==1)&&(flag_4_active...290
Detected timeout of ITS tools.
[2023-04-07 00:34:21] [INFO ] Flatten gal took : 43 ms
[2023-04-07 00:34:21] [INFO ] Applying decomposition
[2023-04-07 00:34:21] [INFO ] Flatten gal took : 41 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/graph17876203901926309221.txt' '-o' '/tmp/graph17876203901926309221.bin' '-w' '/tmp/graph17876203901926309221.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17876203901926309221.bin' '-l' '-1' '-v' '-w' '/tmp/graph17876203901926309221.weights' '-q' '0' '-e' '0.001'
[2023-04-07 00:34:21] [INFO ] Decomposing Gal with order
[2023-04-07 00:34:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 00:34:22] [INFO ] Removed a total of 2764 redundant transitions.
[2023-04-07 00:34:22] [INFO ] Flatten gal took : 246 ms
[2023-04-07 00:34:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 370 labels/synchronizations in 78 ms.
[2023-04-07 00:34:22] [INFO ] Time to serialize gal into /tmp/LTL3465238182476889170.gal : 16 ms
[2023-04-07 00:34:22] [INFO ] Time to serialize properties into /tmp/LTL18229995521058140307.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/LTL3465238182476889170.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18229995521058140307.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G(F(("((i3.u5.turn_4==0)||(i11.u1.flag_4_active==0))")||(("(i2.u4.p25_4_0==0)")||(("((i8.i0.u63.flag_2_idle==1)&&(i9.u43.p18_3_2==...396
Formula 0 simplified : FG(!"((i3.u5.turn_4==0)||(i11.u1.flag_4_active==0))" & !"(i2.u4.p25_4_0==0)" & (!"((i8.i0.u63.flag_2_idle==1)&&(i9.u43.p18_3_2==1))"...383
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12587716666192426614
[2023-04-07 00:34:37] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12587716666192426614
Running compilation step : cd /tmp/ltsmin12587716666192426614;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2559 ms.
Running link step : cd /tmp/ltsmin12587716666192426614;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin12587716666192426614;'/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' '([](<>((((<>((LTLAPp2==true)) U (LTLAPp3==true))&&(LTLAPp1==true))||(LTLAPp0==true))))||[]((LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-02 finished in 98311 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((G(p0)||G((X(p2)||p1)))))))'
Support contains 5 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 511 transition count 1666
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 511 transition count 1666
Applied a total of 8 rules in 18 ms. Remains 511 /515 variables (removed 4) and now considering 1666/1694 (removed 28) transitions.
[2023-04-07 00:34:52] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2023-04-07 00:34:52] [INFO ] Computed 22 invariants in 7 ms
[2023-04-07 00:34:52] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-04-07 00:34:52] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 00:34:52] [INFO ] Invariant cache hit.
[2023-04-07 00:34:53] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:34:54] [INFO ] Implicit Places using invariants and state equation in 1565 ms returned []
Implicit Place search using SMT with State Equation took 1863 ms to find 0 implicit places.
[2023-04-07 00:34:54] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 00:34:54] [INFO ] Invariant cache hit.
[2023-04-07 00:34:55] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 511/515 places, 1666/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2419 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 365 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 8}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 5}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=6, aps=[p2:(AND (EQ s0 1) (EQ s8 1) (EQ s351 1)), p1:(OR (EQ s4 0) (EQ s388 0)), p0:(OR (EQ s0 0) (EQ s8 0) (EQ s351 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 226 ms.
Product exploration explored 100000 steps with 0 reset in 319 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 p2) p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 365 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 165176 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 165176 steps, saw 113998 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 15 properties.
[2023-04-07 00:34:59] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 00:34:59] [INFO ] Invariant cache hit.
[2023-04-07 00:34:59] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2023-04-07 00:34:59] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 00:34:59] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:13
[2023-04-07 00:35:00] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-04-07 00:35:00] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 00:35:00] [INFO ] After 531ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :9
[2023-04-07 00:35:00] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:35:01] [INFO ] After 493ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :6 sat :9
[2023-04-07 00:35:01] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 1 ms to minimize.
[2023-04-07 00:35:01] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 0 ms to minimize.
[2023-04-07 00:35:01] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2023-04-07 00:35:01] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2023-04-07 00:35:01] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-07 00:35:01] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
[2023-04-07 00:35:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 684 ms
[2023-04-07 00:35:01] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 0 ms to minimize.
[2023-04-07 00:35:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-04-07 00:35:02] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2023-04-07 00:35:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-04-07 00:35:02] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 0 ms to minimize.
[2023-04-07 00:35:02] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 0 ms to minimize.
[2023-04-07 00:35:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 240 ms
[2023-04-07 00:35:02] [INFO ] After 2206ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :9
Attempting to minimize the solution found.
Minimization took 489 ms.
[2023-04-07 00:35:03] [INFO ] After 3468ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :9
Fused 15 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 99 ms.
Support contains 5 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 1666/1666 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 511 transition count 1659
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 504 transition count 1659
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 504 transition count 1505
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 350 transition count 1505
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 406 place count 308 transition count 1463
Applied a total of 406 rules in 54 ms. Remains 308 /511 variables (removed 203) and now considering 1463/1666 (removed 203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 308/511 places, 1463/1666 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) seen :0
Interrupted probabilistic random walk after 246256 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 246256 steps, saw 118360 distinct states, run finished after 3002 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 9 properties.
[2023-04-07 00:35:06] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-07 00:35:06] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 00:35:07] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 00:35:07] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 00:35:07] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-07 00:35:07] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 00:35:07] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 00:35:07] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-07 00:35:07] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:35:07] [INFO ] After 284ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-07 00:35:07] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 0 ms to minimize.
[2023-04-07 00:35:08] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 1 ms to minimize.
[2023-04-07 00:35:08] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2023-04-07 00:35:08] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 0 ms to minimize.
[2023-04-07 00:35:08] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 0 ms to minimize.
[2023-04-07 00:35:08] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
[2023-04-07 00:35:08] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2023-04-07 00:35:08] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2023-04-07 00:35:08] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2023-04-07 00:35:08] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-04-07 00:35:08] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1047 ms
[2023-04-07 00:35:09] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 0 ms to minimize.
[2023-04-07 00:35:09] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2023-04-07 00:35:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 186 ms
[2023-04-07 00:35:09] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2023-04-07 00:35:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-04-07 00:35:09] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2023-04-07 00:35:09] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2023-04-07 00:35:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 172 ms
[2023-04-07 00:35:09] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2023-04-07 00:35:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-04-07 00:35:09] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2023-04-07 00:35:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-04-07 00:35:09] [INFO ] After 2327ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 307 ms.
[2023-04-07 00:35:10] [INFO ] After 3104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 43 ms.
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 29 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 30 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-07 00:35:10] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:35:10] [INFO ] Invariant cache hit.
[2023-04-07 00:35:10] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-04-07 00:35:10] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:35:10] [INFO ] Invariant cache hit.
[2023-04-07 00:35:10] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:35:11] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned []
Implicit Place search using SMT with State Equation took 1277 ms to find 0 implicit places.
[2023-04-07 00:35:11] [INFO ] Redundant transitions in 22 ms returned []
[2023-04-07 00:35:11] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:35:11] [INFO ] Invariant cache hit.
[2023-04-07 00:35:12] [INFO ] Dead Transitions using invariants and state equation in 423 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1759 ms. Remains : 308/308 places, 1463/1463 transitions.
Graph (trivial) has 1324 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 2 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 266 transition count 317
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 123 place count 205 transition count 302
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 160 place count 183 transition count 302
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 324 place count 101 transition count 220
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 363 place count 101 transition count 181
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 375 place count 95 transition count 181
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 381 place count 95 transition count 175
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 388 place count 95 transition count 168
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 431 place count 95 transition count 125
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 474 place count 52 transition count 125
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 481 place count 52 transition count 125
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 482 place count 52 transition count 125
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 483 place count 52 transition count 124
Applied a total of 483 rules in 18 ms. Remains 52 /308 variables (removed 256) and now considering 124/1463 (removed 1339) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 124 rows 52 cols
[2023-04-07 00:35:12] [INFO ] Computed 15 invariants in 1 ms
[2023-04-07 00:35:12] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 00:35:12] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-07 00:35:12] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 00:35:12] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-07 00:35:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 00:35:12] [INFO ] After 60ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-07 00:35:12] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2023-04-07 00:35:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-04-07 00:35:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-04-07 00:35:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-04-07 00:35:12] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-04-07 00:35:12] [INFO ] After 378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), true, (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 108 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 386 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 329 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Support contains 5 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 1666/1666 transitions.
Applied a total of 0 rules in 12 ms. Remains 511 /511 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2023-04-07 00:35:13] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2023-04-07 00:35:13] [INFO ] Computed 22 invariants in 6 ms
[2023-04-07 00:35:13] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-04-07 00:35:13] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 00:35:13] [INFO ] Invariant cache hit.
[2023-04-07 00:35:13] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:35:15] [INFO ] Implicit Places using invariants and state equation in 1542 ms returned []
Implicit Place search using SMT with State Equation took 1826 ms to find 0 implicit places.
[2023-04-07 00:35:15] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 00:35:15] [INFO ] Invariant cache hit.
[2023-04-07 00:35:15] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2384 ms. Remains : 511/511 places, 1666/1666 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 325 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 220664 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 220664 steps, saw 150317 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-07 00:35:19] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 00:35:19] [INFO ] Invariant cache hit.
[2023-04-07 00:35:19] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-04-07 00:35:19] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 00:35:19] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 00:35:19] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-04-07 00:35:19] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 00:35:19] [INFO ] After 282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 00:35:19] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:35:20] [INFO ] After 204ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 00:35:20] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 0 ms to minimize.
[2023-04-07 00:35:20] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 1 ms to minimize.
[2023-04-07 00:35:20] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 1 ms to minimize.
[2023-04-07 00:35:20] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2023-04-07 00:35:20] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2023-04-07 00:35:20] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 0 ms to minimize.
[2023-04-07 00:35:21] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2023-04-07 00:35:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 901 ms
[2023-04-07 00:35:21] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 0 ms to minimize.
[2023-04-07 00:35:21] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2023-04-07 00:35:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 230 ms
[2023-04-07 00:35:21] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2023-04-07 00:35:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-04-07 00:35:21] [INFO ] After 1620ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-04-07 00:35:21] [INFO ] After 2177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 24 ms.
Support contains 5 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 1666/1666 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 511 transition count 1659
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 504 transition count 1659
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 504 transition count 1505
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 350 transition count 1505
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 406 place count 308 transition count 1463
Applied a total of 406 rules in 53 ms. Remains 308 /511 variables (removed 203) and now considering 1463/1666 (removed 203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 308/511 places, 1463/1666 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 364736 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :{}
Probabilistic random walk after 364736 steps, saw 155085 distinct states, run finished after 3003 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-07 00:35:24] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-07 00:35:24] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 00:35:25] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 00:35:25] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 00:35:25] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 00:35:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 00:35:25] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 00:35:25] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 00:35:25] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:35:25] [INFO ] After 118ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 00:35:25] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 0 ms to minimize.
[2023-04-07 00:35:25] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2023-04-07 00:35:25] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 0 ms to minimize.
[2023-04-07 00:35:25] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2023-04-07 00:35:25] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-04-07 00:35:25] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2023-04-07 00:35:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 536 ms
[2023-04-07 00:35:26] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 0 ms to minimize.
[2023-04-07 00:35:26] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 0 ms to minimize.
[2023-04-07 00:35:26] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 1 ms to minimize.
[2023-04-07 00:35:26] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 0 ms to minimize.
[2023-04-07 00:35:26] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 0 ms to minimize.
[2023-04-07 00:35:26] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 0 ms to minimize.
[2023-04-07 00:35:26] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2023-04-07 00:35:26] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 0 ms to minimize.
[2023-04-07 00:35:26] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2023-04-07 00:35:26] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2023-04-07 00:35:26] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2023-04-07 00:35:27] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1057 ms
[2023-04-07 00:35:27] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 0 ms to minimize.
[2023-04-07 00:35:27] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-04-07 00:35:27] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2023-04-07 00:35:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 229 ms
[2023-04-07 00:35:27] [INFO ] After 2017ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-04-07 00:35:27] [INFO ] After 2345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 16 ms.
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 27 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 27 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-07 00:35:27] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:35:27] [INFO ] Invariant cache hit.
[2023-04-07 00:35:27] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-04-07 00:35:27] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:35:27] [INFO ] Invariant cache hit.
[2023-04-07 00:35:27] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:35:28] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1190 ms to find 0 implicit places.
[2023-04-07 00:35:28] [INFO ] Redundant transitions in 19 ms returned []
[2023-04-07 00:35:28] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:35:28] [INFO ] Invariant cache hit.
[2023-04-07 00:35:29] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1702 ms. Remains : 308/308 places, 1463/1463 transitions.
Graph (trivial) has 1324 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 2 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 266 transition count 317
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 123 place count 205 transition count 302
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 160 place count 183 transition count 302
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 324 place count 101 transition count 220
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 363 place count 101 transition count 181
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 375 place count 95 transition count 181
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 381 place count 95 transition count 175
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 388 place count 95 transition count 168
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 431 place count 95 transition count 125
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 474 place count 52 transition count 125
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 481 place count 52 transition count 125
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 482 place count 52 transition count 125
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 483 place count 52 transition count 124
Applied a total of 483 rules in 19 ms. Remains 52 /308 variables (removed 256) and now considering 124/1463 (removed 1339) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 124 rows 52 cols
[2023-04-07 00:35:29] [INFO ] Computed 15 invariants in 1 ms
[2023-04-07 00:35:29] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 00:35:29] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 00:35:29] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 00:35:29] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 00:35:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 00:35:29] [INFO ] After 19ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 00:35:29] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2023-04-07 00:35:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-04-07 00:35:29] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2023-04-07 00:35:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-04-07 00:35:29] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-04-07 00:35:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-04-07 00:35:29] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-04-07 00:35:29] [INFO ] After 234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p2) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 345 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 318 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 320 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Product exploration explored 100000 steps with 0 reset in 218 ms.
Product exploration explored 100000 steps with 0 reset in 249 ms.
Applying partial POR strategy [true, false, true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 340 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Support contains 5 out of 511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 511/511 places, 1666/1666 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 511 transition count 1666
Performed 147 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 147 Pre rules applied. Total rules applied 7 place count 511 transition count 1904
Deduced a syphon composed of 154 places in 1 ms
Iterating global reduction 1 with 147 rules applied. Total rules applied 154 place count 511 transition count 1904
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 203 places in 1 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 203 place count 511 transition count 1904
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 210 place count 504 transition count 1897
Deduced a syphon composed of 196 places in 2 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 217 place count 504 transition count 1897
Deduced a syphon composed of 196 places in 1 ms
Applied a total of 217 rules in 107 ms. Remains 504 /511 variables (removed 7) and now considering 1897/1666 (removed -231) transitions.
[2023-04-07 00:35:31] [INFO ] Redundant transitions in 32 ms returned []
[2023-04-07 00:35:31] [INFO ] Flow matrix only has 819 transitions (discarded 1078 similar events)
// Phase 1: matrix 819 rows 504 cols
[2023-04-07 00:35:31] [INFO ] Computed 22 invariants in 5 ms
[2023-04-07 00:35:32] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 504/511 places, 1897/1666 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 788 ms. Remains : 504/511 places, 1897/1666 transitions.
Built C files in :
/tmp/ltsmin11588757522081380164
[2023-04-07 00:35:32] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11588757522081380164
Running compilation step : cd /tmp/ltsmin11588757522081380164;'/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/ltsmin11588757522081380164;'/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/ltsmin11588757522081380164;'/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 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 1666/1666 transitions.
Applied a total of 0 rules in 10 ms. Remains 511 /511 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2023-04-07 00:35:35] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2023-04-07 00:35:35] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 00:35:35] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-04-07 00:35:35] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 00:35:35] [INFO ] Invariant cache hit.
[2023-04-07 00:35:35] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:35:37] [INFO ] Implicit Places using invariants and state equation in 1517 ms returned []
Implicit Place search using SMT with State Equation took 1796 ms to find 0 implicit places.
[2023-04-07 00:35:37] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 00:35:37] [INFO ] Invariant cache hit.
[2023-04-07 00:35:37] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2343 ms. Remains : 511/511 places, 1666/1666 transitions.
Built C files in :
/tmp/ltsmin11231024756097532340
[2023-04-07 00:35:37] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11231024756097532340
Running compilation step : cd /tmp/ltsmin11231024756097532340;'/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/ltsmin11231024756097532340;'/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/ltsmin11231024756097532340;'/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)
[2023-04-07 00:35:40] [INFO ] Flatten gal took : 45 ms
[2023-04-07 00:35:40] [INFO ] Flatten gal took : 45 ms
[2023-04-07 00:35:40] [INFO ] Time to serialize gal into /tmp/LTL16329135269747272793.gal : 8 ms
[2023-04-07 00:35:40] [INFO ] Time to serialize properties into /tmp/LTL5019055102433606229.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16329135269747272793.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17693477462210462406.hoa' '-atoms' '/tmp/LTL5019055102433606229.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/LTL5019055102433606229.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17693477462210462406.hoa
Detected timeout of ITS tools.
[2023-04-07 00:35:55] [INFO ] Flatten gal took : 38 ms
[2023-04-07 00:35:56] [INFO ] Flatten gal took : 38 ms
[2023-04-07 00:35:56] [INFO ] Time to serialize gal into /tmp/LTL5399061124567503528.gal : 7 ms
[2023-04-07 00:35:56] [INFO ] Time to serialize properties into /tmp/LTL7654083382326182867.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/LTL5399061124567503528.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7654083382326182867.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G("(((turn_0==0)||(flag_0_waiting==0))||(p25_2_1==0))"))||(G(("((turn_4==0)||(p27_3==0))")||(X("(((turn_0==1)&&(flag_0_waiti...187
Formula 0 simplified : XXX(F!"(((turn_0==0)||(flag_0_waiting==0))||(p25_2_1==0))" & F(!"((turn_4==0)||(p27_3==0))" & X!"(((turn_0==1)&&(flag_0_waiting==1))...173
Detected timeout of ITS tools.
[2023-04-07 00:36:11] [INFO ] Flatten gal took : 37 ms
[2023-04-07 00:36:11] [INFO ] Applying decomposition
[2023-04-07 00:36:11] [INFO ] Flatten gal took : 37 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/graph898689675861423767.txt' '-o' '/tmp/graph898689675861423767.bin' '-w' '/tmp/graph898689675861423767.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph898689675861423767.bin' '-l' '-1' '-v' '-w' '/tmp/graph898689675861423767.weights' '-q' '0' '-e' '0.001'
[2023-04-07 00:36:11] [INFO ] Decomposing Gal with order
[2023-04-07 00:36:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 00:36:11] [INFO ] Removed a total of 2899 redundant transitions.
[2023-04-07 00:36:11] [INFO ] Flatten gal took : 107 ms
[2023-04-07 00:36:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 446 labels/synchronizations in 64 ms.
[2023-04-07 00:36:11] [INFO ] Time to serialize gal into /tmp/LTL4947929654938116738.gal : 13 ms
[2023-04-07 00:36:11] [INFO ] Time to serialize properties into /tmp/LTL10176621568868427387.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/LTL4947929654938116738.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10176621568868427387.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(X(X((G("(((i17.u2.turn_0==0)||(i17.u2.flag_0_waiting==0))||(i17.u2.p25_2_1==0))"))||(G(("((i0.u0.turn_4==0)||(i0.u131.p27_3==0))"...243
Formula 0 simplified : XXX(F!"(((i17.u2.turn_0==0)||(i17.u2.flag_0_waiting==0))||(i17.u2.p25_2_1==0))" & F(!"((i0.u0.turn_4==0)||(i0.u131.p27_3==0))" & X!"...229
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6241481459758847802
[2023-04-07 00:36:26] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6241481459758847802
Running compilation step : cd /tmp/ltsmin6241481459758847802;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2997 ms.
Running link step : cd /tmp/ltsmin6241481459758847802;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6241481459758847802;'/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(X(([]((LTLAPp0==true))||[]((X((LTLAPp2==true))||(LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-04 finished in 109072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 511 transition count 1666
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 511 transition count 1666
Applied a total of 8 rules in 15 ms. Remains 511 /515 variables (removed 4) and now considering 1666/1694 (removed 28) transitions.
[2023-04-07 00:36:41] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 00:36:41] [INFO ] Invariant cache hit.
[2023-04-07 00:36:41] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-04-07 00:36:41] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 00:36:41] [INFO ] Invariant cache hit.
[2023-04-07 00:36:42] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:36:43] [INFO ] Implicit Places using invariants and state equation in 1573 ms returned []
Implicit Place search using SMT with State Equation took 1866 ms to find 0 implicit places.
[2023-04-07 00:36:43] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 00:36:43] [INFO ] Invariant cache hit.
[2023-04-07 00:36:44] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 511/515 places, 1666/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2385 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s11 0) (EQ s377 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 672 ms.
Product exploration explored 100000 steps with 50000 reset in 641 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-07-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-05 finished in 3826 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((G(p1)||G(F(p2)))))))'
Support contains 7 out of 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 515 transition count 1687
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 508 transition count 1687
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 508 transition count 1533
Deduced a syphon composed of 154 places in 0 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 354 transition count 1533
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 326 place count 350 transition count 1505
Iterating global reduction 2 with 4 rules applied. Total rules applied 330 place count 350 transition count 1505
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 414 place count 308 transition count 1463
Applied a total of 414 rules in 64 ms. Remains 308 /515 variables (removed 207) and now considering 1463/1694 (removed 231) transitions.
[2023-04-07 00:36:45] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-07 00:36:45] [INFO ] Computed 22 invariants in 6 ms
[2023-04-07 00:36:45] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-04-07 00:36:45] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:36:45] [INFO ] Invariant cache hit.
[2023-04-07 00:36:45] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:36:46] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 1232 ms to find 0 implicit places.
[2023-04-07 00:36:46] [INFO ] Redundant transitions in 27 ms returned []
[2023-04-07 00:36:46] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:36:46] [INFO ] Invariant cache hit.
[2023-04-07 00:36:47] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 308/515 places, 1463/1694 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1777 ms. Remains : 308/515 places, 1463/1694 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s7 0) (EQ s196 0)), p1:(OR (EQ s3 0) (EQ s269 0)), p2:(AND (EQ s3 1) (EQ s18 1) (EQ s204 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 247 ms.
Product exploration explored 100000 steps with 0 reset in 271 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 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 162 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter insensitive) to 4 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) 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 8) seen :3
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 :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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-04-07 00:36:48] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:36:48] [INFO ] Invariant cache hit.
[2023-04-07 00:36:48] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 00:36:48] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 00:36:48] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 00:36:49] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-04-07 00:36:49] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:36:49] [INFO ] After 85ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :3 sat :2
[2023-04-07 00:36:49] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 0 ms to minimize.
[2023-04-07 00:36:49] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 0 ms to minimize.
[2023-04-07 00:36:49] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2023-04-07 00:36:49] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 1 ms to minimize.
[2023-04-07 00:36:49] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 1 ms to minimize.
[2023-04-07 00:36:50] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 0 ms to minimize.
[2023-04-07 00:36:50] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 1 ms to minimize.
[2023-04-07 00:36:50] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 0 ms to minimize.
[2023-04-07 00:36:50] [INFO ] Deduced a trap composed of 51 places in 106 ms of which 1 ms to minimize.
[2023-04-07 00:36:50] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2023-04-07 00:36:50] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2023-04-07 00:36:50] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2023-04-07 00:36:50] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2023-04-07 00:36:50] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2023-04-07 00:36:50] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1744 ms
[2023-04-07 00:36:51] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 0 ms to minimize.
[2023-04-07 00:36:51] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 0 ms to minimize.
[2023-04-07 00:36:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
[2023-04-07 00:36:51] [INFO ] After 2065ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-04-07 00:36:51] [INFO ] After 2357ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 7 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 37 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 308/308 places, 1463/1463 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Finished probabilistic random walk after 3654 steps, run visited all 2 properties in 44 ms. (steps per millisecond=83 )
Probabilistic random walk after 3654 steps, saw 2922 distinct states, run finished after 44 ms. (steps per millisecond=83 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (G (OR p0 p1)), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 17 factoid took 379 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 308 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 40 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-07 00:36:52] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:36:52] [INFO ] Invariant cache hit.
[2023-04-07 00:36:52] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-04-07 00:36:52] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:36:52] [INFO ] Invariant cache hit.
[2023-04-07 00:36:52] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:36:53] [INFO ] Implicit Places using invariants and state equation in 967 ms returned []
Implicit Place search using SMT with State Equation took 1214 ms to find 0 implicit places.
[2023-04-07 00:36:53] [INFO ] Redundant transitions in 24 ms returned []
[2023-04-07 00:36:53] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:36:53] [INFO ] Invariant cache hit.
[2023-04-07 00:36:53] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1742 ms. Remains : 308/308 places, 1463/1463 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
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 72 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Finished probabilistic random walk after 3654 steps, run visited all 2 properties in 45 ms. (steps per millisecond=81 )
Probabilistic random walk after 3654 steps, saw 2922 distinct states, run finished after 46 ms. (steps per millisecond=79 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 5 factoid took 143 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 86 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 212 ms.
Product exploration explored 100000 steps with 0 reset in 238 ms.
Built C files in :
/tmp/ltsmin11022417427687236583
[2023-04-07 00:36:54] [INFO ] Computing symmetric may disable matrix : 1463 transitions.
[2023-04-07 00:36:54] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 00:36:54] [INFO ] Computing symmetric may enable matrix : 1463 transitions.
[2023-04-07 00:36:54] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 00:36:55] [INFO ] Computing Do-Not-Accords matrix : 1463 transitions.
[2023-04-07 00:36:55] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 00:36:55] [INFO ] Built C files in 333ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11022417427687236583
Running compilation step : cd /tmp/ltsmin11022417427687236583;'/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/ltsmin11022417427687236583;'/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/ltsmin11022417427687236583;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 36 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-07 00:36:58] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:36:58] [INFO ] Invariant cache hit.
[2023-04-07 00:36:58] [INFO ] Implicit Places using invariants in 254 ms returned []
[2023-04-07 00:36:58] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:36:58] [INFO ] Invariant cache hit.
[2023-04-07 00:36:58] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:36:59] [INFO ] Implicit Places using invariants and state equation in 1025 ms returned []
Implicit Place search using SMT with State Equation took 1293 ms to find 0 implicit places.
[2023-04-07 00:36:59] [INFO ] Redundant transitions in 22 ms returned []
[2023-04-07 00:36:59] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:36:59] [INFO ] Invariant cache hit.
[2023-04-07 00:37:00] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1810 ms. Remains : 308/308 places, 1463/1463 transitions.
Built C files in :
/tmp/ltsmin6697377557672033824
[2023-04-07 00:37:00] [INFO ] Computing symmetric may disable matrix : 1463 transitions.
[2023-04-07 00:37:00] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 00:37:00] [INFO ] Computing symmetric may enable matrix : 1463 transitions.
[2023-04-07 00:37:00] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 00:37:00] [INFO ] Computing Do-Not-Accords matrix : 1463 transitions.
[2023-04-07 00:37:00] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 00:37:00] [INFO ] Built C files in 350ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6697377557672033824
Running compilation step : cd /tmp/ltsmin6697377557672033824;'/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/ltsmin6697377557672033824;'/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/ltsmin6697377557672033824;'/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)
[2023-04-07 00:37:03] [INFO ] Flatten gal took : 39 ms
[2023-04-07 00:37:03] [INFO ] Flatten gal took : 32 ms
[2023-04-07 00:37:03] [INFO ] Time to serialize gal into /tmp/LTL12410780354701317948.gal : 10 ms
[2023-04-07 00:37:03] [INFO ] Time to serialize properties into /tmp/LTL8336187252439242589.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/LTL12410780354701317948.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15078444292927950201.hoa' '-atoms' '/tmp/LTL8336187252439242589.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/LTL8336187252439242589.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15078444292927950201.hoa
Detected timeout of ITS tools.
[2023-04-07 00:37:18] [INFO ] Flatten gal took : 32 ms
[2023-04-07 00:37:18] [INFO ] Flatten gal took : 33 ms
[2023-04-07 00:37:18] [INFO ] Time to serialize gal into /tmp/LTL8582068484513641402.gal : 6 ms
[2023-04-07 00:37:18] [INFO ] Time to serialize properties into /tmp/LTL1838854413702960015.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/LTL8582068484513641402.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1838854413702960015.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((X((G("((turn_3==0)||(p37_3_3==0))"))||(G(F("(((turn_3==1)&&(flag_3_active==1))&&(p25_2_4==1))")))))&&("(((turn_0==0)||(flag_0_id...182
Formula 0 simplified : G(!"(((turn_0==0)||(flag_0_idle==0))||(p25_1_2==0))" | X(F!"((turn_3==0)||(p37_3_3==0))" & FG!"(((turn_3==1)&&(flag_3_active==1))&&(...170
Detected timeout of ITS tools.
[2023-04-07 00:37:33] [INFO ] Flatten gal took : 33 ms
[2023-04-07 00:37:33] [INFO ] Applying decomposition
[2023-04-07 00:37:33] [INFO ] Flatten gal took : 33 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/graph13068844577381162773.txt' '-o' '/tmp/graph13068844577381162773.bin' '-w' '/tmp/graph13068844577381162773.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13068844577381162773.bin' '-l' '-1' '-v' '-w' '/tmp/graph13068844577381162773.weights' '-q' '0' '-e' '0.001'
[2023-04-07 00:37:34] [INFO ] Decomposing Gal with order
[2023-04-07 00:37:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 00:37:34] [INFO ] Removed a total of 2979 redundant transitions.
[2023-04-07 00:37:34] [INFO ] Flatten gal took : 158 ms
[2023-04-07 00:37:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 355 labels/synchronizations in 36 ms.
[2023-04-07 00:37:34] [INFO ] Time to serialize gal into /tmp/LTL11967680221132905894.gal : 9 ms
[2023-04-07 00:37:34] [INFO ] Time to serialize properties into /tmp/LTL6586394095205664015.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/LTL11967680221132905894.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6586394095205664015.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((X((G("((i12.u50.turn_3==0)||(i11.i1.u70.p37_3_3==0))"))||(G(F("(((i12.u50.turn_3==1)&&(i6.u0.flag_3_active==1))&&(i0.u2.p25_2_4=...243
Formula 0 simplified : G(!"(((i1.u3.turn_0==0)||(i0.u16.flag_0_idle==0))||(i5.i0.u1.p25_1_2==0))" | X(F!"((i12.u50.turn_3==0)||(i11.i1.u70.p37_3_3==0))" & ...231
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9486383314775166625
[2023-04-07 00:37:49] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9486383314775166625
Running compilation step : cd /tmp/ltsmin9486383314775166625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2443 ms.
Running link step : cd /tmp/ltsmin9486383314775166625;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9486383314775166625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(([]((LTLAPp0==true))||[](<>((LTLAPp1==true)))))&&(LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-06 finished in 79073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 511 transition count 1666
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 511 transition count 1666
Applied a total of 8 rules in 14 ms. Remains 511 /515 variables (removed 4) and now considering 1666/1694 (removed 28) transitions.
[2023-04-07 00:38:04] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2023-04-07 00:38:04] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 00:38:04] [INFO ] Implicit Places using invariants in 331 ms returned []
[2023-04-07 00:38:04] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 00:38:04] [INFO ] Invariant cache hit.
[2023-04-07 00:38:05] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:38:06] [INFO ] Implicit Places using invariants and state equation in 1853 ms returned []
Implicit Place search using SMT with State Equation took 2199 ms to find 0 implicit places.
[2023-04-07 00:38:06] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 00:38:06] [INFO ] Invariant cache hit.
[2023-04-07 00:38:07] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 511/515 places, 1666/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2930 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s21 1) (EQ s131 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 130 reset in 181 ms.
Stack based approach found an accepted trace after 111 steps with 0 reset with depth 112 and stack size 112 in 1 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-07 finished in 3201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1)||X(p0)||G(p2))))'
Support contains 5 out of 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 515 transition count 1687
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 508 transition count 1687
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 153 Pre rules applied. Total rules applied 14 place count 508 transition count 1534
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 320 place count 355 transition count 1534
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 323 place count 352 transition count 1513
Iterating global reduction 2 with 3 rules applied. Total rules applied 326 place count 352 transition count 1513
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 410 place count 310 transition count 1471
Applied a total of 410 rules in 64 ms. Remains 310 /515 variables (removed 205) and now considering 1471/1694 (removed 223) transitions.
[2023-04-07 00:38:07] [INFO ] Flow matrix only has 512 transitions (discarded 959 similar events)
// Phase 1: matrix 512 rows 310 cols
[2023-04-07 00:38:07] [INFO ] Computed 22 invariants in 1 ms
[2023-04-07 00:38:08] [INFO ] Implicit Places using invariants in 382 ms returned []
[2023-04-07 00:38:08] [INFO ] Flow matrix only has 512 transitions (discarded 959 similar events)
[2023-04-07 00:38:08] [INFO ] Invariant cache hit.
[2023-04-07 00:38:08] [INFO ] State equation strengthened by 226 read => feed constraints.
[2023-04-07 00:38:09] [INFO ] Implicit Places using invariants and state equation in 986 ms returned []
Implicit Place search using SMT with State Equation took 1402 ms to find 0 implicit places.
[2023-04-07 00:38:09] [INFO ] Redundant transitions in 18 ms returned []
[2023-04-07 00:38:09] [INFO ] Flow matrix only has 512 transitions (discarded 959 similar events)
[2023-04-07 00:38:09] [INFO ] Invariant cache hit.
[2023-04-07 00:38:09] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 310/515 places, 1471/1694 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2014 ms. Remains : 310/515 places, 1471/1694 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s0 1) (EQ s91 1)), p0:(AND (EQ s5 1) (EQ s286 1)), p2:(EQ s145 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 271 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-08 finished in 2357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||G(F(p2))||p0))))'
Support contains 6 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 512 transition count 1673
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 512 transition count 1673
Applied a total of 6 rules in 13 ms. Remains 512 /515 variables (removed 3) and now considering 1673/1694 (removed 21) transitions.
[2023-04-07 00:38:10] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
// Phase 1: matrix 714 rows 512 cols
[2023-04-07 00:38:10] [INFO ] Computed 22 invariants in 4 ms
[2023-04-07 00:38:10] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-04-07 00:38:10] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2023-04-07 00:38:10] [INFO ] Invariant cache hit.
[2023-04-07 00:38:10] [INFO ] State equation strengthened by 226 read => feed constraints.
[2023-04-07 00:38:11] [INFO ] Implicit Places using invariants and state equation in 1345 ms returned []
Implicit Place search using SMT with State Equation took 1723 ms to find 0 implicit places.
[2023-04-07 00:38:11] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2023-04-07 00:38:11] [INFO ] Invariant cache hit.
[2023-04-07 00:38:12] [INFO ] Dead Transitions using invariants and state equation in 549 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 512/515 places, 1673/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2306 ms. Remains : 512/515 places, 1673/1694 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (EQ s208 1) (AND (EQ s5 1) (EQ s22 1) (EQ s364 1))), p1:(AND (EQ s5 1) (EQ s22 1) (EQ s364 1)), p2:(AND (EQ s1 1) (EQ s133 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 209 ms.
Stack based approach found an accepted trace after 43 steps with 0 reset with depth 44 and stack size 44 in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-10 finished in 2648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0||X((p0||G(p1)))))))))'
Support contains 4 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 511 transition count 1666
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 511 transition count 1666
Applied a total of 8 rules in 18 ms. Remains 511 /515 variables (removed 4) and now considering 1666/1694 (removed 28) transitions.
[2023-04-07 00:38:12] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2023-04-07 00:38:12] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 00:38:13] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-04-07 00:38:13] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 00:38:13] [INFO ] Invariant cache hit.
[2023-04-07 00:38:13] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:38:14] [INFO ] Implicit Places using invariants and state equation in 1482 ms returned []
Implicit Place search using SMT with State Equation took 1787 ms to find 0 implicit places.
[2023-04-07 00:38:14] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 00:38:14] [INFO ] Invariant cache hit.
[2023-04-07 00:38:15] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 511/515 places, 1666/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2394 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s8 1) (EQ s383 1)), p1:(EQ s193 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 214 ms.
Stack based approach found an accepted trace after 102 steps with 0 reset with depth 103 and stack size 103 in 1 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-11 finished in 2767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 515 transition count 1687
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 508 transition count 1687
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 508 transition count 1533
Deduced a syphon composed of 154 places in 0 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 354 transition count 1533
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 326 place count 350 transition count 1505
Iterating global reduction 2 with 4 rules applied. Total rules applied 330 place count 350 transition count 1505
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 412 place count 309 transition count 1464
Applied a total of 412 rules in 59 ms. Remains 309 /515 variables (removed 206) and now considering 1464/1694 (removed 230) transitions.
[2023-04-07 00:38:15] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-07 00:38:15] [INFO ] Computed 22 invariants in 1 ms
[2023-04-07 00:38:16] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-04-07 00:38:16] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 00:38:16] [INFO ] Invariant cache hit.
[2023-04-07 00:38:16] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:38:17] [INFO ] Implicit Places using invariants and state equation in 1049 ms returned []
Implicit Place search using SMT with State Equation took 1456 ms to find 0 implicit places.
[2023-04-07 00:38:17] [INFO ] Redundant transitions in 20 ms returned []
[2023-04-07 00:38:17] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 00:38:17] [INFO ] Invariant cache hit.
[2023-04-07 00:38:17] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 309/515 places, 1464/1694 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2015 ms. Remains : 309/515 places, 1464/1694 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s91 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 188 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-07-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-12 finished in 2252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U (G(p1) U p2))||X(X(F(p3)))))'
Support contains 11 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 512 transition count 1673
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 512 transition count 1673
Applied a total of 6 rules in 20 ms. Remains 512 /515 variables (removed 3) and now considering 1673/1694 (removed 21) transitions.
[2023-04-07 00:38:17] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
// Phase 1: matrix 714 rows 512 cols
[2023-04-07 00:38:17] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 00:38:18] [INFO ] Implicit Places using invariants in 393 ms returned []
[2023-04-07 00:38:18] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2023-04-07 00:38:18] [INFO ] Invariant cache hit.
[2023-04-07 00:38:18] [INFO ] State equation strengthened by 226 read => feed constraints.
[2023-04-07 00:38:19] [INFO ] Implicit Places using invariants and state equation in 1515 ms returned []
Implicit Place search using SMT with State Equation took 1928 ms to find 0 implicit places.
[2023-04-07 00:38:19] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2023-04-07 00:38:19] [INFO ] Invariant cache hit.
[2023-04-07 00:38:20] [INFO ] Dead Transitions using invariants and state equation in 596 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 512/515 places, 1673/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2548 ms. Remains : 512/515 places, 1673/1694 transitions.
Stuttering acceptance computed with spot in 417 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1) (NOT p0)), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 9}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 10}, { cond=(AND p2 p0), acceptance={} source=2 dest: 11}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 5}, { cond=(AND p2 p1), acceptance={} source=3 dest: 7}, { cond=(NOT p1), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 6}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND p2 p1 p0), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 10}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=4 dest: 11}], [{ cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p1 (NOT p3)), acceptance={0} source=5 dest: 7}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=5 dest: 9}], [{ cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={0} source=6 dest: 6}, { cond=(AND p2 p1 (NOT p0) (NOT p3)), acceptance={0} source=6 dest: 7}, { cond=(AND p2 p1 p0 (NOT p3)), acceptance={0} source=6 dest: 8}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=6 dest: 9}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={0} source=6 dest: 10}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={0} source=6 dest: 11}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=7 dest: 9}], [{ cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=8 dest: 7}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=8 dest: 9}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=8 dest: 11}], [{ cond=(NOT p3), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=10 dest: 9}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0} source=10 dest: 10}, { cond=(AND p2 p0 (NOT p3)), acceptance={0} source=10 dest: 11}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=11 dest: 9}, { cond=(AND p0 (NOT p3)), acceptance={} source=11 dest: 11}]], initial=1, aps=[p2:(AND (EQ s6 1) (EQ s27 1) (EQ s383 1)), p1:(AND (EQ s1 1) (EQ s12 1) (EQ s357 1)), p0:(AND (EQ s2 1) (EQ s13 1) (EQ s361 1)), p3:(OR (EQ s5 0) (EQ s133...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 547 ms.
Product exploration explored 100000 steps with 33333 reset in 549 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 p2) (NOT p1) (NOT p0) p3), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (NOT (AND p2 p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) p0 (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 p1 p0 (NOT p3))))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p2 p0 (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 33 factoid took 20 ms. Reduced automaton from 12 states, 40 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-07-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-13 finished in 4115 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 5 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 511 transition count 1666
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 511 transition count 1666
Applied a total of 8 rules in 25 ms. Remains 511 /515 variables (removed 4) and now considering 1666/1694 (removed 28) transitions.
[2023-04-07 00:38:21] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2023-04-07 00:38:21] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 00:38:22] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-04-07 00:38:22] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 00:38:22] [INFO ] Invariant cache hit.
[2023-04-07 00:38:22] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:38:23] [INFO ] Implicit Places using invariants and state equation in 1596 ms returned []
Implicit Place search using SMT with State Equation took 1932 ms to find 0 implicit places.
[2023-04-07 00:38:23] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 00:38:23] [INFO ] Invariant cache hit.
[2023-04-07 00:38:24] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 511/515 places, 1666/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2519 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s20 1) (EQ s417 1) (OR (EQ s207 1) (AND (EQ s10 1) (EQ s414 1)) (AND (EQ s20 1) (EQ s417 1)))), p0:(AND (EQ s10 1) (EQ s414 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-14 finished in 2665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&X(G((p1||X(p0))))) U p2))'
Support contains 6 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 511 transition count 1666
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 511 transition count 1666
Applied a total of 8 rules in 18 ms. Remains 511 /515 variables (removed 4) and now considering 1666/1694 (removed 28) transitions.
[2023-04-07 00:38:24] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 00:38:24] [INFO ] Invariant cache hit.
[2023-04-07 00:38:24] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-04-07 00:38:24] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 00:38:24] [INFO ] Invariant cache hit.
[2023-04-07 00:38:25] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:38:26] [INFO ] Implicit Places using invariants and state equation in 1730 ms returned []
Implicit Place search using SMT with State Equation took 2041 ms to find 0 implicit places.
[2023-04-07 00:38:26] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 00:38:26] [INFO ] Invariant cache hit.
[2023-04-07 00:38:27] [INFO ] Dead Transitions using invariants and state equation in 557 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 511/515 places, 1666/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2632 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s12 1) (EQ s363 1)), p0:(NEQ s270 1), p1:(AND (EQ s1 1) (EQ s10 1) (EQ s384 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 19969 reset in 451 ms.
Stack based approach found an accepted trace after 38527 steps with 7655 reset with depth 6 and stack size 6 in 195 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-15 finished in 3439 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((((F(p2) U p3)&&p1)||p0)))||G(p3)))'
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((G(p0)||G((X(p2)||p1)))))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-07-LTLFireability-04
Stuttering acceptance computed with spot in 320 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Support contains 5 out of 515 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 515 transition count 1687
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 508 transition count 1687
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 508 transition count 1533
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 354 transition count 1533
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 326 place count 350 transition count 1505
Iterating global reduction 2 with 4 rules applied. Total rules applied 330 place count 350 transition count 1505
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 414 place count 308 transition count 1463
Applied a total of 414 rules in 46 ms. Remains 308 /515 variables (removed 207) and now considering 1463/1694 (removed 231) transitions.
[2023-04-07 00:38:28] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-07 00:38:28] [INFO ] Computed 22 invariants in 1 ms
[2023-04-07 00:38:28] [INFO ] Implicit Places using invariants in 372 ms returned []
[2023-04-07 00:38:28] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:38:28] [INFO ] Invariant cache hit.
[2023-04-07 00:38:29] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:38:29] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1290 ms to find 0 implicit places.
[2023-04-07 00:38:29] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:38:29] [INFO ] Invariant cache hit.
[2023-04-07 00:38:30] [INFO ] Dead Transitions using invariants and state equation in 460 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 308/515 places, 1463/1694 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1806 ms. Remains : 308/515 places, 1463/1694 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 8}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 5}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=6, aps=[p2:(AND (EQ s0 1) (EQ s8 1) (EQ s202 1)), p1:(OR (EQ s4 0) (EQ s234 0)), p0:(OR (EQ s0 0) (EQ s8 0) (EQ s202 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 262 ms.
Product exploration explored 100000 steps with 0 reset in 263 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 p2) p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 178768 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 178768 steps, saw 91879 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 15 properties.
[2023-04-07 00:38:34] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:38:34] [INFO ] Invariant cache hit.
[2023-04-07 00:38:34] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-04-07 00:38:34] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 00:38:34] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:13
[2023-04-07 00:38:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 00:38:34] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 00:38:35] [INFO ] After 287ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :9
[2023-04-07 00:38:35] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:38:35] [INFO ] After 306ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :6 sat :9
[2023-04-07 00:38:35] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 0 ms to minimize.
[2023-04-07 00:38:35] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 0 ms to minimize.
[2023-04-07 00:38:35] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 0 ms to minimize.
[2023-04-07 00:38:35] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
[2023-04-07 00:38:36] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2023-04-07 00:38:36] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-07 00:38:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 535 ms
[2023-04-07 00:38:36] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-04-07 00:38:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-04-07 00:38:36] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 0 ms to minimize.
[2023-04-07 00:38:36] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 0 ms to minimize.
[2023-04-07 00:38:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 186 ms
[2023-04-07 00:38:36] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2023-04-07 00:38:36] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2023-04-07 00:38:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2023-04-07 00:38:36] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2023-04-07 00:38:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-04-07 00:38:36] [INFO ] After 1703ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :9
Attempting to minimize the solution found.
Minimization took 292 ms.
[2023-04-07 00:38:37] [INFO ] After 2442ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :9
Fused 15 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 48 ms.
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 28 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 308/308 places, 1463/1463 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) seen :0
Interrupted probabilistic random walk after 138232 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 138232 steps, saw 72987 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 9 properties.
[2023-04-07 00:38:40] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:38:40] [INFO ] Invariant cache hit.
[2023-04-07 00:38:40] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 00:38:40] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 00:38:40] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-07 00:38:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 00:38:41] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 00:38:41] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-07 00:38:41] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:38:41] [INFO ] After 262ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-07 00:38:41] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 0 ms to minimize.
[2023-04-07 00:38:41] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 0 ms to minimize.
[2023-04-07 00:38:41] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 0 ms to minimize.
[2023-04-07 00:38:42] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2023-04-07 00:38:42] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2023-04-07 00:38:42] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2023-04-07 00:38:42] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-07 00:38:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 704 ms
[2023-04-07 00:38:42] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2023-04-07 00:38:42] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2023-04-07 00:38:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2023-04-07 00:38:42] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2023-04-07 00:38:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-04-07 00:38:42] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 0 ms to minimize.
[2023-04-07 00:38:42] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2023-04-07 00:38:42] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2023-04-07 00:38:43] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2023-04-07 00:38:43] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2023-04-07 00:38:43] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2023-04-07 00:38:43] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-04-07 00:38:43] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2023-04-07 00:38:43] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 651 ms
[2023-04-07 00:38:43] [INFO ] After 2228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 372 ms.
[2023-04-07 00:38:43] [INFO ] After 3026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 44 ms.
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 31 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 41 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-07 00:38:44] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:38:44] [INFO ] Invariant cache hit.
[2023-04-07 00:38:44] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-04-07 00:38:44] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:38:44] [INFO ] Invariant cache hit.
[2023-04-07 00:38:44] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:38:45] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
[2023-04-07 00:38:45] [INFO ] Redundant transitions in 21 ms returned []
[2023-04-07 00:38:45] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:38:45] [INFO ] Invariant cache hit.
[2023-04-07 00:38:45] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1649 ms. Remains : 308/308 places, 1463/1463 transitions.
Graph (trivial) has 1324 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 266 transition count 317
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 123 place count 205 transition count 302
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 160 place count 183 transition count 302
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 324 place count 101 transition count 220
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 363 place count 101 transition count 181
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 375 place count 95 transition count 181
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 381 place count 95 transition count 175
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 388 place count 95 transition count 168
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 431 place count 95 transition count 125
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 474 place count 52 transition count 125
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 481 place count 52 transition count 125
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 482 place count 52 transition count 125
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 483 place count 52 transition count 124
Applied a total of 483 rules in 18 ms. Remains 52 /308 variables (removed 256) and now considering 124/1463 (removed 1339) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 124 rows 52 cols
[2023-04-07 00:38:45] [INFO ] Computed 15 invariants in 0 ms
[2023-04-07 00:38:45] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 00:38:45] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-07 00:38:45] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 00:38:45] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-07 00:38:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 00:38:45] [INFO ] After 57ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-07 00:38:45] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2023-04-07 00:38:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-04-07 00:38:46] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2023-04-07 00:38:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-04-07 00:38:46] [INFO ] After 179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-04-07 00:38:46] [INFO ] After 355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), true, (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 106 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 309 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 12 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-07 00:38:46] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-07 00:38:46] [INFO ] Computed 22 invariants in 4 ms
[2023-04-07 00:38:47] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-04-07 00:38:47] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:38:47] [INFO ] Invariant cache hit.
[2023-04-07 00:38:47] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:38:47] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
[2023-04-07 00:38:47] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:38:47] [INFO ] Invariant cache hit.
[2023-04-07 00:38:48] [INFO ] Dead Transitions using invariants and state equation in 441 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1603 ms. Remains : 308/308 places, 1463/1463 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 338 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 343912 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 343912 steps, saw 148920 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-07 00:38:52] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:38:52] [INFO ] Invariant cache hit.
[2023-04-07 00:38:52] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 00:38:52] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 8 ms returned sat
[2023-04-07 00:38:52] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 00:38:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 00:38:52] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 00:38:52] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 00:38:52] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:38:52] [INFO ] After 110ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 00:38:52] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 2 ms to minimize.
[2023-04-07 00:38:52] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 3 ms to minimize.
[2023-04-07 00:38:52] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-04-07 00:38:52] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-04-07 00:38:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 329 ms
[2023-04-07 00:38:53] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2023-04-07 00:38:53] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 0 ms to minimize.
[2023-04-07 00:38:53] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 0 ms to minimize.
[2023-04-07 00:38:53] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2023-04-07 00:38:53] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2023-04-07 00:38:53] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 4 ms to minimize.
[2023-04-07 00:38:53] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
[2023-04-07 00:38:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 634 ms
[2023-04-07 00:38:53] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2023-04-07 00:38:53] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2023-04-07 00:38:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
[2023-04-07 00:38:53] [INFO ] After 1301ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-04-07 00:38:53] [INFO ] After 1638ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 27 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 308/308 places, 1463/1463 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 368800 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 368800 steps, saw 156601 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-07 00:38:57] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:38:57] [INFO ] Invariant cache hit.
[2023-04-07 00:38:57] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 00:38:57] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 00:38:57] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 00:38:57] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 00:38:57] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 6 ms returned sat
[2023-04-07 00:38:57] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 00:38:57] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:38:57] [INFO ] After 116ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 00:38:57] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 0 ms to minimize.
[2023-04-07 00:38:57] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2023-04-07 00:38:57] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-04-07 00:38:57] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-04-07 00:38:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 358 ms
[2023-04-07 00:38:57] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 0 ms to minimize.
[2023-04-07 00:38:58] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2023-04-07 00:38:58] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2023-04-07 00:38:58] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2023-04-07 00:38:58] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 0 ms to minimize.
[2023-04-07 00:38:58] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 0 ms to minimize.
[2023-04-07 00:38:58] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2023-04-07 00:38:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 631 ms
[2023-04-07 00:38:58] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2023-04-07 00:38:58] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2023-04-07 00:38:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 169 ms
[2023-04-07 00:38:58] [INFO ] After 1335ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-04-07 00:38:58] [INFO ] After 1679ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 11 ms.
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 28 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 28 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-07 00:38:58] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:38:58] [INFO ] Invariant cache hit.
[2023-04-07 00:38:59] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-04-07 00:38:59] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:38:59] [INFO ] Invariant cache hit.
[2023-04-07 00:38:59] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:39:00] [INFO ] Implicit Places using invariants and state equation in 910 ms returned []
Implicit Place search using SMT with State Equation took 1166 ms to find 0 implicit places.
[2023-04-07 00:39:00] [INFO ] Redundant transitions in 24 ms returned []
[2023-04-07 00:39:00] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:39:00] [INFO ] Invariant cache hit.
[2023-04-07 00:39:00] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1662 ms. Remains : 308/308 places, 1463/1463 transitions.
Graph (trivial) has 1324 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 266 transition count 317
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 123 place count 205 transition count 302
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 160 place count 183 transition count 302
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 324 place count 101 transition count 220
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 363 place count 101 transition count 181
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 375 place count 95 transition count 181
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 381 place count 95 transition count 175
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 388 place count 95 transition count 168
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 431 place count 95 transition count 125
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 474 place count 52 transition count 125
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 481 place count 52 transition count 125
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 482 place count 52 transition count 125
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 483 place count 52 transition count 124
Applied a total of 483 rules in 19 ms. Remains 52 /308 variables (removed 256) and now considering 124/1463 (removed 1339) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 124 rows 52 cols
[2023-04-07 00:39:00] [INFO ] Computed 15 invariants in 0 ms
[2023-04-07 00:39:00] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 00:39:00] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 00:39:00] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 00:39:00] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 00:39:00] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 00:39:00] [INFO ] After 19ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 00:39:00] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2023-04-07 00:39:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-04-07 00:39:00] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2023-04-07 00:39:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-04-07 00:39:00] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-04-07 00:39:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-04-07 00:39:00] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-04-07 00:39:00] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p2) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 377 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 326 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 344 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Product exploration explored 100000 steps with 0 reset in 215 ms.
Product exploration explored 100000 steps with 0 reset in 233 ms.
Applying partial POR strategy [true, false, true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 342 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 33 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-07 00:39:02] [INFO ] Redundant transitions in 22 ms returned []
[2023-04-07 00:39:02] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-07 00:39:02] [INFO ] Computed 22 invariants in 4 ms
[2023-04-07 00:39:03] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 476 ms. Remains : 308/308 places, 1463/1463 transitions.
Built C files in :
/tmp/ltsmin7913438886732617758
[2023-04-07 00:39:03] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7913438886732617758
Running compilation step : cd /tmp/ltsmin7913438886732617758;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2740 ms.
Running link step : cd /tmp/ltsmin7913438886732617758;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7913438886732617758;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1171269552975781492.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 7 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-07 00:39:18] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:39:18] [INFO ] Invariant cache hit.
[2023-04-07 00:39:18] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-04-07 00:39:18] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:39:18] [INFO ] Invariant cache hit.
[2023-04-07 00:39:18] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 00:39:19] [INFO ] Implicit Places using invariants and state equation in 859 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
[2023-04-07 00:39:19] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 00:39:19] [INFO ] Invariant cache hit.
[2023-04-07 00:39:19] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1535 ms. Remains : 308/308 places, 1463/1463 transitions.
Built C files in :
/tmp/ltsmin16538889585974795138
[2023-04-07 00:39:19] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16538889585974795138
Running compilation step : cd /tmp/ltsmin16538889585974795138;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2387 ms.
Running link step : cd /tmp/ltsmin16538889585974795138;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16538889585974795138;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6752157203159043737.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-07 00:39:35] [INFO ] Flatten gal took : 32 ms
[2023-04-07 00:39:35] [INFO ] Flatten gal took : 31 ms
[2023-04-07 00:39:35] [INFO ] Time to serialize gal into /tmp/LTL1781920219806952593.gal : 6 ms
[2023-04-07 00:39:35] [INFO ] Time to serialize properties into /tmp/LTL9419638292456316909.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1781920219806952593.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7278411391611891559.hoa' '-atoms' '/tmp/LTL9419638292456316909.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/LTL9419638292456316909.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7278411391611891559.hoa
Detected timeout of ITS tools.
[2023-04-07 00:39:50] [INFO ] Flatten gal took : 41 ms
[2023-04-07 00:39:50] [INFO ] Flatten gal took : 32 ms
[2023-04-07 00:39:50] [INFO ] Time to serialize gal into /tmp/LTL12270751056379100924.gal : 5 ms
[2023-04-07 00:39:50] [INFO ] Time to serialize properties into /tmp/LTL15685329001154024944.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/LTL12270751056379100924.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15685329001154024944.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G("(((turn_0==0)||(flag_0_waiting==0))||(p25_2_1==0))"))||(G(("((turn_4==0)||(p27_3==0))")||(X("(((turn_0==1)&&(flag_0_waiti...187
Formula 0 simplified : XXX(F!"(((turn_0==0)||(flag_0_waiting==0))||(p25_2_1==0))" & F(!"((turn_4==0)||(p27_3==0))" & X!"(((turn_0==1)&&(flag_0_waiting==1))...173
Detected timeout of ITS tools.
[2023-04-07 00:40:05] [INFO ] Flatten gal took : 38 ms
[2023-04-07 00:40:05] [INFO ] Applying decomposition
[2023-04-07 00:40:05] [INFO ] Flatten gal took : 31 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/graph11586952662444497184.txt' '-o' '/tmp/graph11586952662444497184.bin' '-w' '/tmp/graph11586952662444497184.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11586952662444497184.bin' '-l' '-1' '-v' '-w' '/tmp/graph11586952662444497184.weights' '-q' '0' '-e' '0.001'
[2023-04-07 00:40:05] [INFO ] Decomposing Gal with order
[2023-04-07 00:40:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 00:40:05] [INFO ] Removed a total of 2933 redundant transitions.
[2023-04-07 00:40:05] [INFO ] Flatten gal took : 111 ms
[2023-04-07 00:40:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 407 labels/synchronizations in 40 ms.
[2023-04-07 00:40:05] [INFO ] Time to serialize gal into /tmp/LTL1446370230441247584.gal : 39 ms
[2023-04-07 00:40:05] [INFO ] Time to serialize properties into /tmp/LTL7691202863303897102.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/LTL1446370230441247584.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7691202863303897102.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G("(((i0.u1.turn_0==0)||(i10.u45.flag_0_waiting==0))||(i9.u44.p25_2_1==0))"))||(G(("((i0.u42.turn_4==0)||(i0.u47.p27_3==0))"...243
Formula 0 simplified : XXX(F!"(((i0.u1.turn_0==0)||(i10.u45.flag_0_waiting==0))||(i9.u44.p25_2_1==0))" & F(!"((i0.u42.turn_4==0)||(i0.u47.p27_3==0))" & X!"...229
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8585423009864082957
[2023-04-07 00:40:20] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8585423009864082957
Running compilation step : cd /tmp/ltsmin8585423009864082957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2531 ms.
Running link step : cd /tmp/ltsmin8585423009864082957;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8585423009864082957;'/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(X(([]((LTLAPp0==true))||[]((X((LTLAPp2==true))||(LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-04 finished in 127790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((G(p1)||G(F(p2)))))))'
[2023-04-07 00:40:36] [INFO ] Flatten gal took : 38 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1488353150448561662
[2023-04-07 00:40:36] [INFO ] Too many transitions (1694) to apply POR reductions. Disabling POR matrices.
[2023-04-07 00:40:36] [INFO ] Applying decomposition
[2023-04-07 00:40:36] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1488353150448561662
Running compilation step : cd /tmp/ltsmin1488353150448561662;'/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'
[2023-04-07 00:40:36] [INFO ] Flatten gal took : 50 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/graph221348916367475154.txt' '-o' '/tmp/graph221348916367475154.bin' '-w' '/tmp/graph221348916367475154.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph221348916367475154.bin' '-l' '-1' '-v' '-w' '/tmp/graph221348916367475154.weights' '-q' '0' '-e' '0.001'
[2023-04-07 00:40:36] [INFO ] Decomposing Gal with order
[2023-04-07 00:40:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 00:40:36] [INFO ] Removed a total of 3043 redundant transitions.
[2023-04-07 00:40:36] [INFO ] Flatten gal took : 126 ms
[2023-04-07 00:40:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 469 labels/synchronizations in 29 ms.
[2023-04-07 00:40:36] [INFO ] Time to serialize gal into /tmp/LTLFireability4621907432003989202.gal : 8 ms
[2023-04-07 00:40:36] [INFO ] Time to serialize properties into /tmp/LTLFireability16350608011587949019.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/LTLFireability4621907432003989202.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16350608011587949019.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 : !(((G(F(("((i1.u4.turn_4==0)||(i12.u3.flag_4_active==0))")||(("(i11.i3.u5.p25_4_0==0)")||(("((i1.u6.flag_2_idle==1)&&(i13.i0.u89.p18_3...404
Formula 0 simplified : FG(!"((i1.u4.turn_4==0)||(i12.u3.flag_4_active==0))" & !"(i11.i3.u5.p25_4_0==0)" & (!"((i1.u6.flag_2_idle==1)&&(i13.i0.u89.p18_3_2==...391
Compilation finished in 3285 ms.
Running link step : cd /tmp/ltsmin1488353150448561662;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin1488353150448561662;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>((((<>((LTLAPp2==true)) U (LTLAPp3==true))&&(LTLAPp1==true))||(LTLAPp0==true))))||[]((LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin1488353150448561662;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>((((<>((LTLAPp2==true)) U (LTLAPp3==true))&&(LTLAPp1==true))||(LTLAPp0==true))))||[]((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1488353150448561662;'/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(X(([]((LTLAPp4==true))||[]((X((LTLAPp6==true))||(LTLAPp5==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-04-07 01:03:16] [INFO ] Applying decomposition
[2023-04-07 01:03:16] [INFO ] Flatten gal took : 188 ms
[2023-04-07 01:03:16] [INFO ] Decomposing Gal with order
[2023-04-07 01:03:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 01:03:16] [INFO ] Removed a total of 3386 redundant transitions.
[2023-04-07 01:03:16] [INFO ] Flatten gal took : 337 ms
[2023-04-07 01:03:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 162 labels/synchronizations in 104 ms.
[2023-04-07 01:03:17] [INFO ] Time to serialize gal into /tmp/LTLFireability9914279844434736742.gal : 26 ms
[2023-04-07 01:03:17] [INFO ] Time to serialize properties into /tmp/LTLFireability9278866610529391224.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/LTLFireability9914279844434736742.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9278866610529391224.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 : !(((G(F(("((u9.turn_4==0)||(u14.flag_4_active==0))")||(("(u7.p25_4_0==0)")||(("((u12.flag_2_idle==1)&&(u6.p18_3_2==1))")&&((F("(((u9.t...350
Formula 0 simplified : FG(!"((u9.turn_4==0)||(u14.flag_4_active==0))" & !"(u7.p25_4_0==0)" & (!"((u12.flag_2_idle==1)&&(u6.p18_3_2==1))" | (G!"(((u9.turn_4...337
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin1488353150448561662;'/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(X(([]((LTLAPp4==true))||[]((X((LTLAPp6==true))||(LTLAPp5==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1488353150448561662;'/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' '<>(((LTLAPp7==true)&&X(([]((LTLAPp8==true))||[](<>((LTLAPp9==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-04-07 01:25:57] [INFO ] Flatten gal took : 139 ms
[2023-04-07 01:25:57] [INFO ] Input system was already deterministic with 1694 transitions.
[2023-04-07 01:25:57] [INFO ] Transformed 515 places.
[2023-04-07 01:25:57] [INFO ] Transformed 1694 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
[2023-04-07 01:25:58] [INFO ] Time to serialize gal into /tmp/LTLFireability6994037807658765750.gal : 14 ms
[2023-04-07 01:25:58] [INFO ] Time to serialize properties into /tmp/LTLFireability5875861019581190426.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/LTLFireability6994037807658765750.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5875861019581190426.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...342
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G(F(("((turn_4==0)||(flag_4_active==0))")||(("(p25_4_0==0)")||(("((flag_2_idle==1)&&(p18_3_2==1))")&&((F("(((turn_4==1)&&(flag_4_a...303
Formula 0 simplified : FG(!"((turn_4==0)||(flag_4_active==0))" & !"(p25_4_0==0)" & (!"((flag_2_idle==1)&&(p18_3_2==1))" | (G!"(((turn_4==1)&&(flag_4_active...290
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8297600 kB
After kill :
MemTotal: 16393216 kB
MemFree: 14769284 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-07"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-5348"
echo " Executing tool itstools"
echo " Input is EisenbergMcGuire-PT-07, 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 r517-tall-167987243600252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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