Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r175-smll-171636279900103.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is EisenbergMcGuire-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-171636279900103
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 16:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 16:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 16:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 460K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716538994263

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-05
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 08:23:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 08:23:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 08:23:17] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2024-05-24 08:23:17] [INFO ] Transformed 295 places.
[2024-05-24 08:23:17] [INFO ] Transformed 800 transitions.
[2024-05-24 08:23:17] [INFO ] Found NUPN structural information;
[2024-05-24 08:23:17] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 301 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 800/800 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 280 transition count 725
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 280 transition count 725
Applied a total of 30 rules in 87 ms. Remains 280 /295 variables (removed 15) and now considering 725/800 (removed 75) transitions.
[2024-05-24 08:23:17] [INFO ] Flow matrix only has 390 transitions (discarded 335 similar events)
// Phase 1: matrix 390 rows 280 cols
[2024-05-24 08:23:17] [INFO ] Computed 16 invariants in 19 ms
[2024-05-24 08:23:17] [INFO ] Implicit Places using invariants in 510 ms returned []
[2024-05-24 08:23:17] [INFO ] Flow matrix only has 390 transitions (discarded 335 similar events)
[2024-05-24 08:23:17] [INFO ] Invariant cache hit.
[2024-05-24 08:23:18] [INFO ] State equation strengthened by 136 read => feed constraints.
[2024-05-24 08:23:18] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
[2024-05-24 08:23:18] [INFO ] Flow matrix only has 390 transitions (discarded 335 similar events)
[2024-05-24 08:23:18] [INFO ] Invariant cache hit.
[2024-05-24 08:23:19] [INFO ] Dead Transitions using invariants and state equation in 560 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 280/295 places, 725/800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1979 ms. Remains : 280/295 places, 725/800 transitions.
Support contains 40 out of 280 places after structural reductions.
[2024-05-24 08:23:19] [INFO ] Flatten gal took : 112 ms
[2024-05-24 08:23:19] [INFO ] Flatten gal took : 60 ms
[2024-05-24 08:23:19] [INFO ] Input system was already deterministic with 725 transitions.
Support contains 39 out of 280 places (down from 40) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 690 ms. (steps per millisecond=14 ) properties (out of 23) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) 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 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) 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 17) 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 17) seen :0
Running SMT prover for 17 properties.
[2024-05-24 08:23:20] [INFO ] Flow matrix only has 390 transitions (discarded 335 similar events)
[2024-05-24 08:23:20] [INFO ] Invariant cache hit.
[2024-05-24 08:23:20] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-24 08:23:20] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 5 ms returned sat
[2024-05-24 08:23:21] [INFO ] After 659ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-05-24 08:23:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-05-24 08:23:21] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-24 08:23:22] [INFO ] After 481ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2024-05-24 08:23:22] [INFO ] State equation strengthened by 136 read => feed constraints.
[2024-05-24 08:23:22] [INFO ] After 409ms SMT Verify possible using 136 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2024-05-24 08:23:22] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 8 ms to minimize.
[2024-05-24 08:23:23] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 1 ms to minimize.
[2024-05-24 08:23:23] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 1 ms to minimize.
[2024-05-24 08:23:23] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 2 ms to minimize.
[2024-05-24 08:23:23] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-05-24 08:23:23] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 0 ms to minimize.
[2024-05-24 08:23:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 859 ms
[2024-05-24 08:23:23] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2024-05-24 08:23:23] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-24 08:23:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 210 ms
[2024-05-24 08:23:23] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:23:24] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-05-24 08:23:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 261 ms
[2024-05-24 08:23:24] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 1 ms to minimize.
[2024-05-24 08:23:24] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-24 08:23:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 247 ms
[2024-05-24 08:23:24] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 1 ms to minimize.
[2024-05-24 08:23:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2024-05-24 08:23:24] [INFO ] Deduced a trap composed of 75 places in 154 ms of which 1 ms to minimize.
[2024-05-24 08:23:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2024-05-24 08:23:25] [INFO ] Deduced a trap composed of 70 places in 170 ms of which 1 ms to minimize.
[2024-05-24 08:23:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2024-05-24 08:23:25] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 1 ms to minimize.
[2024-05-24 08:23:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2024-05-24 08:23:25] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
[2024-05-24 08:23:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-05-24 08:23:25] [INFO ] After 3357ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 471 ms.
[2024-05-24 08:23:26] [INFO ] After 4664ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 0 properties in 404 ms.
Support contains 30 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 280 transition count 721
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 276 transition count 721
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 8 place count 276 transition count 649
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 152 place count 204 transition count 649
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 203 transition count 644
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 203 transition count 644
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 194 place count 183 transition count 624
Applied a total of 194 rules in 100 ms. Remains 183 /280 variables (removed 97) and now considering 624/725 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 183/280 places, 624/725 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) seen :0
Interrupted probabilistic random walk after 357738 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{1=1, 3=1, 4=1, 5=1, 6=1, 9=1, 10=1, 11=1, 13=1, 15=1}
Probabilistic random walk after 357738 steps, saw 85359 distinct states, run finished after 3002 ms. (steps per millisecond=119 ) properties seen :10
Running SMT prover for 6 properties.
[2024-05-24 08:23:30] [INFO ] Flow matrix only has 289 transitions (discarded 335 similar events)
// Phase 1: matrix 289 rows 183 cols
[2024-05-24 08:23:30] [INFO ] Computed 16 invariants in 7 ms
[2024-05-24 08:23:30] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-24 08:23:30] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-24 08:23:30] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 08:23:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-24 08:23:30] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-24 08:23:30] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 08:23:30] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 08:23:30] [INFO ] After 116ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-24 08:23:30] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 0 ms to minimize.
[2024-05-24 08:23:30] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 0 ms to minimize.
[2024-05-24 08:23:31] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 1 ms to minimize.
[2024-05-24 08:23:31] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 08:23:31] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-24 08:23:31] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 1 ms to minimize.
[2024-05-24 08:23:31] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2024-05-24 08:23:31] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 1 ms to minimize.
[2024-05-24 08:23:31] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 914 ms
[2024-05-24 08:23:31] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 1 ms to minimize.
[2024-05-24 08:23:31] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-24 08:23:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2024-05-24 08:23:31] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-24 08:23:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-05-24 08:23:31] [INFO ] After 1413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 107 ms.
[2024-05-24 08:23:32] [INFO ] After 1815ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 41 ms.
Support contains 16 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 624/624 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 183 transition count 617
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 176 transition count 617
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 172 transition count 597
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 172 transition count 597
Applied a total of 22 rules in 36 ms. Remains 172 /183 variables (removed 11) and now considering 597/624 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 172/183 places, 597/624 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 6) 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 6) 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 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 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 451890 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{1=1}
Probabilistic random walk after 451890 steps, saw 93312 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :1
Running SMT prover for 5 properties.
[2024-05-24 08:23:35] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2024-05-24 08:23:35] [INFO ] Computed 16 invariants in 6 ms
[2024-05-24 08:23:35] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2024-05-24 08:23:35] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 5 ms returned sat
[2024-05-24 08:23:35] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-24 08:23:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-24 08:23:35] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-24 08:23:36] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-24 08:23:36] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:23:36] [INFO ] After 96ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-24 08:23:36] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 0 ms to minimize.
[2024-05-24 08:23:36] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:23:36] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2024-05-24 08:23:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 289 ms
[2024-05-24 08:23:36] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-24 08:23:36] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-24 08:23:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2024-05-24 08:23:36] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-24 08:23:36] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-24 08:23:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 110 ms
[2024-05-24 08:23:36] [INFO ] After 706ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 77 ms.
[2024-05-24 08:23:36] [INFO ] After 1053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 22 ms.
Support contains 14 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 172 transition count 596
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 171 transition count 596
Applied a total of 2 rules in 30 ms. Remains 171 /172 variables (removed 1) and now considering 596/597 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 171/172 places, 596/597 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) 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 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 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 464538 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :{}
Probabilistic random walk after 464538 steps, saw 94986 distinct states, run finished after 3002 ms. (steps per millisecond=154 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-24 08:23:40] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-24 08:23:40] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 08:23:40] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-24 08:23:40] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-24 08:23:40] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-24 08:23:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-24 08:23:40] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-24 08:23:40] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-24 08:23:40] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:23:40] [INFO ] After 96ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-24 08:23:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-24 08:23:40] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 1 ms to minimize.
[2024-05-24 08:23:40] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 1 ms to minimize.
[2024-05-24 08:23:40] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 1 ms to minimize.
[2024-05-24 08:23:41] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2024-05-24 08:23:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 510 ms
[2024-05-24 08:23:41] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-24 08:23:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-24 08:23:41] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 0 ms to minimize.
[2024-05-24 08:23:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-24 08:23:41] [INFO ] After 830ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 79 ms.
[2024-05-24 08:23:41] [INFO ] After 1170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 14 ms.
Support contains 14 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 18 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 171/171 places, 596/596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 17 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2024-05-24 08:23:41] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:23:41] [INFO ] Invariant cache hit.
[2024-05-24 08:23:41] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-24 08:23:41] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:23:41] [INFO ] Invariant cache hit.
[2024-05-24 08:23:41] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:23:42] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
[2024-05-24 08:23:42] [INFO ] Redundant transitions in 41 ms returned []
[2024-05-24 08:23:42] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:23:42] [INFO ] Invariant cache hit.
[2024-05-24 08:23:42] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1243 ms. Remains : 171/171 places, 596/596 transitions.
Graph (trivial) has 480 edges and 171 vertex of which 25 / 171 are part of one of the 5 SCC in 4 ms
Free SCC test removed 20 places
Drop transitions removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 151 transition count 172
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 122 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 121 transition count 171
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 61 place count 121 transition count 160
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 88 place count 105 transition count 160
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 160 place count 69 transition count 124
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 173 place count 69 transition count 111
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -71
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 189 place count 61 transition count 182
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 192 place count 61 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 200 place count 61 transition count 171
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 204 place count 61 transition count 167
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 208 place count 57 transition count 167
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 6 with 24 rules applied. Total rules applied 232 place count 57 transition count 167
Applied a total of 232 rules in 40 ms. Remains 57 /171 variables (removed 114) and now considering 167/596 (removed 429) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 167 rows 57 cols
[2024-05-24 08:23:42] [INFO ] Computed 11 invariants in 1 ms
[2024-05-24 08:23:42] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:42] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-24 08:23:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:42] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-24 08:23:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-24 08:23:43] [INFO ] After 77ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-24 08:23:43] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-24 08:23:43] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 2 ms to minimize.
[2024-05-24 08:23:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 55 ms
[2024-05-24 08:23:43] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-24 08:23:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-05-24 08:23:43] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-05-24 08:23:43] [INFO ] After 479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA EisenbergMcGuire-PT-05-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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((F(!(X(p0)||X(F(p1)))) U p2)))'
Support contains 7 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 276 transition count 705
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 276 transition count 705
Applied a total of 8 rules in 13 ms. Remains 276 /280 variables (removed 4) and now considering 705/725 (removed 20) transitions.
[2024-05-24 08:23:43] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
// Phase 1: matrix 370 rows 276 cols
[2024-05-24 08:23:43] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 08:23:43] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-24 08:23:43] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2024-05-24 08:23:43] [INFO ] Invariant cache hit.
[2024-05-24 08:23:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-24 08:23:44] [INFO ] Implicit Places using invariants and state equation in 794 ms returned []
Implicit Place search using SMT with State Equation took 1000 ms to find 0 implicit places.
[2024-05-24 08:23:44] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2024-05-24 08:23:44] [INFO ] Invariant cache hit.
[2024-05-24 08:23:44] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 276/280 places, 705/725 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1413 ms. Remains : 276/280 places, 705/725 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 381 ms :[(NOT p2), (NOT p2), (OR (NOT p2) p1 p0), (OR p1 p0), p1]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(OR p0 p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s3 1) (EQ s16 1) (EQ s205 1)), p0:(AND (EQ s7 1) (EQ s221 1)), p1:(AND (EQ s0 1) (EQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 412 ms.
Stack based approach found an accepted trace after 91 steps with 0 reset with depth 92 and stack size 92 in 1 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-00 finished in 2285 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 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 275 transition count 641
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 196 transition count 641
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 173 place count 191 transition count 616
Iterating global reduction 2 with 5 rules applied. Total rules applied 178 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 596
Applied a total of 218 rules in 63 ms. Remains 171 /280 variables (removed 109) and now considering 596/725 (removed 129) transitions.
[2024-05-24 08:23:45] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-24 08:23:45] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 08:23:46] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-24 08:23:46] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:23:46] [INFO ] Invariant cache hit.
[2024-05-24 08:23:46] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:23:46] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
[2024-05-24 08:23:46] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-24 08:23:46] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:23:46] [INFO ] Invariant cache hit.
[2024-05-24 08:23:46] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 171/280 places, 596/725 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1232 ms. Remains : 171/280 places, 596/725 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-01 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 s60 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 223 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-05-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-01 finished in 1511 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((F(p0)&&G(p1)))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 275 transition count 700
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 275 transition count 700
Applied a total of 10 rules in 12 ms. Remains 275 /280 variables (removed 5) and now considering 700/725 (removed 25) transitions.
[2024-05-24 08:23:47] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2024-05-24 08:23:47] [INFO ] Computed 16 invariants in 3 ms
[2024-05-24 08:23:47] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-24 08:23:47] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 08:23:47] [INFO ] Invariant cache hit.
[2024-05-24 08:23:47] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:23:48] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 1036 ms to find 0 implicit places.
[2024-05-24 08:23:48] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 08:23:48] [INFO ] Invariant cache hit.
[2024-05-24 08:23:48] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/280 places, 700/725 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1599 ms. Remains : 275/280 places, 700/725 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (EQ s19 1) (EQ s239 1)), p0:(AND (EQ s17 1) (EQ s229 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-04 finished in 1790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1)||G(p2)))'
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 275 transition count 700
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 275 transition count 700
Applied a total of 10 rules in 10 ms. Remains 275 /280 variables (removed 5) and now considering 700/725 (removed 25) transitions.
[2024-05-24 08:23:49] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 08:23:49] [INFO ] Invariant cache hit.
[2024-05-24 08:23:49] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-24 08:23:49] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 08:23:49] [INFO ] Invariant cache hit.
[2024-05-24 08:23:49] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:23:50] [INFO ] Implicit Places using invariants and state equation in 827 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
[2024-05-24 08:23:50] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 08:23:50] [INFO ] Invariant cache hit.
[2024-05-24 08:23:50] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/280 places, 700/725 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1527 ms. Remains : 275/280 places, 700/725 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (EQ s9 1) (EQ s236 1)), p1:(AND (EQ s3 1) (EQ s14 1) (EQ s190 1)), p2:(OR (EQ s4 0) (EQ s17 0) (EQ s187 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 165 ms.
Product exploration explored 100000 steps with 0 reset in 349 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), true, (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X p2))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 198 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) 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 718932 steps, run timeout after 3001 ms. (steps per millisecond=239 ) properties seen :{}
Probabilistic random walk after 718932 steps, saw 248605 distinct states, run finished after 3005 ms. (steps per millisecond=239 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 08:23:54] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 08:23:54] [INFO ] Invariant cache hit.
[2024-05-24 08:23:54] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:23:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-24 08:23:54] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-24 08:23:54] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:23:54] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:23:54] [INFO ] After 39ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:23:55] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 0 ms to minimize.
[2024-05-24 08:23:55] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:23:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 228 ms
[2024-05-24 08:23:55] [INFO ] After 295ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-24 08:23:55] [INFO ] After 548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 700/700 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 275 transition count 695
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 270 transition count 695
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 10 place count 270 transition count 615
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 170 place count 190 transition count 615
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 210 place count 170 transition count 595
Applied a total of 210 rules in 54 ms. Remains 170 /275 variables (removed 105) and now considering 595/700 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 170/275 places, 595/700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 824586 steps, run timeout after 3001 ms. (steps per millisecond=274 ) properties seen :{}
Probabilistic random walk after 824586 steps, saw 158451 distinct states, run finished after 3001 ms. (steps per millisecond=274 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 08:23:58] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-05-24 08:23:58] [INFO ] Computed 16 invariants in 5 ms
[2024-05-24 08:23:58] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:23:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-24 08:23:58] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-24 08:23:58] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:23:58] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:23:58] [INFO ] After 35ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:23:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-24 08:23:58] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-24 08:23:58] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-24 08:23:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 159 ms
[2024-05-24 08:23:58] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-24 08:23:58] [INFO ] After 421ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 13 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 170/170 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 13 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-05-24 08:23:58] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 08:23:58] [INFO ] Invariant cache hit.
[2024-05-24 08:23:59] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-24 08:23:59] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 08:23:59] [INFO ] Invariant cache hit.
[2024-05-24 08:23:59] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:23:59] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
[2024-05-24 08:23:59] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-24 08:23:59] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 08:23:59] [INFO ] Invariant cache hit.
[2024-05-24 08:23:59] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1175 ms. Remains : 170/170 places, 595/595 transitions.
Graph (trivial) has 522 edges and 170 vertex of which 25 / 170 are part of one of the 5 SCC in 1 ms
Free SCC test removed 20 places
Drop transitions removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 150 transition count 167
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 117 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 67 place count 117 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 94 place count 101 transition count 156
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 172 place count 62 transition count 117
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 190 place count 62 transition count 99
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 210 place count 52 transition count 174
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 215 place count 52 transition count 169
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 221 place count 52 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 222 place count 52 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 223 place count 51 transition count 162
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 248 place count 51 transition count 162
Applied a total of 248 rules in 24 ms. Remains 51 /170 variables (removed 119) and now considering 162/595 (removed 433) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 162 rows 51 cols
[2024-05-24 08:23:59] [INFO ] Computed 11 invariants in 3 ms
[2024-05-24 08:24:00] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:24:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-24 08:24:00] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:24:00] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-24 08:24:00] [INFO ] After 12ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:24:00] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-24 08:24:00] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-05-24 08:24:00] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-24 08:24:00] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-05-24 08:24:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 94 ms
[2024-05-24 08:24:00] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-24 08:24:00] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), true, (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 200 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p2)]
Support contains 3 out of 275 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 : 275/275 places, 700/700 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 275 transition count 695
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 270 transition count 695
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 270 transition count 616
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 208 place count 171 transition count 596
Applied a total of 208 rules in 33 ms. Remains 171 /275 variables (removed 104) and now considering 596/700 (removed 104) transitions.
[2024-05-24 08:24:00] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-24 08:24:00] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 08:24:00] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-24 08:24:00] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:24:00] [INFO ] Invariant cache hit.
[2024-05-24 08:24:00] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:24:01] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
[2024-05-24 08:24:01] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-24 08:24:01] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:24:01] [INFO ] Invariant cache hit.
[2024-05-24 08:24:01] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 171/275 places, 596/700 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1164 ms. Remains : 171/275 places, 596/700 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 : [p2, (X p2), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) 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 843990 steps, run timeout after 3001 ms. (steps per millisecond=281 ) properties seen :{}
Probabilistic random walk after 843990 steps, saw 161837 distinct states, run finished after 3001 ms. (steps per millisecond=281 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 08:24:04] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:24:04] [INFO ] Invariant cache hit.
[2024-05-24 08:24:04] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:24:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-24 08:24:04] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-24 08:24:05] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:24:05] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:24:05] [INFO ] After 33ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:24:05] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2024-05-24 08:24:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-05-24 08:24:05] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-24 08:24:05] [INFO ] After 302ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 171 transition count 595
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 170 transition count 595
Applied a total of 2 rules in 14 ms. Remains 170 /171 variables (removed 1) and now considering 595/596 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 170/171 places, 595/596 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) 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 847296 steps, run timeout after 3001 ms. (steps per millisecond=282 ) properties seen :{}
Probabilistic random walk after 847296 steps, saw 162340 distinct states, run finished after 3001 ms. (steps per millisecond=282 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 08:24:08] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-05-24 08:24:08] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 08:24:08] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:24:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-24 08:24:08] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-24 08:24:08] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:24:08] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:24:08] [INFO ] After 34ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:24:08] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-24 08:24:08] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-24 08:24:08] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-24 08:24:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 148 ms
[2024-05-24 08:24:08] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-24 08:24:08] [INFO ] After 385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 11 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 170/170 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 10 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-05-24 08:24:08] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 08:24:08] [INFO ] Invariant cache hit.
[2024-05-24 08:24:08] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-24 08:24:08] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 08:24:08] [INFO ] Invariant cache hit.
[2024-05-24 08:24:09] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:24:09] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
[2024-05-24 08:24:09] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-24 08:24:09] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 08:24:09] [INFO ] Invariant cache hit.
[2024-05-24 08:24:09] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1127 ms. Remains : 170/170 places, 595/595 transitions.
Graph (trivial) has 522 edges and 170 vertex of which 25 / 170 are part of one of the 5 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 150 transition count 167
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 117 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 67 place count 117 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 94 place count 101 transition count 156
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 172 place count 62 transition count 117
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 190 place count 62 transition count 99
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 210 place count 52 transition count 174
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 215 place count 52 transition count 169
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 221 place count 52 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 222 place count 52 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 223 place count 51 transition count 162
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 248 place count 51 transition count 162
Applied a total of 248 rules in 21 ms. Remains 51 /170 variables (removed 119) and now considering 162/595 (removed 433) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 162 rows 51 cols
[2024-05-24 08:24:09] [INFO ] Computed 11 invariants in 1 ms
[2024-05-24 08:24:09] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:24:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-24 08:24:09] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:24:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-24 08:24:10] [INFO ] After 13ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:24:10] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-24 08:24:10] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-05-24 08:24:10] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-24 08:24:10] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-24 08:24:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 128 ms
[2024-05-24 08:24:10] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-24 08:24:10] [INFO ] After 262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p2, (X p2), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 176 ms.
Product exploration explored 100000 steps with 0 reset in 188 ms.
Built C files in :
/tmp/ltsmin10263684132338449615
[2024-05-24 08:24:10] [INFO ] Computing symmetric may disable matrix : 596 transitions.
[2024-05-24 08:24:10] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 08:24:10] [INFO ] Computing symmetric may enable matrix : 596 transitions.
[2024-05-24 08:24:10] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 08:24:10] [INFO ] Computing Do-Not-Accords matrix : 596 transitions.
[2024-05-24 08:24:11] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 08:24:11] [INFO ] Built C files in 128ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10263684132338449615
Running compilation step : cd /tmp/ltsmin10263684132338449615;'/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 2252 ms.
Running link step : cd /tmp/ltsmin10263684132338449615;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin10263684132338449615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8319854639416286714.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 596/596 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 171 transition count 595
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 170 transition count 595
Applied a total of 2 rules in 16 ms. Remains 170 /171 variables (removed 1) and now considering 595/596 (removed 1) transitions.
[2024-05-24 08:24:25] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-05-24 08:24:25] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 08:24:26] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-24 08:24:26] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 08:24:26] [INFO ] Invariant cache hit.
[2024-05-24 08:24:26] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:24:26] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
[2024-05-24 08:24:26] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-24 08:24:26] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 08:24:26] [INFO ] Invariant cache hit.
[2024-05-24 08:24:26] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/171 places, 595/596 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1020 ms. Remains : 170/171 places, 595/596 transitions.
Built C files in :
/tmp/ltsmin12546833430127383081
[2024-05-24 08:24:26] [INFO ] Computing symmetric may disable matrix : 595 transitions.
[2024-05-24 08:24:26] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 08:24:26] [INFO ] Computing symmetric may enable matrix : 595 transitions.
[2024-05-24 08:24:26] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 08:24:27] [INFO ] Computing Do-Not-Accords matrix : 595 transitions.
[2024-05-24 08:24:27] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 08:24:27] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12546833430127383081
Running compilation step : cd /tmp/ltsmin12546833430127383081;'/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 1918 ms.
Running link step : cd /tmp/ltsmin12546833430127383081;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12546833430127383081;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7692319563675893967.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 08:24:42] [INFO ] Flatten gal took : 46 ms
[2024-05-24 08:24:42] [INFO ] Flatten gal took : 43 ms
[2024-05-24 08:24:42] [INFO ] Time to serialize gal into /tmp/LTL13904655499208600729.gal : 7 ms
[2024-05-24 08:24:42] [INFO ] Time to serialize properties into /tmp/LTL16769684695415065807.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/LTL13904655499208600729.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6633189407851106640.hoa' '-atoms' '/tmp/LTL16769684695415065807.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/LTL16769684695415065807.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6633189407851106640.hoa
Detected timeout of ITS tools.
[2024-05-24 08:24:57] [INFO ] Flatten gal took : 39 ms
[2024-05-24 08:24:57] [INFO ] Flatten gal took : 36 ms
[2024-05-24 08:24:57] [INFO ] Time to serialize gal into /tmp/LTL15629917376177264906.gal : 13 ms
[2024-05-24 08:24:57] [INFO ] Time to serialize properties into /tmp/LTL11490965200803699563.ltl : 8 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/LTL15629917376177264906.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11490965200803699563.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("((flag_1_waiting==1)&&(p33_4_1==1))"))U("(((turn_3==1)&&(flag_3_idle==1))&&(p25_2_0==1))"))||(G("(((turn_4==0)||(flag_4_idle==...178
Formula 0 simplified : !"(((turn_3==1)&&(flag_3_idle==1))&&(p25_2_0==1))" & F!"(((turn_4==0)||(flag_4_idle==0))||(p25_1_3==0))" & X(!"(((turn_3==1)&&(flag_...224
Detected timeout of ITS tools.
[2024-05-24 08:25:12] [INFO ] Flatten gal took : 28 ms
[2024-05-24 08:25:12] [INFO ] Applying decomposition
[2024-05-24 08:25:12] [INFO ] Flatten gal took : 27 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/graph1438934587105826832.txt' '-o' '/tmp/graph1438934587105826832.bin' '-w' '/tmp/graph1438934587105826832.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1438934587105826832.bin' '-l' '-1' '-v' '-w' '/tmp/graph1438934587105826832.weights' '-q' '0' '-e' '0.001'
[2024-05-24 08:25:12] [INFO ] Decomposing Gal with order
[2024-05-24 08:25:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 08:25:12] [INFO ] Removed a total of 1007 redundant transitions.
[2024-05-24 08:25:13] [INFO ] Flatten gal took : 276 ms
[2024-05-24 08:25:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 186 labels/synchronizations in 31 ms.
[2024-05-24 08:25:13] [INFO ] Time to serialize gal into /tmp/LTL17906040926797680747.gal : 13 ms
[2024-05-24 08:25:13] [INFO ] Time to serialize properties into /tmp/LTL5873675912996027824.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/LTL17906040926797680747.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5873675912996027824.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("((i8.u3.flag_1_waiting==1)&&(i5.u14.p33_4_1==1))"))U("(((i1.u2.turn_3==1)&&(i7.u45.flag_3_idle==1))&&(i1.u2.p25_2_0==1))"))||(...229
Formula 0 simplified : !"(((i1.u2.turn_3==1)&&(i7.u45.flag_3_idle==1))&&(i1.u2.p25_2_0==1))" & F!"(((i1.u2.turn_4==0)||(i0.u20.flag_4_idle==0))||(i0.u1.p25...294
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin291104050502536432
[2024-05-24 08:25:28] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin291104050502536432
Running compilation step : cd /tmp/ltsmin291104050502536432;'/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 1463 ms.
Running link step : cd /tmp/ltsmin291104050502536432;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin291104050502536432;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X((LTLAPp0==true)) U (LTLAPp1==true))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-06 finished in 114289 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((X(p0)||(!F(X(p1)) U p2))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 277 transition count 710
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 277 transition count 710
Applied a total of 6 rules in 17 ms. Remains 277 /280 variables (removed 3) and now considering 710/725 (removed 15) transitions.
[2024-05-24 08:25:43] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
// Phase 1: matrix 375 rows 277 cols
[2024-05-24 08:25:43] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 08:25:43] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-24 08:25:43] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-05-24 08:25:43] [INFO ] Invariant cache hit.
[2024-05-24 08:25:43] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-05-24 08:25:44] [INFO ] Implicit Places using invariants and state equation in 828 ms returned []
Implicit Place search using SMT with State Equation took 1062 ms to find 0 implicit places.
[2024-05-24 08:25:44] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-05-24 08:25:44] [INFO ] Invariant cache hit.
[2024-05-24 08:25:44] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 710/725 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1560 ms. Remains : 277/280 places, 710/725 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={0} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s4 1) (EQ s75 1)), p0:(AND (OR (EQ s2 0) (EQ s76 0)) (OR (EQ s4 0) (EQ s75 0))), p1:(AND (EQ s6 1) (EQ s151 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 33334 reset in 508 ms.
Product exploration explored 100000 steps with 33321 reset in 444 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) p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 120 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 08:25:46] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-05-24 08:25:46] [INFO ] Invariant cache hit.
[2024-05-24 08:25:46] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:25:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-24 08:25:46] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-24 08:25:47] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:25:47] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-05-24 08:25:47] [INFO ] After 63ms SMT Verify possible using 124 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:25:47] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-24 08:25:47] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:25:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 198 ms
[2024-05-24 08:25:47] [INFO ] After 291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2024-05-24 08:25:47] [INFO ] After 597ms 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 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 710/710 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 277 transition count 705
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 272 transition count 705
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 272 transition count 626
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 193 transition count 626
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 208 place count 173 transition count 606
Applied a total of 208 rules in 30 ms. Remains 173 /277 variables (removed 104) and now considering 606/710 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 173/277 places, 606/710 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 139660 steps, run visited all 1 properties in 577 ms. (steps per millisecond=242 )
Probabilistic random walk after 139660 steps, saw 37640 distinct states, run finished after 578 ms. (steps per millisecond=241 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2)), (F p2), (F (AND (NOT p1) p2 (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 8 factoid took 346 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 710/710 transitions.
Applied a total of 0 rules in 2 ms. Remains 277 /277 variables (removed 0) and now considering 710/710 (removed 0) transitions.
[2024-05-24 08:25:48] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-05-24 08:25:48] [INFO ] Invariant cache hit.
[2024-05-24 08:25:49] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-24 08:25:49] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-05-24 08:25:49] [INFO ] Invariant cache hit.
[2024-05-24 08:25:49] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-05-24 08:25:49] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1099 ms to find 0 implicit places.
[2024-05-24 08:25:49] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-05-24 08:25:49] [INFO ] Invariant cache hit.
[2024-05-24 08:25:50] [INFO ] Dead Transitions using invariants and state equation in 515 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1619 ms. Remains : 277/277 places, 710/710 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) (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 128 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 08:25:51] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-05-24 08:25:51] [INFO ] Invariant cache hit.
[2024-05-24 08:25:51] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:25:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-24 08:25:51] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 6 ms returned sat
[2024-05-24 08:25:51] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:25:51] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-05-24 08:25:51] [INFO ] After 62ms SMT Verify possible using 124 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:25:51] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2024-05-24 08:25:51] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2024-05-24 08:25:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 190 ms
[2024-05-24 08:25:51] [INFO ] After 283ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2024-05-24 08:25:51] [INFO ] After 598ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 710/710 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 277 transition count 705
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 272 transition count 705
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 272 transition count 626
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 193 transition count 626
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 208 place count 173 transition count 606
Applied a total of 208 rules in 26 ms. Remains 173 /277 variables (removed 104) and now considering 606/710 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 173/277 places, 606/710 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 139660 steps, run visited all 1 properties in 531 ms. (steps per millisecond=263 )
Probabilistic random walk after 139660 steps, saw 37640 distinct states, run finished after 536 ms. (steps per millisecond=260 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2)), (F p2), (F (AND (NOT p1) p2 (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 8 factoid took 337 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Product exploration explored 100000 steps with 33328 reset in 409 ms.
Product exploration explored 100000 steps with 33258 reset in 423 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 710/710 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 277 transition count 710
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 74 Pre rules applied. Total rules applied 5 place count 277 transition count 818
Deduced a syphon composed of 79 places in 1 ms
Iterating global reduction 1 with 74 rules applied. Total rules applied 79 place count 277 transition count 818
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 104 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 104 place count 277 transition count 818
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 109 place count 272 transition count 813
Deduced a syphon composed of 99 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 114 place count 272 transition count 813
Deduced a syphon composed of 99 places in 0 ms
Applied a total of 114 rules in 63 ms. Remains 272 /277 variables (removed 5) and now considering 813/710 (removed -103) transitions.
[2024-05-24 08:25:54] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-24 08:25:54] [INFO ] Flow matrix only has 424 transitions (discarded 389 similar events)
// Phase 1: matrix 424 rows 272 cols
[2024-05-24 08:25:54] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 08:25:55] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/277 places, 813/710 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 647 ms. Remains : 272/277 places, 813/710 transitions.
Built C files in :
/tmp/ltsmin17765479448594360106
[2024-05-24 08:25:55] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17765479448594360106
Running compilation step : cd /tmp/ltsmin17765479448594360106;'/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 1827 ms.
Running link step : cd /tmp/ltsmin17765479448594360106;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17765479448594360106;'/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/stateBased3018916265329991471.hoa' '--buchi-type=spotba'
LTSmin run took 4342 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-07 finished in 18000 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 275 transition count 641
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 196 transition count 641
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 173 place count 191 transition count 616
Iterating global reduction 2 with 5 rules applied. Total rules applied 178 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 596
Applied a total of 218 rules in 39 ms. Remains 171 /280 variables (removed 109) and now considering 596/725 (removed 129) transitions.
[2024-05-24 08:26:01] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-24 08:26:01] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 08:26:01] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-24 08:26:01] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:26:01] [INFO ] Invariant cache hit.
[2024-05-24 08:26:01] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:26:02] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 855 ms to find 0 implicit places.
[2024-05-24 08:26:02] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-24 08:26:02] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:26:02] [INFO ] Invariant cache hit.
[2024-05-24 08:26:02] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 171/280 places, 596/725 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1313 ms. Remains : 171/280 places, 596/725 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s16 1) (EQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 162 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-09 finished in 1530 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 10 place count 275 transition count 640
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 170 place count 195 transition count 640
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 174 place count 191 transition count 620
Iterating global reduction 2 with 4 rules applied. Total rules applied 178 place count 191 transition count 620
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 600
Applied a total of 218 rules in 32 ms. Remains 171 /280 variables (removed 109) and now considering 600/725 (removed 125) transitions.
[2024-05-24 08:26:02] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
// Phase 1: matrix 265 rows 171 cols
[2024-05-24 08:26:02] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 08:26:03] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-24 08:26:03] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
[2024-05-24 08:26:03] [INFO ] Invariant cache hit.
[2024-05-24 08:26:03] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-24 08:26:03] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
[2024-05-24 08:26:03] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-24 08:26:03] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
[2024-05-24 08:26:03] [INFO ] Invariant cache hit.
[2024-05-24 08:26:04] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 171/280 places, 600/725 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1208 ms. Remains : 171/280 places, 600/725 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s0 0) (EQ s5 0) (EQ s125 0)), p0:(OR (NEQ s1 1) (NEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 161 ms.
Product exploration explored 100000 steps with 0 reset in 183 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 08:26:04] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
[2024-05-24 08:26:04] [INFO ] Invariant cache hit.
[2024-05-24 08:26:04] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:26:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-24 08:26:04] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-24 08:26:04] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 20 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-05-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-10 finished in 1986 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 10 place count 275 transition count 640
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 170 place count 195 transition count 640
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 174 place count 191 transition count 620
Iterating global reduction 2 with 4 rules applied. Total rules applied 178 place count 191 transition count 620
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 600
Applied a total of 218 rules in 34 ms. Remains 171 /280 variables (removed 109) and now considering 600/725 (removed 125) transitions.
[2024-05-24 08:26:04] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
// Phase 1: matrix 265 rows 171 cols
[2024-05-24 08:26:04] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 08:26:05] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-24 08:26:05] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
[2024-05-24 08:26:05] [INFO ] Invariant cache hit.
[2024-05-24 08:26:05] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-24 08:26:05] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
[2024-05-24 08:26:05] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-24 08:26:05] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
[2024-05-24 08:26:05] [INFO ] Invariant cache hit.
[2024-05-24 08:26:06] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 171/280 places, 600/725 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1225 ms. Remains : 171/280 places, 600/725 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 9 reset in 163 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-11 finished in 1439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 275 transition count 641
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 196 transition count 641
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 173 place count 191 transition count 616
Iterating global reduction 2 with 5 rules applied. Total rules applied 178 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 596
Applied a total of 218 rules in 31 ms. Remains 171 /280 variables (removed 109) and now considering 596/725 (removed 129) transitions.
[2024-05-24 08:26:06] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-24 08:26:06] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 08:26:06] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-24 08:26:06] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:26:06] [INFO ] Invariant cache hit.
[2024-05-24 08:26:06] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:26:07] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
[2024-05-24 08:26:07] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-24 08:26:07] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:26:07] [INFO ] Invariant cache hit.
[2024-05-24 08:26:07] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 171/280 places, 596/725 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1164 ms. Remains : 171/280 places, 596/725 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s50 1), p1:(AND (EQ s2 1) (EQ s11 1) (EQ s108 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 209 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-12 finished in 1429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U (G(p1)||!p2))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 275 transition count 700
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 275 transition count 700
Applied a total of 10 rules in 7 ms. Remains 275 /280 variables (removed 5) and now considering 700/725 (removed 25) transitions.
[2024-05-24 08:26:07] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2024-05-24 08:26:07] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 08:26:08] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-24 08:26:08] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 08:26:08] [INFO ] Invariant cache hit.
[2024-05-24 08:26:08] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:26:08] [INFO ] Implicit Places using invariants and state equation in 813 ms returned []
Implicit Place search using SMT with State Equation took 1083 ms to find 0 implicit places.
[2024-05-24 08:26:08] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 08:26:08] [INFO ] Invariant cache hit.
[2024-05-24 08:26:09] [INFO ] Dead Transitions using invariants and state equation in 499 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/280 places, 700/725 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1591 ms. Remains : 275/280 places, 700/725 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, p1]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND p2 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s18 1) (EQ s58 1)), p2:(AND (EQ s19 1) (EQ s129 1)), p1:(AND (EQ s12 1) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-13 finished in 1740 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 275 transition count 700
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 275 transition count 700
Applied a total of 10 rules in 6 ms. Remains 275 /280 variables (removed 5) and now considering 700/725 (removed 25) transitions.
[2024-05-24 08:26:09] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 08:26:09] [INFO ] Invariant cache hit.
[2024-05-24 08:26:09] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-24 08:26:09] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 08:26:09] [INFO ] Invariant cache hit.
[2024-05-24 08:26:09] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:26:10] [INFO ] Implicit Places using invariants and state equation in 811 ms returned []
Implicit Place search using SMT with State Equation took 1084 ms to find 0 implicit places.
[2024-05-24 08:26:10] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 08:26:10] [INFO ] Invariant cache hit.
[2024-05-24 08:26:11] [INFO ] Dead Transitions using invariants and state equation in 470 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/280 places, 700/725 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1562 ms. Remains : 275/280 places, 700/725 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s12 1) (NEQ s237 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 164 ms.
Product exploration explored 100000 steps with 0 reset in 213 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 218 steps, run visited all 1 properties in 5 ms. (steps per millisecond=43 )
Probabilistic random walk after 218 steps, saw 184 distinct states, run finished after 5 ms. (steps per millisecond=43 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 700/700 transitions.
Applied a total of 0 rules in 3 ms. Remains 275 /275 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2024-05-24 08:26:12] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 08:26:12] [INFO ] Invariant cache hit.
[2024-05-24 08:26:12] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-24 08:26:12] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 08:26:12] [INFO ] Invariant cache hit.
[2024-05-24 08:26:12] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:26:13] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1088 ms to find 0 implicit places.
[2024-05-24 08:26:13] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 08:26:13] [INFO ] Invariant cache hit.
[2024-05-24 08:26:13] [INFO ] Dead Transitions using invariants and state equation in 480 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1573 ms. Remains : 275/275 places, 700/700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 218 steps, run visited all 1 properties in 5 ms. (steps per millisecond=43 )
Probabilistic random walk after 218 steps, saw 184 distinct states, run finished after 5 ms. (steps per millisecond=43 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 165 ms.
Product exploration explored 100000 steps with 0 reset in 214 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 700/700 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 275 transition count 700
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 74 Pre rules applied. Total rules applied 5 place count 275 transition count 808
Deduced a syphon composed of 79 places in 0 ms
Iterating global reduction 1 with 74 rules applied. Total rules applied 79 place count 275 transition count 808
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 104 places in 1 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 104 place count 275 transition count 808
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 109 place count 270 transition count 803
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 114 place count 270 transition count 803
Deduced a syphon composed of 99 places in 1 ms
Applied a total of 114 rules in 36 ms. Remains 270 /275 variables (removed 5) and now considering 803/700 (removed -103) transitions.
[2024-05-24 08:26:15] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-24 08:26:15] [INFO ] Flow matrix only has 414 transitions (discarded 389 similar events)
// Phase 1: matrix 414 rows 270 cols
[2024-05-24 08:26:15] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 08:26:15] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 270/275 places, 803/700 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 607 ms. Remains : 270/275 places, 803/700 transitions.
Built C files in :
/tmp/ltsmin16305805683386970372
[2024-05-24 08:26:15] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16305805683386970372
Running compilation step : cd /tmp/ltsmin16305805683386970372;'/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 1787 ms.
Running link step : cd /tmp/ltsmin16305805683386970372;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16305805683386970372;'/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/stateBased16676097053620137190.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 700/700 transitions.
Applied a total of 0 rules in 3 ms. Remains 275 /275 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2024-05-24 08:26:30] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2024-05-24 08:26:30] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 08:26:31] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-24 08:26:31] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 08:26:31] [INFO ] Invariant cache hit.
[2024-05-24 08:26:31] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:26:31] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1109 ms to find 0 implicit places.
[2024-05-24 08:26:31] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 08:26:31] [INFO ] Invariant cache hit.
[2024-05-24 08:26:32] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1579 ms. Remains : 275/275 places, 700/700 transitions.
Built C files in :
/tmp/ltsmin5140671849779759238
[2024-05-24 08:26:32] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5140671849779759238
Running compilation step : cd /tmp/ltsmin5140671849779759238;'/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 1777 ms.
Running link step : cd /tmp/ltsmin5140671849779759238;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5140671849779759238;'/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/stateBased16718629789641889475.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 08:26:47] [INFO ] Flatten gal took : 29 ms
[2024-05-24 08:26:47] [INFO ] Flatten gal took : 27 ms
[2024-05-24 08:26:47] [INFO ] Time to serialize gal into /tmp/LTL1416573534160283663.gal : 4 ms
[2024-05-24 08:26:47] [INFO ] Time to serialize properties into /tmp/LTL5358403558808441983.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/LTL1416573534160283663.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17268509542741424714.hoa' '-atoms' '/tmp/LTL5358403558808441983.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5358403558808441983.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17268509542741424714.hoa
Detected timeout of ITS tools.
[2024-05-24 08:27:02] [INFO ] Flatten gal took : 24 ms
[2024-05-24 08:27:02] [INFO ] Flatten gal took : 29 ms
[2024-05-24 08:27:02] [INFO ] Time to serialize gal into /tmp/LTL6089946935908212178.gal : 4 ms
[2024-05-24 08:27:02] [INFO ] Time to serialize properties into /tmp/LTL10709638552556205605.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/LTL6089946935908212178.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10709638552556205605.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((i13.u68.flag_2_waiting!=1)||(i7.u81.p33_4_2!=1))")))))
Formula 0 simplified : XXF!"((i13.u68.flag_2_waiting!=1)||(i7.u81.p33_4_2!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8755792424324699220
[2024-05-24 08:27:33] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8755792424324699220
Running compilation step : cd /tmp/ltsmin8755792424324699220;'/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 1705 ms.
Running link step : cd /tmp/ltsmin8755792424324699220;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8755792424324699220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-15 finished in 98651 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1)||G(p2)))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-05-LTLFireability-06
Stuttering acceptance computed with spot in 167 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 275 transition count 641
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 196 transition count 641
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 173 place count 191 transition count 616
Iterating global reduction 2 with 5 rules applied. Total rules applied 178 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 596
Applied a total of 218 rules in 34 ms. Remains 171 /280 variables (removed 109) and now considering 596/725 (removed 129) transitions.
[2024-05-24 08:27:48] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-24 08:27:48] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 08:27:48] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-24 08:27:48] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:27:48] [INFO ] Invariant cache hit.
[2024-05-24 08:27:48] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:27:49] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
[2024-05-24 08:27:49] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:27:49] [INFO ] Invariant cache hit.
[2024-05-24 08:27:49] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 171/280 places, 596/725 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1154 ms. Remains : 171/280 places, 596/725 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (EQ s9 1) (EQ s135 1)), p1:(AND (EQ s3 1) (EQ s14 1) (EQ s113 1)), p2:(OR (EQ s4 0) (EQ s17 0) (EQ s111 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 166 ms.
Product exploration explored 100000 steps with 0 reset in 187 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), true, (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X p2))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 167 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 836820 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :{}
Probabilistic random walk after 836820 steps, saw 160580 distinct states, run finished after 3001 ms. (steps per millisecond=278 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 08:27:53] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:27:53] [INFO ] Invariant cache hit.
[2024-05-24 08:27:53] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:27:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-24 08:27:53] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-24 08:27:53] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:27:53] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:27:53] [INFO ] After 31ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:27:53] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-24 08:27:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-24 08:27:53] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-24 08:27:53] [INFO ] After 310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 171 transition count 595
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 170 transition count 595
Applied a total of 2 rules in 15 ms. Remains 170 /171 variables (removed 1) and now considering 595/596 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 170/171 places, 595/596 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 849378 steps, run timeout after 3001 ms. (steps per millisecond=283 ) properties seen :{}
Probabilistic random walk after 849378 steps, saw 162713 distinct states, run finished after 3001 ms. (steps per millisecond=283 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 08:27:56] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-05-24 08:27:56] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 08:27:56] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:27:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-24 08:27:56] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-24 08:27:56] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:27:56] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:27:56] [INFO ] After 33ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:27:56] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-24 08:27:56] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-24 08:27:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-24 08:27:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 147 ms
[2024-05-24 08:27:56] [INFO ] After 195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-24 08:27:57] [INFO ] After 393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 10 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 170/170 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 10 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-05-24 08:27:57] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 08:27:57] [INFO ] Invariant cache hit.
[2024-05-24 08:27:57] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-24 08:27:57] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 08:27:57] [INFO ] Invariant cache hit.
[2024-05-24 08:27:57] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:27:57] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
[2024-05-24 08:27:57] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-24 08:27:57] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 08:27:57] [INFO ] Invariant cache hit.
[2024-05-24 08:27:58] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1191 ms. Remains : 170/170 places, 595/595 transitions.
Graph (trivial) has 522 edges and 170 vertex of which 25 / 170 are part of one of the 5 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 150 transition count 167
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 117 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 67 place count 117 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 94 place count 101 transition count 156
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 172 place count 62 transition count 117
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 190 place count 62 transition count 99
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 210 place count 52 transition count 174
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 215 place count 52 transition count 169
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 221 place count 52 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 222 place count 52 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 223 place count 51 transition count 162
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 248 place count 51 transition count 162
Applied a total of 248 rules in 17 ms. Remains 51 /170 variables (removed 119) and now considering 162/595 (removed 433) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 162 rows 51 cols
[2024-05-24 08:27:58] [INFO ] Computed 11 invariants in 6 ms
[2024-05-24 08:27:58] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:27:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-24 08:27:58] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:27:58] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-24 08:27:58] [INFO ] After 12ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:27:58] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-24 08:27:58] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-24 08:27:58] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-05-24 08:27:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 76 ms
[2024-05-24 08:27:58] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-24 08:27:58] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), true, (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p2)]
Support contains 3 out of 171 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 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 10 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2024-05-24 08:27:58] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-24 08:27:58] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 08:27:58] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-24 08:27:58] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:27:58] [INFO ] Invariant cache hit.
[2024-05-24 08:27:59] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:27:59] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
[2024-05-24 08:27:59] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-24 08:27:59] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:27:59] [INFO ] Invariant cache hit.
[2024-05-24 08:27:59] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1095 ms. Remains : 171/171 places, 596/596 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 : [p2, (X p2), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) 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 846294 steps, run timeout after 3001 ms. (steps per millisecond=282 ) properties seen :{}
Probabilistic random walk after 846294 steps, saw 162449 distinct states, run finished after 3001 ms. (steps per millisecond=282 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 08:28:02] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:28:02] [INFO ] Invariant cache hit.
[2024-05-24 08:28:03] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:28:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-24 08:28:03] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-24 08:28:03] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:28:03] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:28:03] [INFO ] After 31ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:28:03] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 10 ms to minimize.
[2024-05-24 08:28:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2024-05-24 08:28:03] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-24 08:28:03] [INFO ] After 316ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 171 transition count 595
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 170 transition count 595
Applied a total of 2 rules in 12 ms. Remains 170 /171 variables (removed 1) and now considering 595/596 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 170/171 places, 595/596 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) 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 854412 steps, run timeout after 3001 ms. (steps per millisecond=284 ) properties seen :{}
Probabilistic random walk after 854412 steps, saw 163586 distinct states, run finished after 3001 ms. (steps per millisecond=284 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 08:28:06] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-05-24 08:28:06] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 08:28:06] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:28:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-24 08:28:06] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-24 08:28:06] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:28:06] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:28:06] [INFO ] After 32ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:28:06] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-24 08:28:06] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-24 08:28:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-24 08:28:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 153 ms
[2024-05-24 08:28:06] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-24 08:28:06] [INFO ] After 389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 10 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 170/170 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 9 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-05-24 08:28:06] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 08:28:06] [INFO ] Invariant cache hit.
[2024-05-24 08:28:07] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-24 08:28:07] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 08:28:07] [INFO ] Invariant cache hit.
[2024-05-24 08:28:07] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:28:07] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
[2024-05-24 08:28:07] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-24 08:28:07] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 08:28:07] [INFO ] Invariant cache hit.
[2024-05-24 08:28:07] [INFO ] Dead Transitions using invariants and state equation in 373 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1124 ms. Remains : 170/170 places, 595/595 transitions.
Graph (trivial) has 522 edges and 170 vertex of which 25 / 170 are part of one of the 5 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 150 transition count 167
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 117 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 67 place count 117 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 94 place count 101 transition count 156
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 172 place count 62 transition count 117
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 190 place count 62 transition count 99
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 210 place count 52 transition count 174
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 215 place count 52 transition count 169
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 221 place count 52 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 222 place count 52 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 223 place count 51 transition count 162
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 248 place count 51 transition count 162
Applied a total of 248 rules in 16 ms. Remains 51 /170 variables (removed 119) and now considering 162/595 (removed 433) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 162 rows 51 cols
[2024-05-24 08:28:07] [INFO ] Computed 11 invariants in 1 ms
[2024-05-24 08:28:08] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:28:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-24 08:28:08] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:28:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-24 08:28:08] [INFO ] After 12ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:28:08] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-24 08:28:08] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-24 08:28:08] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2024-05-24 08:28:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 73 ms
[2024-05-24 08:28:08] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-24 08:28:08] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p2, (X p2), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 166 ms.
Product exploration explored 100000 steps with 0 reset in 189 ms.
Built C files in :
/tmp/ltsmin4937070842498959899
[2024-05-24 08:28:08] [INFO ] Computing symmetric may disable matrix : 596 transitions.
[2024-05-24 08:28:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 08:28:08] [INFO ] Computing symmetric may enable matrix : 596 transitions.
[2024-05-24 08:28:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 08:28:08] [INFO ] Computing Do-Not-Accords matrix : 596 transitions.
[2024-05-24 08:28:08] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 08:28:08] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4937070842498959899
Running compilation step : cd /tmp/ltsmin4937070842498959899;'/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 2158 ms.
Running link step : cd /tmp/ltsmin4937070842498959899;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin4937070842498959899;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10981279012045895243.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 596/596 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 171 transition count 595
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 170 transition count 595
Applied a total of 2 rules in 12 ms. Remains 170 /171 variables (removed 1) and now considering 595/596 (removed 1) transitions.
[2024-05-24 08:28:23] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-05-24 08:28:23] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 08:28:24] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-24 08:28:24] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 08:28:24] [INFO ] Invariant cache hit.
[2024-05-24 08:28:24] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:28:24] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
[2024-05-24 08:28:24] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-24 08:28:24] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 08:28:24] [INFO ] Invariant cache hit.
[2024-05-24 08:28:25] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/171 places, 595/596 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1179 ms. Remains : 170/171 places, 595/596 transitions.
Built C files in :
/tmp/ltsmin18316765253644250017
[2024-05-24 08:28:25] [INFO ] Computing symmetric may disable matrix : 595 transitions.
[2024-05-24 08:28:25] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 08:28:25] [INFO ] Computing symmetric may enable matrix : 595 transitions.
[2024-05-24 08:28:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 08:28:25] [INFO ] Computing Do-Not-Accords matrix : 595 transitions.
[2024-05-24 08:28:25] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 08:28:25] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18316765253644250017
Running compilation step : cd /tmp/ltsmin18316765253644250017;'/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 2082 ms.
Running link step : cd /tmp/ltsmin18316765253644250017;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin18316765253644250017;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4655743668256432400.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 08:28:40] [INFO ] Flatten gal took : 17 ms
[2024-05-24 08:28:40] [INFO ] Flatten gal took : 17 ms
[2024-05-24 08:28:40] [INFO ] Time to serialize gal into /tmp/LTL6199751795531306736.gal : 4 ms
[2024-05-24 08:28:40] [INFO ] Time to serialize properties into /tmp/LTL4180571446824320818.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/LTL6199751795531306736.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17124793655167084550.hoa' '-atoms' '/tmp/LTL4180571446824320818.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4180571446824320818.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17124793655167084550.hoa
Detected timeout of ITS tools.
[2024-05-24 08:28:55] [INFO ] Flatten gal took : 16 ms
[2024-05-24 08:28:55] [INFO ] Flatten gal took : 15 ms
[2024-05-24 08:28:55] [INFO ] Time to serialize gal into /tmp/LTL3693438377987091484.gal : 3 ms
[2024-05-24 08:28:55] [INFO ] Time to serialize properties into /tmp/LTL797755041451651019.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/LTL3693438377987091484.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL797755041451651019.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((((X("((flag_1_waiting==1)&&(p33_4_1==1))"))U("(((turn_3==1)&&(flag_3_idle==1))&&(p25_2_0==1))"))||(G("(((turn_4==0)||(flag_4_idle==...178
Formula 0 simplified : !"(((turn_3==1)&&(flag_3_idle==1))&&(p25_2_0==1))" & F!"(((turn_4==0)||(flag_4_idle==0))||(p25_1_3==0))" & X(!"(((turn_3==1)&&(flag_...224
Detected timeout of ITS tools.
[2024-05-24 08:29:10] [INFO ] Flatten gal took : 17 ms
[2024-05-24 08:29:10] [INFO ] Applying decomposition
[2024-05-24 08:29:10] [INFO ] Flatten gal took : 16 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/graph15248496399778204607.txt' '-o' '/tmp/graph15248496399778204607.bin' '-w' '/tmp/graph15248496399778204607.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15248496399778204607.bin' '-l' '-1' '-v' '-w' '/tmp/graph15248496399778204607.weights' '-q' '0' '-e' '0.001'
[2024-05-24 08:29:10] [INFO ] Decomposing Gal with order
[2024-05-24 08:29:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 08:29:10] [INFO ] Removed a total of 1031 redundant transitions.
[2024-05-24 08:29:10] [INFO ] Flatten gal took : 49 ms
[2024-05-24 08:29:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 188 labels/synchronizations in 18 ms.
[2024-05-24 08:29:10] [INFO ] Time to serialize gal into /tmp/LTL15145776478333757375.gal : 7 ms
[2024-05-24 08:29:10] [INFO ] Time to serialize properties into /tmp/LTL16634014089574167597.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/LTL15145776478333757375.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16634014089574167597.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((((X("((i7.i1.u31.flag_1_waiting==1)&&(i7.i1.u30.p33_4_1==1))"))U("(((i9.u3.turn_3==1)&&(i4.i0.u19.flag_3_idle==1))&&(i9.u3.p25_2_0=...241
Formula 0 simplified : !"(((i9.u3.turn_3==1)&&(i4.i0.u19.flag_3_idle==1))&&(i9.u3.p25_2_0==1))" & F!"(((i1.u4.turn_4==0)||(i4.i0.u1.flag_4_idle==0))||(i3.u...309
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9983433721806627547
[2024-05-24 08:29:25] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9983433721806627547
Running compilation step : cd /tmp/ltsmin9983433721806627547;'/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 1435 ms.
Running link step : cd /tmp/ltsmin9983433721806627547;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9983433721806627547;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X((LTLAPp0==true)) U (LTLAPp1==true))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-06 finished in 112496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-05-LTLFireability-15
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 275 transition count 641
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 196 transition count 641
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 173 place count 191 transition count 616
Iterating global reduction 2 with 5 rules applied. Total rules applied 178 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 596
Applied a total of 218 rules in 23 ms. Remains 171 /280 variables (removed 109) and now considering 596/725 (removed 129) transitions.
[2024-05-24 08:29:40] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-24 08:29:40] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 08:29:41] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-24 08:29:41] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:29:41] [INFO ] Invariant cache hit.
[2024-05-24 08:29:41] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:29:41] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
[2024-05-24 08:29:41] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:29:41] [INFO ] Invariant cache hit.
[2024-05-24 08:29:42] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 171/280 places, 596/725 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1167 ms. Remains : 171/280 places, 596/725 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s12 1) (NEQ s135 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 177 ms.
Product exploration explored 100000 steps with 0 reset in 199 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 110 steps, run visited all 1 properties in 4 ms. (steps per millisecond=27 )
Probabilistic random walk after 110 steps, saw 94 distinct states, run finished after 4 ms. (steps per millisecond=27 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 2 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2024-05-24 08:29:42] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:29:42] [INFO ] Invariant cache hit.
[2024-05-24 08:29:43] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-24 08:29:43] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:29:43] [INFO ] Invariant cache hit.
[2024-05-24 08:29:43] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:29:43] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
[2024-05-24 08:29:43] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:29:43] [INFO ] Invariant cache hit.
[2024-05-24 08:29:44] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1121 ms. Remains : 171/171 places, 596/596 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 110 steps, run visited all 1 properties in 4 ms. (steps per millisecond=27 )
Probabilistic random walk after 110 steps, saw 94 distinct states, run finished after 4 ms. (steps per millisecond=27 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 170 ms.
Product exploration explored 100000 steps with 0 reset in 190 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 9 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2024-05-24 08:29:45] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-24 08:29:45] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:29:45] [INFO ] Invariant cache hit.
[2024-05-24 08:29:45] [INFO ] Dead Transitions using invariants and state equation in 344 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 364 ms. Remains : 171/171 places, 596/596 transitions.
Built C files in :
/tmp/ltsmin16605594594414578468
[2024-05-24 08:29:45] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16605594594414578468
Running compilation step : cd /tmp/ltsmin16605594594414578468;'/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 1473 ms.
Running link step : cd /tmp/ltsmin16605594594414578468;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16605594594414578468;'/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/stateBased6627823493315248540.hoa' '--buchi-type=spotba'
LTSmin run took 3298 ms.
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-15 finished in 10047 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-15 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-24 08:29:50] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2991214759920225109
[2024-05-24 08:29:50] [INFO ] Computing symmetric may disable matrix : 725 transitions.
[2024-05-24 08:29:50] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 08:29:50] [INFO ] Computing symmetric may enable matrix : 725 transitions.
[2024-05-24 08:29:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 08:29:50] [INFO ] Applying decomposition
[2024-05-24 08:29:50] [INFO ] Flatten gal took : 18 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/graph16987861370521161537.txt' '-o' '/tmp/graph16987861370521161537.bin' '-w' '/tmp/graph16987861370521161537.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16987861370521161537.bin' '-l' '-1' '-v' '-w' '/tmp/graph16987861370521161537.weights' '-q' '0' '-e' '0.001'
[2024-05-24 08:29:50] [INFO ] Decomposing Gal with order
[2024-05-24 08:29:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 08:29:50] [INFO ] Computing Do-Not-Accords matrix : 725 transitions.
[2024-05-24 08:29:50] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 08:29:50] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2991214759920225109
Running compilation step : cd /tmp/ltsmin2991214759920225109;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-24 08:29:50] [INFO ] Removed a total of 1084 redundant transitions.
[2024-05-24 08:29:50] [INFO ] Flatten gal took : 52 ms
[2024-05-24 08:29:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 240 labels/synchronizations in 26 ms.
[2024-05-24 08:29:50] [INFO ] Time to serialize gal into /tmp/LTLFireability11783072963217714159.gal : 6 ms
[2024-05-24 08:29:50] [INFO ] Time to serialize properties into /tmp/LTLFireability875425638871623056.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/LTLFireability11783072963217714159.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability875425638871623056.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 1 LTL properties
Checking formula 0 : !((((X("((i11.i2.u69.flag_1_waiting==1)&&(i11.i4.u32.p33_4_1==1))"))U("(((i0.u2.turn_3==1)&&(i10.i1.u68.flag_3_idle==1))&&(i11.i2.u69....252
Formula 0 simplified : !"(((i0.u2.turn_3==1)&&(i10.i1.u68.flag_3_idle==1))&&(i11.i2.u69.p25_2_0==1))" & F!"(((i8.u0.turn_4==0)||(i8.u43.flag_4_idle==0))||(...326
Compilation finished in 2766 ms.
Running link step : cd /tmp/ltsmin2991214759920225109;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin2991214759920225109;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X((LTLAPp0==true)) U (LTLAPp1==true))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t5, t6, t8, t9, t25, t62, t63, t64, t65, t66, t67, t70, t71, t72, t73, t74, t...2304
LTSmin run took 1316810 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1713992 ms.

BK_STOP 1716540711796

--------------------
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-05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is EisenbergMcGuire-PT-05, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r175-smll-171636279900103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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