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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 16:25 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 255K 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-04-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716538489513

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-04
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 08:14:52] [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:14:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 08:14:52] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-05-24 08:14:52] [INFO ] Transformed 196 places.
[2024-05-24 08:14:52] [INFO ] Transformed 448 transitions.
[2024-05-24 08:14:52] [INFO ] Found NUPN structural information;
[2024-05-24 08:14:52] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 240 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 448/448 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 190 transition count 424
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 190 transition count 424
Applied a total of 12 rules in 58 ms. Remains 190 /196 variables (removed 6) and now considering 424/448 (removed 24) transitions.
[2024-05-24 08:14:52] [INFO ] Flow matrix only has 260 transitions (discarded 164 similar events)
// Phase 1: matrix 260 rows 190 cols
[2024-05-24 08:14:52] [INFO ] Computed 13 invariants in 22 ms
[2024-05-24 08:14:53] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-24 08:14:53] [INFO ] Flow matrix only has 260 transitions (discarded 164 similar events)
[2024-05-24 08:14:53] [INFO ] Invariant cache hit.
[2024-05-24 08:14:53] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-24 08:14:53] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 894 ms to find 0 implicit places.
[2024-05-24 08:14:53] [INFO ] Flow matrix only has 260 transitions (discarded 164 similar events)
[2024-05-24 08:14:53] [INFO ] Invariant cache hit.
[2024-05-24 08:14:53] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 190/196 places, 424/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1274 ms. Remains : 190/196 places, 424/448 transitions.
Support contains 46 out of 190 places after structural reductions.
[2024-05-24 08:14:54] [INFO ] Flatten gal took : 89 ms
[2024-05-24 08:14:54] [INFO ] Flatten gal took : 40 ms
[2024-05-24 08:14:54] [INFO ] Input system was already deterministic with 424 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 491 ms. (steps per millisecond=20 ) properties (out of 32) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2024-05-24 08:14:54] [INFO ] Flow matrix only has 260 transitions (discarded 164 similar events)
[2024-05-24 08:14:54] [INFO ] Invariant cache hit.
[2024-05-24 08:14:55] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-24 08:14:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 24 ms returned sat
[2024-05-24 08:14:55] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-24 08:14:56] [INFO ] After 472ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :13
[2024-05-24 08:14:56] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-24 08:14:56] [INFO ] After 279ms SMT Verify possible using 94 Read/Feed constraints in natural domain returned unsat :5 sat :13
[2024-05-24 08:14:56] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 8 ms to minimize.
[2024-05-24 08:14:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2024-05-24 08:14:56] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 2 ms to minimize.
[2024-05-24 08:14:56] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-24 08:14:57] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
[2024-05-24 08:14:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 307 ms
[2024-05-24 08:14:57] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 0 ms to minimize.
[2024-05-24 08:14:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2024-05-24 08:14:57] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 1 ms to minimize.
[2024-05-24 08:14:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2024-05-24 08:14:57] [INFO ] After 1374ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :13
Attempting to minimize the solution found.
Minimization took 219 ms.
[2024-05-24 08:14:57] [INFO ] After 2723ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :13
Fused 18 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 125 ms.
Support contains 25 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 424/424 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 190 transition count 421
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 187 transition count 421
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 6 place count 187 transition count 372
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 104 place count 138 transition count 372
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 107 place count 135 transition count 360
Iterating global reduction 2 with 3 rules applied. Total rules applied 110 place count 135 transition count 360
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 6 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 132 place count 124 transition count 349
Applied a total of 132 rules in 100 ms. Remains 124 /190 variables (removed 66) and now considering 349/424 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 124/190 places, 349/424 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2024-05-24 08:14:59] [INFO ] Flow matrix only has 185 transitions (discarded 164 similar events)
// Phase 1: matrix 185 rows 124 cols
[2024-05-24 08:14:59] [INFO ] Computed 13 invariants in 12 ms
[2024-05-24 08:14:59] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-24 08:14:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-24 08:14:59] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-24 08:14:59] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-24 08:14:59] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-24 08:14:59] [INFO ] After 137ms SMT Verify possible using 85 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2024-05-24 08:14:59] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-24 08:15:00] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-05-24 08:15:00] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-24 08:15:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 247 ms
[2024-05-24 08:15:00] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-24 08:15:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-24 08:15:00] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 08:15:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-24 08:15:00] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-24 08:15:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2024-05-24 08:15:00] [INFO ] After 744ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 126 ms.
[2024-05-24 08:15:00] [INFO ] After 1198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 97 ms.
Support contains 23 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 349/349 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 123 transition count 345
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 123 transition count 345
Applied a total of 2 rules in 35 ms. Remains 123 /124 variables (removed 1) and now considering 345/349 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 123/124 places, 345/349 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 562230 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :{1=1, 2=1, 3=1, 4=1, 5=1, 7=1, 8=1, 9=1, 10=1}
Probabilistic random walk after 562230 steps, saw 114604 distinct states, run finished after 3002 ms. (steps per millisecond=187 ) properties seen :9
Running SMT prover for 2 properties.
[2024-05-24 08:15:04] [INFO ] Flow matrix only has 181 transitions (discarded 164 similar events)
// Phase 1: matrix 181 rows 123 cols
[2024-05-24 08:15:04] [INFO ] Computed 13 invariants in 2 ms
[2024-05-24 08:15:04] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 08:15:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-24 08:15:04] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-24 08:15:04] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 08:15:04] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-24 08:15:04] [INFO ] After 74ms SMT Verify possible using 82 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 08:15:04] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-24 08:15:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-24 08:15:05] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-24 08:15:05] [INFO ] After 405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 345/345 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 123 transition count 341
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 119 transition count 341
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 117 transition count 333
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 117 transition count 333
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 14 place count 116 transition count 332
Applied a total of 14 rules in 45 ms. Remains 116 /123 variables (removed 7) and now considering 332/345 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 116/123 places, 332/345 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) 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 2) seen :0
Finished probabilistic random walk after 579761 steps, run visited all 2 properties in 2589 ms. (steps per millisecond=223 )
Probabilistic random walk after 579761 steps, saw 117258 distinct states, run finished after 2590 ms. (steps per millisecond=223 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(p0)))'
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 184 transition count 400
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 184 transition count 400
Applied a total of 12 rules in 9 ms. Remains 184 /190 variables (removed 6) and now considering 400/424 (removed 24) transitions.
[2024-05-24 08:15:08] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2024-05-24 08:15:08] [INFO ] Computed 13 invariants in 2 ms
[2024-05-24 08:15:08] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-24 08:15:08] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 08:15:08] [INFO ] Invariant cache hit.
[2024-05-24 08:15:08] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 08:15:09] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 991 ms to find 0 implicit places.
[2024-05-24 08:15:09] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 08:15:09] [INFO ] Invariant cache hit.
[2024-05-24 08:15:09] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/190 places, 400/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1291 ms. Remains : 184/190 places, 400/424 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 332 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s115 1) (OR (EQ s10 0) (EQ s150 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 468 reset in 541 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 1 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-00 finished in 2254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F((p1&&(p2 U p3)))))))'
Support contains 7 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 184 transition count 400
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 184 transition count 400
Applied a total of 12 rules in 8 ms. Remains 184 /190 variables (removed 6) and now considering 400/424 (removed 24) transitions.
[2024-05-24 08:15:10] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 08:15:10] [INFO ] Invariant cache hit.
[2024-05-24 08:15:10] [INFO ] Implicit Places using invariants in 496 ms returned []
[2024-05-24 08:15:10] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 08:15:10] [INFO ] Invariant cache hit.
[2024-05-24 08:15:11] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 08:15:11] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 937 ms to find 0 implicit places.
[2024-05-24 08:15:11] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 08:15:11] [INFO ] Invariant cache hit.
[2024-05-24 08:15:11] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/190 places, 400/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1246 ms. Remains : 184/190 places, 400/424 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p3) p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s48 1)), p1:(OR (NEQ s9 1) (NEQ s90 1)), p3:(EQ s37 1), p2:(AND (EQ s6 1) (EQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1165 reset in 265 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-01 finished in 1781 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 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 184 transition count 400
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 184 transition count 400
Applied a total of 12 rules in 5 ms. Remains 184 /190 variables (removed 6) and now considering 400/424 (removed 24) transitions.
[2024-05-24 08:15:12] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 08:15:12] [INFO ] Invariant cache hit.
[2024-05-24 08:15:12] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-24 08:15:12] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 08:15:12] [INFO ] Invariant cache hit.
[2024-05-24 08:15:12] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 08:15:13] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1319 ms to find 0 implicit places.
[2024-05-24 08:15:13] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 08:15:13] [INFO ] Invariant cache hit.
[2024-05-24 08:15:13] [INFO ] Dead Transitions using invariants and state equation in 373 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/190 places, 400/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1710 ms. Remains : 184/190 places, 400/424 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-02 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 (EQ s3 0) (EQ s14 0) (EQ s129 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 144 ms.
Product exploration explored 100000 steps with 0 reset in 259 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 281 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 131 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1053255 steps, run timeout after 3001 ms. (steps per millisecond=350 ) properties seen :{}
Probabilistic random walk after 1053255 steps, saw 227194 distinct states, run finished after 3002 ms. (steps per millisecond=350 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 08:15:17] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 08:15:17] [INFO ] Invariant cache hit.
[2024-05-24 08:15:17] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:15:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-24 08:15:18] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-24 08:15:18] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:15:18] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 08:15:18] [INFO ] After 27ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:15:18] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2024-05-24 08:15:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2024-05-24 08:15:18] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-24 08:15:18] [INFO ] After 345ms 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 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 400/400 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 184 transition count 396
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 180 transition count 396
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 180 transition count 344
Deduced a syphon composed of 52 places in 4 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 136 place count 116 transition count 332
Applied a total of 136 rules in 65 ms. Remains 116 /184 variables (removed 68) and now considering 332/400 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 116/184 places, 332/400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 579726 steps, run visited all 1 properties in 1485 ms. (steps per millisecond=390 )
Probabilistic random walk after 579726 steps, saw 117256 distinct states, run finished after 1489 ms. (steps per millisecond=389 ) 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 259 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 138 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-24 08:15:20] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 08:15:20] [INFO ] Invariant cache hit.
[2024-05-24 08:15:20] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-24 08:15:20] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 08:15:20] [INFO ] Invariant cache hit.
[2024-05-24 08:15:20] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 08:15:21] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2024-05-24 08:15:21] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 08:15:21] [INFO ] Invariant cache hit.
[2024-05-24 08:15:21] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 852 ms. Remains : 184/184 places, 400/400 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 78 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 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) 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
Interrupted probabilistic random walk after 1031265 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :{}
Probabilistic random walk after 1031265 steps, saw 222747 distinct states, run finished after 3001 ms. (steps per millisecond=343 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 08:15:24] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 08:15:24] [INFO ] Invariant cache hit.
[2024-05-24 08:15:24] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:15:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-05-24 08:15:24] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-24 08:15:24] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:15:24] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 08:15:24] [INFO ] After 24ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:15:24] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-24 08:15:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-05-24 08:15:24] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-24 08:15:24] [INFO ] After 286ms 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 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 400/400 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 184 transition count 396
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 180 transition count 396
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 180 transition count 344
Deduced a syphon composed of 52 places in 9 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 136 place count 116 transition count 332
Applied a total of 136 rules in 44 ms. Remains 116 /184 variables (removed 68) and now considering 332/400 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 116/184 places, 332/400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) 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 579726 steps, run visited all 1 properties in 1480 ms. (steps per millisecond=391 )
Probabilistic random walk after 579726 steps, saw 117256 distinct states, run finished after 1480 ms. (steps per millisecond=391 ) 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 101 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 126 ms.
Product exploration explored 100000 steps with 0 reset in 157 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 184 transition count 400
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 48 Pre rules applied. Total rules applied 4 place count 184 transition count 464
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 52 place count 184 transition count 464
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 68 place count 184 transition count 464
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 72 place count 180 transition count 460
Deduced a syphon composed of 64 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 180 transition count 460
Deduced a syphon composed of 64 places in 0 ms
Applied a total of 76 rules in 59 ms. Remains 180 /184 variables (removed 4) and now considering 460/400 (removed -60) transitions.
[2024-05-24 08:15:27] [INFO ] Redundant transitions in 56 ms returned []
[2024-05-24 08:15:27] [INFO ] Flow matrix only has 264 transitions (discarded 196 similar events)
// Phase 1: matrix 264 rows 180 cols
[2024-05-24 08:15:27] [INFO ] Computed 13 invariants in 2 ms
[2024-05-24 08:15:28] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 180/184 places, 460/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 702 ms. Remains : 180/184 places, 460/400 transitions.
Built C files in :
/tmp/ltsmin13610620157078980869
[2024-05-24 08:15:28] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13610620157078980869
Running compilation step : cd /tmp/ltsmin13610620157078980869;'/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 1116 ms.
Running link step : cd /tmp/ltsmin13610620157078980869;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin13610620157078980869;'/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/stateBased3243795167965754321.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 184 /184 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-24 08:15:43] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2024-05-24 08:15:43] [INFO ] Computed 13 invariants in 2 ms
[2024-05-24 08:15:43] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-24 08:15:43] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 08:15:43] [INFO ] Invariant cache hit.
[2024-05-24 08:15:43] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 08:15:44] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2024-05-24 08:15:44] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 08:15:44] [INFO ] Invariant cache hit.
[2024-05-24 08:15:44] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 918 ms. Remains : 184/184 places, 400/400 transitions.
Built C files in :
/tmp/ltsmin7561977885156394951
[2024-05-24 08:15:44] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7561977885156394951
Running compilation step : cd /tmp/ltsmin7561977885156394951;'/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 935 ms.
Running link step : cd /tmp/ltsmin7561977885156394951;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7561977885156394951;'/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/stateBased10538186785624961340.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 08:15:59] [INFO ] Flatten gal took : 66 ms
[2024-05-24 08:15:59] [INFO ] Flatten gal took : 58 ms
[2024-05-24 08:15:59] [INFO ] Time to serialize gal into /tmp/LTL17870511168143815181.gal : 6 ms
[2024-05-24 08:15:59] [INFO ] Time to serialize properties into /tmp/LTL6815262815267233033.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17870511168143815181.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4871232170298013815.hoa' '-atoms' '/tmp/LTL6815262815267233033.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/LTL6815262815267233033.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4871232170298013815.hoa
Detected timeout of ITS tools.
[2024-05-24 08:16:14] [INFO ] Flatten gal took : 24 ms
[2024-05-24 08:16:15] [INFO ] Flatten gal took : 53 ms
[2024-05-24 08:16:15] [INFO ] Time to serialize gal into /tmp/LTL7457624920812484021.gal : 27 ms
[2024-05-24 08:16:15] [INFO ] Time to serialize properties into /tmp/LTL10114555034707741053.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7457624920812484021.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10114555034707741053.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("(((turn_3==0)||(flag_3_waiting==0))||(p25_2_1==0))")))))
Formula 0 simplified : XXF!"(((turn_3==0)||(flag_3_waiting==0))||(p25_2_1==0))"
Detected timeout of ITS tools.
[2024-05-24 08:16:30] [INFO ] Flatten gal took : 28 ms
[2024-05-24 08:16:30] [INFO ] Applying decomposition
[2024-05-24 08:16:30] [INFO ] Flatten gal took : 21 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/graph15306269477152605757.txt' '-o' '/tmp/graph15306269477152605757.bin' '-w' '/tmp/graph15306269477152605757.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15306269477152605757.bin' '-l' '-1' '-v' '-w' '/tmp/graph15306269477152605757.weights' '-q' '0' '-e' '0.001'
[2024-05-24 08:16:30] [INFO ] Decomposing Gal with order
[2024-05-24 08:16:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 08:16:30] [INFO ] Removed a total of 513 redundant transitions.
[2024-05-24 08:16:30] [INFO ] Flatten gal took : 122 ms
[2024-05-24 08:16:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 121 labels/synchronizations in 29 ms.
[2024-05-24 08:16:30] [INFO ] Time to serialize gal into /tmp/LTL18397695861531237309.gal : 13 ms
[2024-05-24 08:16:30] [INFO ] Time to serialize properties into /tmp/LTL1841648109872793832.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/LTL18397695861531237309.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1841648109872793832.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(((i0.u0.turn_3==0)||(i0.u0.flag_3_waiting==0))||(i7.i2.u2.p25_2_1==0))")))))
Formula 0 simplified : XXF!"(((i0.u0.turn_3==0)||(i0.u0.flag_3_waiting==0))||(i7.i2.u2.p25_2_1==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8632807030262320614
[2024-05-24 08:16:45] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8632807030262320614
Running compilation step : cd /tmp/ltsmin8632807030262320614;'/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 905 ms.
Running link step : cd /tmp/ltsmin8632807030262320614;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8632807030262320614;'/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-04-LTLFireability-02 finished in 108677 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 424/424 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 190 transition count 420
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 186 transition count 420
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 8 place count 186 transition count 370
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 108 place count 136 transition count 370
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 113 place count 131 transition count 350
Iterating global reduction 2 with 5 rules applied. Total rules applied 118 place count 131 transition count 350
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 142 place count 119 transition count 338
Applied a total of 142 rules in 34 ms. Remains 119 /190 variables (removed 71) and now considering 338/424 (removed 86) transitions.
[2024-05-24 08:17:00] [INFO ] Flow matrix only has 174 transitions (discarded 164 similar events)
// Phase 1: matrix 174 rows 119 cols
[2024-05-24 08:17:00] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 08:17:01] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-24 08:17:01] [INFO ] Flow matrix only has 174 transitions (discarded 164 similar events)
[2024-05-24 08:17:01] [INFO ] Invariant cache hit.
[2024-05-24 08:17:01] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-24 08:17:01] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2024-05-24 08:17:01] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-24 08:17:01] [INFO ] Flow matrix only has 174 transitions (discarded 164 similar events)
[2024-05-24 08:17:01] [INFO ] Invariant cache hit.
[2024-05-24 08:17:01] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/190 places, 338/424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 838 ms. Remains : 119/190 places, 338/424 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s57 1)), p1:(OR (AND (EQ s1 1) (EQ s23 1)) (AND (EQ s12 1) (EQ s92 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 137 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 1 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-06 finished in 1143 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||(!p1 U (X(!p2)||G(!p1))))))'
Support contains 7 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 184 transition count 400
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 184 transition count 400
Applied a total of 12 rules in 4 ms. Remains 184 /190 variables (removed 6) and now considering 400/424 (removed 24) transitions.
[2024-05-24 08:17:01] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2024-05-24 08:17:01] [INFO ] Computed 13 invariants in 2 ms
[2024-05-24 08:17:02] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-24 08:17:02] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 08:17:02] [INFO ] Invariant cache hit.
[2024-05-24 08:17:02] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 08:17:02] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2024-05-24 08:17:02] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 08:17:02] [INFO ] Invariant cache hit.
[2024-05-24 08:17:02] [INFO ] Dead Transitions using invariants and state equation in 344 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/190 places, 400/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 968 ms. Remains : 184/190 places, 400/424 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, p2, (AND p2 (NOT p0) p1), (AND p2 (NOT p0) p1), (AND p2 p1)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(AND (EQ s10 1) (EQ s18 1)), p0:(AND (EQ s2 1) (EQ s12 1) (EQ s132 1)), p1:(AND (EQ s7 1) (EQ s157 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 19046 reset in 204 ms.
Product exploration explored 100000 steps with 19069 reset in 228 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 p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 4 factoid took 205 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 08:17:03] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 08:17:03] [INFO ] Invariant cache hit.
[2024-05-24 08:17:04] [INFO ] [Real]Absence check using 9 positive place invariants in 12 ms returned sat
[2024-05-24 08:17:04] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-24 08:17:04] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:17:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-24 08:17:04] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-24 08:17:04] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:17:04] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 08:17:04] [INFO ] After 27ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:17:04] [INFO ] After 51ms 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:17:04] [INFO ] After 244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 400/400 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 184 transition count 396
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 180 transition count 396
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 180 transition count 345
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 134 place count 117 transition count 333
Applied a total of 134 rules in 22 ms. Remains 117 /184 variables (removed 67) and now considering 333/400 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 117/184 places, 333/400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) 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
Finished probabilistic random walk after 73 steps, run visited all 1 properties in 7 ms. (steps per millisecond=10 )
Probabilistic random walk after 73 steps, saw 61 distinct states, run finished after 7 ms. (steps per millisecond=10 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (AND p1 p2))]
Knowledge based reduction with 4 factoid took 277 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 153 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Support contains 4 out of 184 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Applied a total of 0 rules in 3 ms. Remains 184 /184 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-24 08:17:05] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 08:17:05] [INFO ] Invariant cache hit.
[2024-05-24 08:17:05] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-24 08:17:05] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 08:17:05] [INFO ] Invariant cache hit.
[2024-05-24 08:17:05] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 08:17:05] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2024-05-24 08:17:05] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 08:17:05] [INFO ] Invariant cache hit.
[2024-05-24 08:17:05] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 805 ms. Remains : 184/184 places, 400/400 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 p2 (NOT p1)), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 2 factoid took 170 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :2
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
Running SMT prover for 1 properties.
[2024-05-24 08:17:06] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 08:17:06] [INFO ] Invariant cache hit.
[2024-05-24 08:17:06] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-24 08:17:06] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-24 08:17:06] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:17:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-24 08:17:06] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-24 08:17:06] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:17:06] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 08:17:06] [INFO ] After 26ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:17:06] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-24 08:17:06] [INFO ] After 234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 400/400 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 184 transition count 396
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 180 transition count 396
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 180 transition count 345
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 134 place count 117 transition count 333
Applied a total of 134 rules in 18 ms. Remains 117 /184 variables (removed 67) and now considering 333/400 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 117/184 places, 333/400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) 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
Finished probabilistic random walk after 73 steps, run visited all 1 properties in 4 ms. (steps per millisecond=18 )
Probabilistic random walk after 73 steps, saw 61 distinct states, run finished after 5 ms. (steps per millisecond=14 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1)), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (AND p1 p2))]
Knowledge based reduction with 2 factoid took 205 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 153 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 161 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Product exploration explored 100000 steps with 18966 reset in 206 ms.
Product exploration explored 100000 steps with 19111 reset in 223 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 266 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 184 transition count 400
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 47 Pre rules applied. Total rules applied 4 place count 184 transition count 462
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 51 place count 184 transition count 462
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 67 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 67 place count 184 transition count 462
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 71 place count 180 transition count 458
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 75 place count 180 transition count 458
Deduced a syphon composed of 63 places in 0 ms
Applied a total of 75 rules in 26 ms. Remains 180 /184 variables (removed 4) and now considering 458/400 (removed -58) transitions.
[2024-05-24 08:17:08] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-24 08:17:08] [INFO ] Flow matrix only has 263 transitions (discarded 195 similar events)
// Phase 1: matrix 263 rows 180 cols
[2024-05-24 08:17:08] [INFO ] Computed 13 invariants in 7 ms
[2024-05-24 08:17:08] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 180/184 places, 458/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 362 ms. Remains : 180/184 places, 458/400 transitions.
Built C files in :
/tmp/ltsmin4230220723211430919
[2024-05-24 08:17:08] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4230220723211430919
Running compilation step : cd /tmp/ltsmin4230220723211430919;'/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 947 ms.
Running link step : cd /tmp/ltsmin4230220723211430919;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4230220723211430919;'/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/stateBased7893430843107596547.hoa' '--buchi-type=spotba'
LTSmin run took 1709 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-07 finished in 9369 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 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 424/424 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 190 transition count 420
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 186 transition count 420
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 186 transition count 369
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 135 transition count 369
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 116 place count 129 transition count 345
Iterating global reduction 2 with 6 rules applied. Total rules applied 122 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 146 place count 117 transition count 333
Applied a total of 146 rules in 28 ms. Remains 117 /190 variables (removed 73) and now considering 333/424 (removed 91) transitions.
[2024-05-24 08:17:11] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2024-05-24 08:17:11] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 08:17:11] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-24 08:17:11] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2024-05-24 08:17:11] [INFO ] Invariant cache hit.
[2024-05-24 08:17:11] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 08:17:11] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
[2024-05-24 08:17:11] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 08:17:11] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2024-05-24 08:17:11] [INFO ] Invariant cache hit.
[2024-05-24 08:17:12] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/190 places, 333/424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 755 ms. Remains : 117/190 places, 333/424 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s41 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 137 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-10 finished in 960 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' '!(((p0 U X(p1)) U (p2||F(p3))))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 185 transition count 404
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 185 transition count 404
Applied a total of 10 rules in 4 ms. Remains 185 /190 variables (removed 5) and now considering 404/424 (removed 20) transitions.
[2024-05-24 08:17:12] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
// Phase 1: matrix 240 rows 185 cols
[2024-05-24 08:17:12] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 08:17:12] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-24 08:17:12] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2024-05-24 08:17:12] [INFO ] Invariant cache hit.
[2024-05-24 08:17:12] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-24 08:17:12] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
[2024-05-24 08:17:12] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2024-05-24 08:17:12] [INFO ] Invariant cache hit.
[2024-05-24 08:17:13] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/190 places, 404/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 957 ms. Remains : 185/190 places, 404/424 transitions.
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s2 1) (EQ s52 1)), p3:(AND (EQ s2 1) (EQ s10 1) (EQ s134 1)), p0:(AND (EQ s5 1) (EQ s43 1)), p1:(OR (AND (EQ s5 1) (EQ s43 1)) (AND (EQ s2 1) ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 127 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 1 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-11 finished in 1358 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' '!((p0 U X(G(p1))))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 185 transition count 404
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 185 transition count 404
Applied a total of 10 rules in 4 ms. Remains 185 /190 variables (removed 5) and now considering 404/424 (removed 20) transitions.
[2024-05-24 08:17:13] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
// Phase 1: matrix 240 rows 185 cols
[2024-05-24 08:17:13] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 08:17:13] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-24 08:17:13] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2024-05-24 08:17:13] [INFO ] Invariant cache hit.
[2024-05-24 08:17:13] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-24 08:17:14] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2024-05-24 08:17:14] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2024-05-24 08:17:14] [INFO ] Invariant cache hit.
[2024-05-24 08:17:14] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/190 places, 404/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 915 ms. Remains : 185/190 places, 404/424 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s39 1), p0:(AND (EQ s2 1) (EQ s11 1) (EQ s128 1) (OR (EQ s39 1) (AND (EQ s0 1) (EQ s20 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-12 finished in 1025 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 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 424/424 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 190 transition count 420
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 186 transition count 420
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 186 transition count 369
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 135 transition count 369
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 116 place count 129 transition count 345
Iterating global reduction 2 with 6 rules applied. Total rules applied 122 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 146 place count 117 transition count 333
Applied a total of 146 rules in 30 ms. Remains 117 /190 variables (removed 73) and now considering 333/424 (removed 91) transitions.
[2024-05-24 08:17:14] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2024-05-24 08:17:14] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 08:17:14] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-24 08:17:14] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2024-05-24 08:17:14] [INFO ] Invariant cache hit.
[2024-05-24 08:17:15] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 08:17:15] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
[2024-05-24 08:17:15] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-24 08:17:15] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2024-05-24 08:17:15] [INFO ] Invariant cache hit.
[2024-05-24 08:17:15] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/190 places, 333/424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 843 ms. Remains : 117/190 places, 333/424 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-13 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 s61 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 135 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 1 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-13 finished in 1037 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) U p1)||X(X(G(p1)))||G(p2)))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 184 transition count 400
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 184 transition count 400
Applied a total of 12 rules in 4 ms. Remains 184 /190 variables (removed 6) and now considering 400/424 (removed 24) transitions.
[2024-05-24 08:17:15] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2024-05-24 08:17:15] [INFO ] Computed 13 invariants in 9 ms
[2024-05-24 08:17:15] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-24 08:17:15] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 08:17:15] [INFO ] Invariant cache hit.
[2024-05-24 08:17:16] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 08:17:16] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
[2024-05-24 08:17:16] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 08:17:16] [INFO ] Invariant cache hit.
[2024-05-24 08:17:16] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/190 places, 400/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 852 ms. Remains : 184/190 places, 400/424 transitions.
Stuttering acceptance computed with spot in 530 ms :[(AND (NOT p1) (NOT p2)), false, (NOT p1), false, (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 8}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 9}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 9}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=8 dest: 9}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=8 dest: 10}], [{ cond=(NOT p0), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p0) p2), acceptance={} source=10 dest: 10}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s8 1) (EQ s120 1)), p0:(EQ s88 1), p2:(OR (NEQ s9 1) (NEQ s157 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3563 reset in 195 ms.
Product exploration explored 100000 steps with 3533 reset in 239 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 284 ms. Reduced automaton from 11 states, 28 edges and 3 AP (stutter sensitive) to 11 states, 33 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 588 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 17) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2024-05-24 08:17:19] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 08:17:19] [INFO ] Invariant cache hit.
[2024-05-24 08:17:19] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-05-24 08:17:19] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-24 08:17:19] [INFO ] After 340ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:10
[2024-05-24 08:17:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-05-24 08:17:19] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-24 08:17:19] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :9
[2024-05-24 08:17:19] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 08:17:20] [INFO ] After 132ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :3 sat :9
[2024-05-24 08:17:20] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2024-05-24 08:17:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-24 08:17:20] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 08:17:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2024-05-24 08:17:20] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-24 08:17:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2024-05-24 08:17:20] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-05-24 08:17:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2024-05-24 08:17:20] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-24 08:17:20] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-24 08:17:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2024-05-24 08:17:20] [INFO ] After 727ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :8
Attempting to minimize the solution found.
Minimization took 102 ms.
[2024-05-24 08:17:20] [INFO ] After 1156ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :8
Fused 12 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 400/400 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 184 transition count 397
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 181 transition count 397
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 6 place count 181 transition count 347
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 106 place count 131 transition count 347
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 130 place count 119 transition count 335
Applied a total of 130 rules in 17 ms. Remains 119 /184 variables (removed 65) and now considering 335/400 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 119/184 places, 335/400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Finished probabilistic random walk after 58818 steps, run visited all 8 properties in 381 ms. (steps per millisecond=154 )
Probabilistic random walk after 58818 steps, saw 14352 distinct states, run finished after 381 ms. (steps per millisecond=154 ) properties seen :8
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p2) p0))), (G (NOT (AND p1 p2 p0))), (G (NOT (AND p1 (NOT p2) (NOT p0)))), (G (NOT (AND p1 (NOT p2) p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p2 p0)), (F p0), (F (NOT (AND (NOT p1) p2 (NOT p0)))), (F (NOT (OR p2 p0))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND p1 p2 (NOT p0))), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND p2 (NOT p0)))), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1)]
Knowledge based reduction with 23 factoid took 1711 ms. Reduced automaton from 11 states, 33 edges and 3 AP (stutter insensitive) to 16 states, 53 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 670 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 733 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false, false, false, false]
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 184 transition count 397
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 181 transition count 397
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 6 place count 181 transition count 347
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 106 place count 131 transition count 347
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 130 place count 119 transition count 335
Applied a total of 130 rules in 19 ms. Remains 119 /184 variables (removed 65) and now considering 335/400 (removed 65) transitions.
[2024-05-24 08:17:24] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
// Phase 1: matrix 171 rows 119 cols
[2024-05-24 08:17:24] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 08:17:25] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-24 08:17:25] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-05-24 08:17:25] [INFO ] Invariant cache hit.
[2024-05-24 08:17:25] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 08:17:25] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
[2024-05-24 08:17:25] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 08:17:25] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-05-24 08:17:25] [INFO ] Invariant cache hit.
[2024-05-24 08:17:25] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/184 places, 335/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 898 ms. Remains : 119/184 places, 335/400 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 p2 (NOT p1) (NOT p0)), (X (AND (NOT p1) p2)), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) p2 (NOT p0))), (X (AND p2 (NOT p0))), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (AND p2 (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 29 factoid took 431 ms. Reduced automaton from 16 states, 53 edges and 3 AP (stutter insensitive) to 16 states, 53 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 656 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), false, false, false, false, (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND p1 (NOT p0) (NOT p2)), false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 14) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-24 08:17:27] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-05-24 08:17:27] [INFO ] Invariant cache hit.
[2024-05-24 08:17:27] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-05-24 08:17:27] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-24 08:17:27] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:7
[2024-05-24 08:17:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-24 08:17:27] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-24 08:17:27] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :6
[2024-05-24 08:17:27] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 08:17:27] [INFO ] After 85ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :3 sat :6
[2024-05-24 08:17:27] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-24 08:17:27] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-24 08:17:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 94 ms
[2024-05-24 08:17:27] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-24 08:17:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-24 08:17:27] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2024-05-24 08:17:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 79 ms
[2024-05-24 08:17:28] [INFO ] After 399ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :5
Attempting to minimize the solution found.
Minimization took 55 ms.
[2024-05-24 08:17:28] [INFO ] After 654ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :5
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 6 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 335/335 transitions.
Applied a total of 0 rules in 6 ms. Remains 119 /119 variables (removed 0) and now considering 335/335 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 119/119 places, 335/335 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Finished probabilistic random walk after 58818 steps, run visited all 5 properties in 293 ms. (steps per millisecond=200 )
Probabilistic random walk after 58818 steps, saw 14352 distinct states, run finished after 293 ms. (steps per millisecond=200 ) properties seen :5
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (AND (NOT p1) p2)), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) p2 (NOT p0))), (X (AND p2 (NOT p0))), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (AND p2 (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (G (NOT (AND p1 (NOT p2) p0))), (G (NOT (AND p1 (NOT p2) (NOT p0)))), (G (NOT (AND p1 p2 p0))), (G (NOT (AND (NOT p1) (NOT p2) p0)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p2 p0)), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND p2 (NOT p0)))), (F p0), (F (AND p1 p2 (NOT p0))), (F (NOT p2)), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) p2 (NOT p0)))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 33 factoid took 2408 ms. Reduced automaton from 16 states, 53 edges and 3 AP (stutter insensitive) to 16 states, 53 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 658 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 729 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 657 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 2779 reset in 187 ms.
Product exploration explored 100000 steps with 2816 reset in 201 ms.
Built C files in :
/tmp/ltsmin12153074681449915741
[2024-05-24 08:17:33] [INFO ] Computing symmetric may disable matrix : 335 transitions.
[2024-05-24 08:17:33] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 08:17:33] [INFO ] Computing symmetric may enable matrix : 335 transitions.
[2024-05-24 08:17:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 08:17:33] [INFO ] Computing Do-Not-Accords matrix : 335 transitions.
[2024-05-24 08:17:33] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 08:17:33] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12153074681449915741
Running compilation step : cd /tmp/ltsmin12153074681449915741;'/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 1066 ms.
Running link step : cd /tmp/ltsmin12153074681449915741;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12153074681449915741;'/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/stateBased14299772905886616893.hoa' '--buchi-type=spotba'
LTSmin run took 5114 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-15 finished in 24337 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-04-LTLFireability-02
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 190/190 places, 424/424 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 190 transition count 420
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 186 transition count 420
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 186 transition count 368
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 134 transition count 368
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 118 place count 128 transition count 344
Iterating global reduction 2 with 6 rules applied. Total rules applied 124 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 148 place count 116 transition count 332
Applied a total of 148 rules in 21 ms. Remains 116 /190 variables (removed 74) and now considering 332/424 (removed 92) transitions.
[2024-05-24 08:17:40] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
// Phase 1: matrix 168 rows 116 cols
[2024-05-24 08:17:40] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 08:17:40] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-24 08:17:40] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-05-24 08:17:40] [INFO ] Invariant cache hit.
[2024-05-24 08:17:40] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 08:17:40] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
[2024-05-24 08:17:40] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-05-24 08:17:40] [INFO ] Invariant cache hit.
[2024-05-24 08:17:41] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 116/190 places, 332/424 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 835 ms. Remains : 116/190 places, 332/424 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-02 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 (EQ s3 0) (EQ s14 0) (EQ s79 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 195 ms.
Product exploration explored 100000 steps with 0 reset in 175 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 155 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 191 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 579726 steps, run visited all 1 properties in 1468 ms. (steps per millisecond=394 )
Probabilistic random walk after 579726 steps, saw 117256 distinct states, run finished after 1468 ms. (steps per millisecond=394 ) 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 96 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)]
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 332/332 transitions.
Applied a total of 0 rules in 1 ms. Remains 116 /116 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-24 08:17:43] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-05-24 08:17:43] [INFO ] Invariant cache hit.
[2024-05-24 08:17:43] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-24 08:17:43] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-05-24 08:17:43] [INFO ] Invariant cache hit.
[2024-05-24 08:17:43] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 08:17:44] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2024-05-24 08:17:44] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-05-24 08:17:44] [INFO ] Invariant cache hit.
[2024-05-24 08:17:44] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 624 ms. Remains : 116/116 places, 332/332 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 73 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 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) 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 579726 steps, run visited all 1 properties in 1471 ms. (steps per millisecond=394 )
Probabilistic random walk after 579726 steps, saw 117256 distinct states, run finished after 1471 ms. (steps per millisecond=394 ) 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 99 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 132 ms.
Product exploration explored 100000 steps with 0 reset in 151 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 332/332 transitions.
Applied a total of 0 rules in 7 ms. Remains 116 /116 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-24 08:17:46] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-24 08:17:46] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-05-24 08:17:46] [INFO ] Invariant cache hit.
[2024-05-24 08:17:47] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 412 ms. Remains : 116/116 places, 332/332 transitions.
Built C files in :
/tmp/ltsmin3913626546464398652
[2024-05-24 08:17:47] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3913626546464398652
Running compilation step : cd /tmp/ltsmin3913626546464398652;'/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 788 ms.
Running link step : cd /tmp/ltsmin3913626546464398652;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin3913626546464398652;'/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/stateBased4774920781832405838.hoa' '--buchi-type=spotba'
LTSmin run took 6243 ms.
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-02 finished in 14424 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-02 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-24 08:17:54] [INFO ] Flatten gal took : 23 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 182504 ms.

BK_STOP 1716538675647

--------------------
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-04"
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-04, 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-171636279900098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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