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.r571-tall-171734910400193.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 FireWire-PT-18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910400193
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 168K Jun 2 16:33 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 FireWire-PT-18-LTLFireability-00
FORMULA_NAME FireWire-PT-18-LTLFireability-01
FORMULA_NAME FireWire-PT-18-LTLFireability-02
FORMULA_NAME FireWire-PT-18-LTLFireability-03
FORMULA_NAME FireWire-PT-18-LTLFireability-04
FORMULA_NAME FireWire-PT-18-LTLFireability-05
FORMULA_NAME FireWire-PT-18-LTLFireability-06
FORMULA_NAME FireWire-PT-18-LTLFireability-07
FORMULA_NAME FireWire-PT-18-LTLFireability-08
FORMULA_NAME FireWire-PT-18-LTLFireability-09
FORMULA_NAME FireWire-PT-18-LTLFireability-10
FORMULA_NAME FireWire-PT-18-LTLFireability-11
FORMULA_NAME FireWire-PT-18-LTLFireability-12
FORMULA_NAME FireWire-PT-18-LTLFireability-13
FORMULA_NAME FireWire-PT-18-LTLFireability-14
FORMULA_NAME FireWire-PT-18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717371497871

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=FireWire-PT-18
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 23:38:19] [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-06-02 23:38:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:38:19] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-06-02 23:38:19] [INFO ] Transformed 437 places.
[2024-06-02 23:38:19] [INFO ] Transformed 707 transitions.
[2024-06-02 23:38:19] [INFO ] Found NUPN structural information;
[2024-06-02 23:38:19] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA FireWire-PT-18-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 437 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 437/437 places, 707/707 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 427 transition count 707
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 107 place count 330 transition count 610
Iterating global reduction 1 with 97 rules applied. Total rules applied 204 place count 330 transition count 610
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 205 place count 330 transition count 609
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 224 place count 311 transition count 560
Iterating global reduction 2 with 19 rules applied. Total rules applied 243 place count 311 transition count 560
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 247 place count 307 transition count 554
Iterating global reduction 2 with 4 rules applied. Total rules applied 251 place count 307 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 252 place count 307 transition count 553
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 253 place count 306 transition count 550
Iterating global reduction 3 with 1 rules applied. Total rules applied 254 place count 306 transition count 550
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 255 place count 305 transition count 548
Iterating global reduction 3 with 1 rules applied. Total rules applied 256 place count 305 transition count 548
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 257 place count 304 transition count 545
Iterating global reduction 3 with 1 rules applied. Total rules applied 258 place count 304 transition count 545
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 259 place count 303 transition count 543
Iterating global reduction 3 with 1 rules applied. Total rules applied 260 place count 303 transition count 543
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 261 place count 302 transition count 540
Iterating global reduction 3 with 1 rules applied. Total rules applied 262 place count 302 transition count 540
Applied a total of 262 rules in 100 ms. Remains 302 /437 variables (removed 135) and now considering 540/707 (removed 167) transitions.
// Phase 1: matrix 540 rows 302 cols
[2024-06-02 23:38:20] [INFO ] Computed 7 invariants in 20 ms
[2024-06-02 23:38:20] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-06-02 23:38:20] [INFO ] Invariant cache hit.
[2024-06-02 23:38:20] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 852 ms to find 0 implicit places.
[2024-06-02 23:38:20] [INFO ] Invariant cache hit.
[2024-06-02 23:38:20] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 302/437 places, 540/707 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1164 ms. Remains : 302/437 places, 540/707 transitions.
Support contains 31 out of 302 places after structural reductions.
[2024-06-02 23:38:21] [INFO ] Flatten gal took : 69 ms
[2024-06-02 23:38:21] [INFO ] Flatten gal took : 36 ms
[2024-06-02 23:38:21] [INFO ] Input system was already deterministic with 540 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 445 ms. (steps per millisecond=22 ) properties (out of 21) seen :5
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2024-06-02 23:38:21] [INFO ] Invariant cache hit.
[2024-06-02 23:38:21] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-06-02 23:38:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:38:22] [INFO ] After 447ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2024-06-02 23:38:22] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 4 ms to minimize.
[2024-06-02 23:38:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2024-06-02 23:38:23] [INFO ] After 1264ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 354 ms.
[2024-06-02 23:38:23] [INFO ] After 1846ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 207 ms.
Support contains 22 out of 302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 302/302 places, 540/540 transitions.
Graph (trivial) has 188 edges and 302 vertex of which 11 / 302 are part of one of the 3 SCC in 7 ms
Free SCC test removed 8 places
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 294 transition count 496
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 264 transition count 494
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 66 place count 263 transition count 492
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 261 transition count 492
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 68 place count 261 transition count 465
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 122 place count 234 transition count 465
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 124 place count 232 transition count 463
Iterating global reduction 4 with 2 rules applied. Total rules applied 126 place count 232 transition count 463
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 129 place count 232 transition count 460
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 130 place count 231 transition count 460
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 184 place count 204 transition count 433
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -102
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 236 place count 178 transition count 535
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 245 place count 178 transition count 526
Free-agglomeration rule applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 255 place count 178 transition count 516
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 265 place count 168 transition count 516
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 269 place count 168 transition count 512
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 271 place count 168 transition count 512
Applied a total of 271 rules in 142 ms. Remains 168 /302 variables (removed 134) and now considering 512/540 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 168/302 places, 512/540 transitions.
Incomplete random walk after 10000 steps, including 406 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 99 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-06-02 23:38:24] [INFO ] Flow matrix only has 498 transitions (discarded 14 similar events)
// Phase 1: matrix 498 rows 168 cols
[2024-06-02 23:38:24] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:38:24] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:24] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-02 23:38:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:24] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-06-02 23:38:24] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 23:38:25] [INFO ] After 155ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-06-02 23:38:25] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-06-02 23:38:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2024-06-02 23:38:25] [INFO ] After 446ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 108 ms.
[2024-06-02 23:38:25] [INFO ] After 806ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 17 ms.
Support contains 11 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 512/512 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 168 transition count 510
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 166 transition count 510
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 166 transition count 507
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 163 transition count 507
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 161 transition count 417
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 161 transition count 417
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 161 transition count 415
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 3 with 2 rules applied. Total rules applied 18 place count 160 transition count 414
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 26 place count 156 transition count 426
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 156 transition count 424
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 156 transition count 422
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 32 place count 154 transition count 422
Applied a total of 32 rules in 44 ms. Remains 154 /168 variables (removed 14) and now considering 422/512 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 154/168 places, 422/512 transitions.
Incomplete random walk after 10000 steps, including 455 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 92 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 474105 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :{0=1, 2=1, 6=1}
Probabilistic random walk after 474105 steps, saw 146315 distinct states, run finished after 3003 ms. (steps per millisecond=157 ) properties seen :3
Running SMT prover for 4 properties.
[2024-06-02 23:38:29] [INFO ] Flow matrix only has 412 transitions (discarded 10 similar events)
// Phase 1: matrix 412 rows 154 cols
[2024-06-02 23:38:29] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:38:29] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:29] [INFO ] After 119ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2024-06-02 23:38:29] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-06-02 23:38:29] [INFO ] After 41ms SMT Verify possible using 34 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 23:38:29] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 23:38:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:29] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 23:38:29] [INFO ] After 79ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-06-02 23:38:29] [INFO ] After 165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 49 ms.
[2024-06-02 23:38:29] [INFO ] After 410ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 25 ms.
Support contains 6 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 422/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 154 transition count 421
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 153 transition count 421
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 4 place count 152 transition count 420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 151 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 151 transition count 419
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 151 transition count 416
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 17 place count 148 transition count 411
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 146 transition count 409
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 146 transition count 409
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 24 place count 146 transition count 406
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 36 place count 146 transition count 394
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 146 transition count 394
Applied a total of 37 rules in 44 ms. Remains 146 /154 variables (removed 8) and now considering 394/422 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 146/154 places, 394/422 transitions.
Incomplete random walk after 10000 steps, including 482 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 126 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 434726 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :{1=1}
Probabilistic random walk after 434726 steps, saw 137871 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :1
Running SMT prover for 3 properties.
[2024-06-02 23:38:33] [INFO ] Flow matrix only has 388 transitions (discarded 6 similar events)
// Phase 1: matrix 388 rows 146 cols
[2024-06-02 23:38:33] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:38:33] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:33] [INFO ] After 96ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-06-02 23:38:33] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-02 23:38:33] [INFO ] After 33ms SMT Verify possible using 69 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:38:33] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:38:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:33] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 23:38:33] [INFO ] After 69ms SMT Verify possible using 69 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 23:38:33] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 0 ms to minimize.
[2024-06-02 23:38:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2024-06-02 23:38:33] [INFO ] After 254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 39 ms.
[2024-06-02 23:38:33] [INFO ] After 460ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 394/394 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 145 transition count 393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 144 transition count 392
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 144 transition count 392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 143 transition count 386
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 143 transition count 386
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 142 transition count 384
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 142 transition count 384
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 141 transition count 381
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 141 transition count 381
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 140 transition count 379
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 140 transition count 379
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 139 transition count 376
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 139 transition count 376
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 138 transition count 374
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 138 transition count 374
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 137 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 137 transition count 371
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 136 transition count 369
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 136 transition count 369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 135 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 135 transition count 366
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 134 transition count 364
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 134 transition count 364
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 133 transition count 362
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 133 transition count 362
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 132 transition count 360
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 132 transition count 360
Applied a total of 28 rules in 40 ms. Remains 132 /146 variables (removed 14) and now considering 360/394 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 132/146 places, 360/394 transitions.
Incomplete random walk after 10000 steps, including 462 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 647452 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 647452 steps, saw 198977 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 3 properties.
[2024-06-02 23:38:37] [INFO ] Flow matrix only has 354 transitions (discarded 6 similar events)
// Phase 1: matrix 354 rows 132 cols
[2024-06-02 23:38:37] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:38:37] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:38:37] [INFO ] After 94ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-06-02 23:38:37] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 23:38:37] [INFO ] After 34ms SMT Verify possible using 63 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:38:37] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:38:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:37] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 23:38:37] [INFO ] After 51ms SMT Verify possible using 63 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 23:38:37] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 0 ms to minimize.
[2024-06-02 23:38:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-06-02 23:38:37] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:38:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-06-02 23:38:37] [INFO ] After 272ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-06-02 23:38:37] [INFO ] After 457ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 17 ms.
Support contains 5 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 360/360 transitions.
Applied a total of 0 rules in 9 ms. Remains 132 /132 variables (removed 0) and now considering 360/360 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 132/132 places, 360/360 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 360/360 transitions.
Applied a total of 0 rules in 6 ms. Remains 132 /132 variables (removed 0) and now considering 360/360 (removed 0) transitions.
[2024-06-02 23:38:37] [INFO ] Flow matrix only has 354 transitions (discarded 6 similar events)
[2024-06-02 23:38:37] [INFO ] Invariant cache hit.
[2024-06-02 23:38:37] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 23:38:37] [INFO ] Flow matrix only has 354 transitions (discarded 6 similar events)
[2024-06-02 23:38:37] [INFO ] Invariant cache hit.
[2024-06-02 23:38:38] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 23:38:38] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2024-06-02 23:38:38] [INFO ] Redundant transitions in 23 ms returned []
[2024-06-02 23:38:38] [INFO ] Flow matrix only has 354 transitions (discarded 6 similar events)
[2024-06-02 23:38:38] [INFO ] Invariant cache hit.
[2024-06-02 23:38:38] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 476 ms. Remains : 132/132 places, 360/360 transitions.
Graph (trivial) has 78 edges and 132 vertex of which 22 / 132 are part of one of the 4 SCC in 0 ms
Free SCC test removed 18 places
Drop transitions removed 101 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 112 transition count 241
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 112 transition count 241
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 9 place count 112 transition count 237
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 1 with 2 rules applied. Total rules applied 11 place count 111 transition count 236
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 1 with 14 rules applied. Total rules applied 25 place count 111 transition count 222
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 111 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 110 transition count 221
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 27 place count 110 transition count 220
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 109 transition count 220
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 33 place count 107 transition count 218
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 106 transition count 223
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 38 place count 106 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 105 transition count 219
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 104 transition count 190
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 104 transition count 190
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 45 place count 104 transition count 187
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 49 place count 101 transition count 186
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 53 place count 101 transition count 182
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 55 place count 101 transition count 180
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 57 place count 99 transition count 180
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 63 place count 99 transition count 180
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 64 place count 99 transition count 179
Applied a total of 64 rules in 34 ms. Remains 99 /132 variables (removed 33) and now considering 179/360 (removed 181) transitions.
Running SMT prover for 3 properties.
[2024-06-02 23:38:38] [INFO ] Flow matrix only has 177 transitions (discarded 2 similar events)
// Phase 1: matrix 177 rows 99 cols
[2024-06-02 23:38:38] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:38:38] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:38:38] [INFO ] After 48ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-06-02 23:38:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 23:38:38] [INFO ] After 12ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:38:38] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:38:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:38] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 23:38:38] [INFO ] After 30ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 23:38:38] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-06-02 23:38:38] [INFO ] After 159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA FireWire-PT-18-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 86 stabilizing places and 132 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||G(p1)))))'
Support contains 4 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 540/540 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 291 transition count 490
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 291 transition count 490
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 291 transition count 488
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 285 transition count 479
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 285 transition count 479
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 281 transition count 472
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 281 transition count 472
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 279 transition count 466
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 279 transition count 466
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 277 transition count 462
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 277 transition count 462
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 275 transition count 457
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 275 transition count 457
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 273 transition count 453
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 273 transition count 453
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 271 transition count 449
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 271 transition count 449
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 270 transition count 447
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 270 transition count 447
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 269 transition count 444
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 269 transition count 444
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 268 transition count 442
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 268 transition count 442
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 267 transition count 439
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 267 transition count 439
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 266 transition count 437
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 266 transition count 437
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 265 transition count 435
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 265 transition count 435
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 264 transition count 433
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 264 transition count 433
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 263 transition count 432
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 263 transition count 432
Applied a total of 80 rules in 32 ms. Remains 263 /302 variables (removed 39) and now considering 432/540 (removed 108) transitions.
// Phase 1: matrix 432 rows 263 cols
[2024-06-02 23:38:38] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 23:38:39] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 23:38:39] [INFO ] Invariant cache hit.
[2024-06-02 23:38:39] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2024-06-02 23:38:39] [INFO ] Invariant cache hit.
[2024-06-02 23:38:39] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 263/302 places, 432/540 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 509 ms. Remains : 263/302 places, 432/540 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 278 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-18-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s128 0) (EQ s122 0)), p1:(AND (EQ s18 1) (EQ s248 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 281 ms.
Product exploration explored 100000 steps with 33333 reset in 216 ms.
Computed a total of 56 stabilizing places and 72 stable transitions
Computed a total of 56 stabilizing places and 72 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-18-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-18-LTLFireability-01 finished in 1375 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||F(p1)))) U p0))'
Support contains 3 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 540/540 transitions.
Graph (trivial) has 214 edges and 302 vertex of which 11 / 302 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 293 transition count 492
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 79 place count 255 transition count 490
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 254 transition count 490
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 80 place count 254 transition count 464
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 132 place count 228 transition count 464
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 139 place count 221 transition count 418
Iterating global reduction 3 with 7 rules applied. Total rules applied 146 place count 221 transition count 418
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 150 place count 221 transition count 414
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 151 place count 220 transition count 414
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 151 place count 220 transition count 413
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 153 place count 219 transition count 413
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 156 place count 216 transition count 408
Iterating global reduction 5 with 3 rules applied. Total rules applied 159 place count 216 transition count 408
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 161 place count 214 transition count 404
Iterating global reduction 5 with 2 rules applied. Total rules applied 163 place count 214 transition count 404
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 165 place count 212 transition count 398
Iterating global reduction 5 with 2 rules applied. Total rules applied 167 place count 212 transition count 398
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 169 place count 210 transition count 394
Iterating global reduction 5 with 2 rules applied. Total rules applied 171 place count 210 transition count 394
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 173 place count 208 transition count 389
Iterating global reduction 5 with 2 rules applied. Total rules applied 175 place count 208 transition count 389
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 177 place count 206 transition count 385
Iterating global reduction 5 with 2 rules applied. Total rules applied 179 place count 206 transition count 385
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 180 place count 205 transition count 382
Iterating global reduction 5 with 1 rules applied. Total rules applied 181 place count 205 transition count 382
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 182 place count 204 transition count 380
Iterating global reduction 5 with 1 rules applied. Total rules applied 183 place count 204 transition count 380
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 184 place count 203 transition count 377
Iterating global reduction 5 with 1 rules applied. Total rules applied 185 place count 203 transition count 377
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 186 place count 202 transition count 375
Iterating global reduction 5 with 1 rules applied. Total rules applied 187 place count 202 transition count 375
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 188 place count 201 transition count 372
Iterating global reduction 5 with 1 rules applied. Total rules applied 189 place count 201 transition count 372
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 190 place count 200 transition count 370
Iterating global reduction 5 with 1 rules applied. Total rules applied 191 place count 200 transition count 370
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 192 place count 199 transition count 368
Iterating global reduction 5 with 1 rules applied. Total rules applied 193 place count 199 transition count 368
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 194 place count 198 transition count 366
Iterating global reduction 5 with 1 rules applied. Total rules applied 195 place count 198 transition count 366
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 249 place count 171 transition count 339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 250 place count 171 transition count 338
Performed 30 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 310 place count 141 transition count 418
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 312 place count 141 transition count 416
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 313 place count 140 transition count 415
Applied a total of 313 rules in 102 ms. Remains 140 /302 variables (removed 162) and now considering 415/540 (removed 125) transitions.
[2024-06-02 23:38:40] [INFO ] Flow matrix only has 396 transitions (discarded 19 similar events)
// Phase 1: matrix 396 rows 140 cols
[2024-06-02 23:38:40] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:38:40] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 23:38:40] [INFO ] Flow matrix only has 396 transitions (discarded 19 similar events)
[2024-06-02 23:38:40] [INFO ] Invariant cache hit.
[2024-06-02 23:38:40] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-02 23:38:40] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2024-06-02 23:38:40] [INFO ] Redundant transitions in 14 ms returned []
[2024-06-02 23:38:40] [INFO ] Flow matrix only has 396 transitions (discarded 19 similar events)
[2024-06-02 23:38:40] [INFO ] Invariant cache hit.
[2024-06-02 23:38:40] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/302 places, 415/540 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 537 ms. Remains : 140/302 places, 415/540 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-18-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s133 1), p1:(AND (EQ s81 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-18-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLFireability-02 finished in 680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((F(p0)||(X(p1) U p2))))))'
Support contains 5 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 540/540 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 292 transition count 492
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 292 transition count 492
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 292 transition count 490
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 287 transition count 484
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 287 transition count 484
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 284 transition count 479
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 284 transition count 479
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 283 transition count 476
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 283 transition count 476
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 282 transition count 474
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 282 transition count 474
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 281 transition count 471
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 281 transition count 471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 280 transition count 469
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 280 transition count 469
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 279 transition count 466
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 279 transition count 466
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 278 transition count 464
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 278 transition count 464
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 277 transition count 461
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 277 transition count 461
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 276 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 276 transition count 459
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 275 transition count 456
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 275 transition count 456
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 274 transition count 454
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 274 transition count 454
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 273 transition count 452
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 273 transition count 452
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 272 transition count 450
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 272 transition count 450
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 271 transition count 449
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 271 transition count 449
Applied a total of 64 rules in 46 ms. Remains 271 /302 variables (removed 31) and now considering 449/540 (removed 91) transitions.
// Phase 1: matrix 449 rows 271 cols
[2024-06-02 23:38:40] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:38:41] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 23:38:41] [INFO ] Invariant cache hit.
[2024-06-02 23:38:41] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2024-06-02 23:38:41] [INFO ] Invariant cache hit.
[2024-06-02 23:38:41] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 271/302 places, 449/540 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 562 ms. Remains : 271/302 places, 449/540 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FireWire-PT-18-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s226 0), p2:(AND (EQ s30 1) (EQ s203 1)), p1:(AND (EQ s15 1) (EQ s251 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 100 ms.
Product exploration explored 100000 steps with 0 reset in 197 ms.
Computed a total of 64 stabilizing places and 89 stable transitions
Computed a total of 64 stabilizing places and 89 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 94 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Finished probabilistic random walk after 6295 steps, run visited all 3 properties in 29 ms. (steps per millisecond=217 )
Probabilistic random walk after 6295 steps, saw 1744 distinct states, run finished after 29 ms. (steps per millisecond=217 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 161 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 449/449 transitions.
Applied a total of 0 rules in 4 ms. Remains 271 /271 variables (removed 0) and now considering 449/449 (removed 0) transitions.
[2024-06-02 23:38:43] [INFO ] Invariant cache hit.
[2024-06-02 23:38:43] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 23:38:43] [INFO ] Invariant cache hit.
[2024-06-02 23:38:43] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-06-02 23:38:43] [INFO ] Invariant cache hit.
[2024-06-02 23:38:43] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 531 ms. Remains : 271/271 places, 449/449 transitions.
Computed a total of 64 stabilizing places and 89 stable transitions
Computed a total of 64 stabilizing places and 89 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 91 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Finished probabilistic random walk after 6295 steps, run visited all 3 properties in 24 ms. (steps per millisecond=262 )
Probabilistic random walk after 6295 steps, saw 1744 distinct states, run finished after 25 ms. (steps per millisecond=251 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 222 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 94 ms.
Product exploration explored 100000 steps with 1 reset in 127 ms.
Built C files in :
/tmp/ltsmin11122715890975846908
[2024-06-02 23:38:45] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11122715890975846908
Running compilation step : cd /tmp/ltsmin11122715890975846908;'/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 693 ms.
Running link step : cd /tmp/ltsmin11122715890975846908;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin11122715890975846908;'/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/stateBased1819580340165172028.hoa' '--buchi-type=spotba'
LTSmin run took 476 ms.
FORMULA FireWire-PT-18-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-18-LTLFireability-08 finished in 5532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p1 U p2)&&p0))))'
Support contains 4 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 540/540 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 293 transition count 530
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 293 transition count 530
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 293 transition count 529
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 287 transition count 520
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 287 transition count 520
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 283 transition count 513
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 283 transition count 513
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 281 transition count 507
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 281 transition count 507
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 279 transition count 503
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 279 transition count 503
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 277 transition count 498
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 277 transition count 498
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 275 transition count 494
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 275 transition count 494
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 273 transition count 490
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 273 transition count 490
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 272 transition count 488
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 272 transition count 488
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 271 transition count 485
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 271 transition count 485
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 270 transition count 483
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 270 transition count 483
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 269 transition count 480
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 269 transition count 480
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 268 transition count 478
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 268 transition count 478
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 267 transition count 476
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 267 transition count 476
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 266 transition count 474
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 266 transition count 474
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 265 transition count 473
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 265 transition count 473
Applied a total of 75 rules in 39 ms. Remains 265 /302 variables (removed 37) and now considering 473/540 (removed 67) transitions.
// Phase 1: matrix 473 rows 265 cols
[2024-06-02 23:38:46] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:38:46] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 23:38:46] [INFO ] Invariant cache hit.
[2024-06-02 23:38:46] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-06-02 23:38:46] [INFO ] Invariant cache hit.
[2024-06-02 23:38:47] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 265/302 places, 473/540 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 545 ms. Remains : 265/302 places, 473/540 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : FireWire-PT-18-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s25 1) (EQ s229 1)), p1:(AND (EQ s27 1) (EQ s242 1)), p0:(AND (EQ s27 1) (EQ s242 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 98 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLFireability-10 finished in 698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 6 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 540/540 transitions.
Graph (trivial) has 214 edges and 302 vertex of which 11 / 302 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 293 transition count 492
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 79 place count 255 transition count 490
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 254 transition count 490
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 80 place count 254 transition count 463
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 134 place count 227 transition count 463
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 143 place count 218 transition count 415
Iterating global reduction 3 with 9 rules applied. Total rules applied 152 place count 218 transition count 415
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 157 place count 218 transition count 410
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 158 place count 217 transition count 410
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 158 place count 217 transition count 408
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 162 place count 215 transition count 408
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 166 place count 211 transition count 402
Iterating global reduction 5 with 4 rules applied. Total rules applied 170 place count 211 transition count 402
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 173 place count 208 transition count 396
Iterating global reduction 5 with 3 rules applied. Total rules applied 176 place count 208 transition count 396
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 178 place count 206 transition count 390
Iterating global reduction 5 with 2 rules applied. Total rules applied 180 place count 206 transition count 390
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 182 place count 204 transition count 386
Iterating global reduction 5 with 2 rules applied. Total rules applied 184 place count 204 transition count 386
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 186 place count 202 transition count 381
Iterating global reduction 5 with 2 rules applied. Total rules applied 188 place count 202 transition count 381
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 190 place count 200 transition count 377
Iterating global reduction 5 with 2 rules applied. Total rules applied 192 place count 200 transition count 377
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 193 place count 199 transition count 374
Iterating global reduction 5 with 1 rules applied. Total rules applied 194 place count 199 transition count 374
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 195 place count 198 transition count 372
Iterating global reduction 5 with 1 rules applied. Total rules applied 196 place count 198 transition count 372
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 197 place count 197 transition count 369
Iterating global reduction 5 with 1 rules applied. Total rules applied 198 place count 197 transition count 369
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 199 place count 196 transition count 367
Iterating global reduction 5 with 1 rules applied. Total rules applied 200 place count 196 transition count 367
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 201 place count 195 transition count 364
Iterating global reduction 5 with 1 rules applied. Total rules applied 202 place count 195 transition count 364
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 203 place count 194 transition count 362
Iterating global reduction 5 with 1 rules applied. Total rules applied 204 place count 194 transition count 362
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 252 place count 170 transition count 338
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 253 place count 170 transition count 337
Performed 30 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 313 place count 140 transition count 401
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 315 place count 140 transition count 399
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 316 place count 139 transition count 398
Applied a total of 316 rules in 67 ms. Remains 139 /302 variables (removed 163) and now considering 398/540 (removed 142) transitions.
[2024-06-02 23:38:47] [INFO ] Flow matrix only has 379 transitions (discarded 19 similar events)
// Phase 1: matrix 379 rows 139 cols
[2024-06-02 23:38:47] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:38:47] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-06-02 23:38:47] [INFO ] Flow matrix only has 379 transitions (discarded 19 similar events)
[2024-06-02 23:38:47] [INFO ] Invariant cache hit.
[2024-06-02 23:38:47] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-02 23:38:47] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2024-06-02 23:38:47] [INFO ] Redundant transitions in 8 ms returned []
[2024-06-02 23:38:47] [INFO ] Flow matrix only has 379 transitions (discarded 19 similar events)
[2024-06-02 23:38:47] [INFO ] Invariant cache hit.
[2024-06-02 23:38:47] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/302 places, 398/540 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 590 ms. Remains : 139/302 places, 398/540 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FireWire-PT-18-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s15 0) (EQ s75 0) (AND (EQ s5 1) (EQ s99 1))), p0:(AND (EQ s11 1) (EQ s125 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 54 ms.
Product exploration explored 100000 steps with 1 reset in 76 ms.
Computed a total of 23 stabilizing places and 40 stable transitions
Computed a total of 23 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 150 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 9786 steps, including 508 resets, run visited all 2 properties in 31 ms. (steps per millisecond=315 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 114 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 6 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 398/398 transitions.
Applied a total of 0 rules in 9 ms. Remains 139 /139 variables (removed 0) and now considering 398/398 (removed 0) transitions.
[2024-06-02 23:38:48] [INFO ] Flow matrix only has 379 transitions (discarded 19 similar events)
[2024-06-02 23:38:48] [INFO ] Invariant cache hit.
[2024-06-02 23:38:48] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-02 23:38:48] [INFO ] Flow matrix only has 379 transitions (discarded 19 similar events)
[2024-06-02 23:38:48] [INFO ] Invariant cache hit.
[2024-06-02 23:38:48] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-02 23:38:48] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2024-06-02 23:38:48] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 23:38:48] [INFO ] Flow matrix only has 379 transitions (discarded 19 similar events)
[2024-06-02 23:38:48] [INFO ] Invariant cache hit.
[2024-06-02 23:38:49] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 484 ms. Remains : 139/139 places, 398/398 transitions.
Computed a total of 23 stabilizing places and 40 stable transitions
Computed a total of 23 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 1395 steps, including 71 resets, run visited all 2 properties in 8 ms. (steps per millisecond=174 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 158 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 48 ms.
Product exploration explored 100000 steps with 0 reset in 51 ms.
Built C files in :
/tmp/ltsmin13158228961399775151
[2024-06-02 23:38:49] [INFO ] Computing symmetric may disable matrix : 398 transitions.
[2024-06-02 23:38:49] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:38:49] [INFO ] Computing symmetric may enable matrix : 398 transitions.
[2024-06-02 23:38:49] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:38:49] [INFO ] Computing Do-Not-Accords matrix : 398 transitions.
[2024-06-02 23:38:49] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:38:49] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13158228961399775151
Running compilation step : cd /tmp/ltsmin13158228961399775151;'/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 769 ms.
Running link step : cd /tmp/ltsmin13158228961399775151;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13158228961399775151;'/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/stateBased18302781983576042120.hoa' '--buchi-type=spotba'
LTSmin run took 777 ms.
FORMULA FireWire-PT-18-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-18-LTLFireability-11 finished in 4246 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)) U !p0)))'
Support contains 2 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 540/540 transitions.
Graph (trivial) has 215 edges and 302 vertex of which 11 / 302 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 293 transition count 493
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 39 rules applied. Total rules applied 77 place count 256 transition count 491
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 255 transition count 491
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 78 place count 255 transition count 464
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 132 place count 228 transition count 464
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 140 place count 220 transition count 436
Iterating global reduction 3 with 8 rules applied. Total rules applied 148 place count 220 transition count 436
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 152 place count 220 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 153 place count 219 transition count 432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 153 place count 219 transition count 430
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 157 place count 217 transition count 430
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 161 place count 213 transition count 424
Iterating global reduction 5 with 4 rules applied. Total rules applied 165 place count 213 transition count 424
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 168 place count 210 transition count 418
Iterating global reduction 5 with 3 rules applied. Total rules applied 171 place count 210 transition count 418
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 173 place count 208 transition count 412
Iterating global reduction 5 with 2 rules applied. Total rules applied 175 place count 208 transition count 412
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 177 place count 206 transition count 408
Iterating global reduction 5 with 2 rules applied. Total rules applied 179 place count 206 transition count 408
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 181 place count 204 transition count 403
Iterating global reduction 5 with 2 rules applied. Total rules applied 183 place count 204 transition count 403
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 185 place count 202 transition count 399
Iterating global reduction 5 with 2 rules applied. Total rules applied 187 place count 202 transition count 399
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 188 place count 201 transition count 396
Iterating global reduction 5 with 1 rules applied. Total rules applied 189 place count 201 transition count 396
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 190 place count 200 transition count 394
Iterating global reduction 5 with 1 rules applied. Total rules applied 191 place count 200 transition count 394
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 192 place count 199 transition count 391
Iterating global reduction 5 with 1 rules applied. Total rules applied 193 place count 199 transition count 391
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 194 place count 198 transition count 389
Iterating global reduction 5 with 1 rules applied. Total rules applied 195 place count 198 transition count 389
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 196 place count 197 transition count 386
Iterating global reduction 5 with 1 rules applied. Total rules applied 197 place count 197 transition count 386
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 198 place count 196 transition count 384
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 196 transition count 384
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 200 place count 195 transition count 382
Iterating global reduction 5 with 1 rules applied. Total rules applied 201 place count 195 transition count 382
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 202 place count 194 transition count 380
Iterating global reduction 5 with 1 rules applied. Total rules applied 203 place count 194 transition count 380
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 251 place count 170 transition count 356
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 252 place count 170 transition count 355
Performed 31 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 314 place count 139 transition count 472
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 318 place count 139 transition count 468
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 319 place count 138 transition count 467
Applied a total of 319 rules in 77 ms. Remains 138 /302 variables (removed 164) and now considering 467/540 (removed 73) transitions.
[2024-06-02 23:38:51] [INFO ] Flow matrix only has 443 transitions (discarded 24 similar events)
// Phase 1: matrix 443 rows 138 cols
[2024-06-02 23:38:51] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:38:51] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 23:38:51] [INFO ] Flow matrix only has 443 transitions (discarded 24 similar events)
[2024-06-02 23:38:51] [INFO ] Invariant cache hit.
[2024-06-02 23:38:51] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-02 23:38:51] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2024-06-02 23:38:51] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 23:38:51] [INFO ] Flow matrix only has 443 transitions (discarded 24 similar events)
[2024-06-02 23:38:51] [INFO ] Invariant cache hit.
[2024-06-02 23:38:51] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 138/302 places, 467/540 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 531 ms. Remains : 138/302 places, 467/540 transitions.
Stuttering acceptance computed with spot in 150 ms :[p0]
Running random walk in product with property : FireWire-PT-18-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s121 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 42 ms.
Product exploration explored 100000 steps with 2 reset in 43 ms.
Computed a total of 21 stabilizing places and 36 stable transitions
Computed a total of 21 stabilizing places and 36 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[p0]
Incomplete random walk after 10000 steps, including 520 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 122 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3785 steps, run visited all 1 properties in 16 ms. (steps per millisecond=236 )
Probabilistic random walk after 3785 steps, saw 1588 distinct states, run finished after 16 ms. (steps per millisecond=236 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[p0]
Stuttering acceptance computed with spot in 30 ms :[p0]
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 467/467 transitions.
Applied a total of 0 rules in 14 ms. Remains 138 /138 variables (removed 0) and now considering 467/467 (removed 0) transitions.
[2024-06-02 23:38:52] [INFO ] Flow matrix only has 443 transitions (discarded 24 similar events)
[2024-06-02 23:38:52] [INFO ] Invariant cache hit.
[2024-06-02 23:38:52] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 23:38:52] [INFO ] Flow matrix only has 443 transitions (discarded 24 similar events)
[2024-06-02 23:38:52] [INFO ] Invariant cache hit.
[2024-06-02 23:38:52] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-02 23:38:52] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-06-02 23:38:52] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 23:38:52] [INFO ] Flow matrix only has 443 transitions (discarded 24 similar events)
[2024-06-02 23:38:52] [INFO ] Invariant cache hit.
[2024-06-02 23:38:53] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 477 ms. Remains : 138/138 places, 467/467 transitions.
Computed a total of 21 stabilizing places and 36 stable transitions
Computed a total of 21 stabilizing places and 36 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[p0]
Incomplete random walk after 10000 steps, including 523 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3785 steps, run visited all 1 properties in 15 ms. (steps per millisecond=252 )
Probabilistic random walk after 3785 steps, saw 1588 distinct states, run finished after 15 ms. (steps per millisecond=252 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[p0]
Stuttering acceptance computed with spot in 27 ms :[p0]
Stuttering acceptance computed with spot in 32 ms :[p0]
Product exploration explored 100000 steps with 6 reset in 47 ms.
Product exploration explored 100000 steps with 3 reset in 45 ms.
Built C files in :
/tmp/ltsmin2057273506910232271
[2024-06-02 23:38:53] [INFO ] Computing symmetric may disable matrix : 467 transitions.
[2024-06-02 23:38:53] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:38:53] [INFO ] Computing symmetric may enable matrix : 467 transitions.
[2024-06-02 23:38:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:38:53] [INFO ] Computing Do-Not-Accords matrix : 467 transitions.
[2024-06-02 23:38:53] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:38:53] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2057273506910232271
Running compilation step : cd /tmp/ltsmin2057273506910232271;'/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 958 ms.
Running link step : cd /tmp/ltsmin2057273506910232271;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin2057273506910232271;'/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/stateBased14275421119850780211.hoa' '--buchi-type=spotba'
LTSmin run took 1138 ms.
FORMULA FireWire-PT-18-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-18-LTLFireability-12 finished in 4301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 540/540 transitions.
Graph (trivial) has 212 edges and 302 vertex of which 11 / 302 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 293 transition count 493
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 39 rules applied. Total rules applied 77 place count 256 transition count 491
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 255 transition count 490
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 254 transition count 490
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 80 place count 254 transition count 463
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 134 place count 227 transition count 463
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 142 place count 219 transition count 416
Iterating global reduction 4 with 8 rules applied. Total rules applied 150 place count 219 transition count 416
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 155 place count 219 transition count 411
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 156 place count 218 transition count 411
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 156 place count 218 transition count 409
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 160 place count 216 transition count 409
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 164 place count 212 transition count 403
Iterating global reduction 6 with 4 rules applied. Total rules applied 168 place count 212 transition count 403
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 170 place count 210 transition count 399
Iterating global reduction 6 with 2 rules applied. Total rules applied 172 place count 210 transition count 399
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 174 place count 208 transition count 393
Iterating global reduction 6 with 2 rules applied. Total rules applied 176 place count 208 transition count 393
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 178 place count 206 transition count 389
Iterating global reduction 6 with 2 rules applied. Total rules applied 180 place count 206 transition count 389
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 182 place count 204 transition count 384
Iterating global reduction 6 with 2 rules applied. Total rules applied 184 place count 204 transition count 384
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 186 place count 202 transition count 380
Iterating global reduction 6 with 2 rules applied. Total rules applied 188 place count 202 transition count 380
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 189 place count 201 transition count 377
Iterating global reduction 6 with 1 rules applied. Total rules applied 190 place count 201 transition count 377
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 191 place count 200 transition count 375
Iterating global reduction 6 with 1 rules applied. Total rules applied 192 place count 200 transition count 375
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 193 place count 199 transition count 372
Iterating global reduction 6 with 1 rules applied. Total rules applied 194 place count 199 transition count 372
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 195 place count 198 transition count 370
Iterating global reduction 6 with 1 rules applied. Total rules applied 196 place count 198 transition count 370
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 197 place count 197 transition count 367
Iterating global reduction 6 with 1 rules applied. Total rules applied 198 place count 197 transition count 367
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 199 place count 196 transition count 365
Iterating global reduction 6 with 1 rules applied. Total rules applied 200 place count 196 transition count 365
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 201 place count 195 transition count 363
Iterating global reduction 6 with 1 rules applied. Total rules applied 202 place count 195 transition count 363
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 203 place count 194 transition count 361
Iterating global reduction 6 with 1 rules applied. Total rules applied 204 place count 194 transition count 361
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 252 place count 170 transition count 337
Performed 30 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 312 place count 140 transition count 414
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 317 place count 140 transition count 409
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 318 place count 139 transition count 408
Applied a total of 318 rules in 69 ms. Remains 139 /302 variables (removed 163) and now considering 408/540 (removed 132) transitions.
[2024-06-02 23:38:55] [INFO ] Flow matrix only has 389 transitions (discarded 19 similar events)
// Phase 1: matrix 389 rows 139 cols
[2024-06-02 23:38:55] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:38:55] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 23:38:55] [INFO ] Flow matrix only has 389 transitions (discarded 19 similar events)
[2024-06-02 23:38:55] [INFO ] Invariant cache hit.
[2024-06-02 23:38:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-02 23:38:56] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-06-02 23:38:56] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 23:38:56] [INFO ] Flow matrix only has 389 transitions (discarded 19 similar events)
[2024-06-02 23:38:56] [INFO ] Invariant cache hit.
[2024-06-02 23:38:56] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/302 places, 408/540 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 500 ms. Remains : 139/302 places, 408/540 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-18-LTLFireability-13 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=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s87 1) (EQ s128 1)), p1:(EQ s91 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-18-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLFireability-13 finished in 631 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((F(p1)&&F(G(p2)))))))'
Support contains 5 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 540/540 transitions.
Graph (trivial) has 210 edges and 302 vertex of which 8 / 302 are part of one of the 2 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 295 transition count 494
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 79 place count 257 transition count 492
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 256 transition count 491
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 255 transition count 491
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 82 place count 255 transition count 464
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 136 place count 228 transition count 464
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 144 place count 220 transition count 417
Iterating global reduction 4 with 8 rules applied. Total rules applied 152 place count 220 transition count 417
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 155 place count 220 transition count 414
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 155 place count 220 transition count 412
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 159 place count 218 transition count 412
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 162 place count 215 transition count 407
Iterating global reduction 5 with 3 rules applied. Total rules applied 165 place count 215 transition count 407
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 168 place count 212 transition count 401
Iterating global reduction 5 with 3 rules applied. Total rules applied 171 place count 212 transition count 401
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 173 place count 210 transition count 395
Iterating global reduction 5 with 2 rules applied. Total rules applied 175 place count 210 transition count 395
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 177 place count 208 transition count 391
Iterating global reduction 5 with 2 rules applied. Total rules applied 179 place count 208 transition count 391
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 181 place count 206 transition count 386
Iterating global reduction 5 with 2 rules applied. Total rules applied 183 place count 206 transition count 386
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 185 place count 204 transition count 382
Iterating global reduction 5 with 2 rules applied. Total rules applied 187 place count 204 transition count 382
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 188 place count 203 transition count 379
Iterating global reduction 5 with 1 rules applied. Total rules applied 189 place count 203 transition count 379
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 190 place count 202 transition count 377
Iterating global reduction 5 with 1 rules applied. Total rules applied 191 place count 202 transition count 377
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 192 place count 201 transition count 374
Iterating global reduction 5 with 1 rules applied. Total rules applied 193 place count 201 transition count 374
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 194 place count 200 transition count 372
Iterating global reduction 5 with 1 rules applied. Total rules applied 195 place count 200 transition count 372
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 196 place count 199 transition count 369
Iterating global reduction 5 with 1 rules applied. Total rules applied 197 place count 199 transition count 369
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 198 place count 198 transition count 367
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 198 transition count 367
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 200 place count 197 transition count 365
Iterating global reduction 5 with 1 rules applied. Total rules applied 201 place count 197 transition count 365
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 202 place count 196 transition count 363
Iterating global reduction 5 with 1 rules applied. Total rules applied 203 place count 196 transition count 363
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 251 place count 172 transition count 339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 252 place count 172 transition count 338
Performed 30 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 312 place count 142 transition count 414
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 314 place count 142 transition count 412
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 315 place count 141 transition count 411
Applied a total of 315 rules in 69 ms. Remains 141 /302 variables (removed 161) and now considering 411/540 (removed 129) transitions.
[2024-06-02 23:38:56] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
// Phase 1: matrix 396 rows 141 cols
[2024-06-02 23:38:56] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:38:56] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 23:38:56] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
[2024-06-02 23:38:56] [INFO ] Invariant cache hit.
[2024-06-02 23:38:56] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-06-02 23:38:56] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2024-06-02 23:38:56] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 23:38:56] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
[2024-06-02 23:38:56] [INFO ] Invariant cache hit.
[2024-06-02 23:38:56] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/302 places, 411/540 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 504 ms. Remains : 141/302 places, 411/540 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FireWire-PT-18-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (EQ s87 0) (EQ s123 0)) (EQ s1 0)), p2:(EQ s1 1), p0:(OR (EQ s30 0) (EQ s69 0))], nbAcceptance=2, 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 2 reset in 113 ms.
Product exploration explored 100000 steps with 7 reset in 151 ms.
Computed a total of 21 stabilizing places and 37 stable transitions
Computed a total of 21 stabilizing places and 37 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2))))]
Knowledge based reduction with 7 factoid took 398 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-06-02 23:38:58] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
[2024-06-02 23:38:58] [INFO ] Invariant cache hit.
[2024-06-02 23:38:58] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:38:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:58] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 23:38:58] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-06-02 23:38:58] [INFO ] After 57ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 23:38:58] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-06-02 23:38:58] [INFO ] After 303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 5 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 411/411 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 141 transition count 409
Free-agglomeration rule applied 14 times.
Iterating global reduction 1 with 14 rules applied. Total rules applied 16 place count 141 transition count 395
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 35 place count 127 transition count 390
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 125 transition count 388
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 125 transition count 388
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 42 place count 125 transition count 385
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 59 place count 125 transition count 368
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 125 transition count 368
Applied a total of 60 rules in 22 ms. Remains 125 /141 variables (removed 16) and now considering 368/411 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 125/141 places, 368/411 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :0
Finished probabilistic random walk after 3206 steps, run visited all 3 properties in 23 ms. (steps per millisecond=139 )
Probabilistic random walk after 3206 steps, saw 1456 distinct states, run finished after 24 ms. (steps per millisecond=133 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (F (AND p0 p2)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p2)), (F (NOT (AND p0 (NOT p2)))), (F (NOT p1)), (F (AND p0 (NOT p1))), (F p2), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 7 factoid took 675 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 100 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 5 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 411/411 transitions.
Applied a total of 0 rules in 7 ms. Remains 141 /141 variables (removed 0) and now considering 411/411 (removed 0) transitions.
[2024-06-02 23:38:59] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
[2024-06-02 23:38:59] [INFO ] Invariant cache hit.
[2024-06-02 23:38:59] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 23:38:59] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
[2024-06-02 23:38:59] [INFO ] Invariant cache hit.
[2024-06-02 23:38:59] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-06-02 23:39:00] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-06-02 23:39:00] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 23:39:00] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
[2024-06-02 23:39:00] [INFO ] Invariant cache hit.
[2024-06-02 23:39:00] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 473 ms. Remains : 141/141 places, 411/411 transitions.
Computed a total of 21 stabilizing places and 37 stable transitions
Computed a total of 21 stabilizing places and 37 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2))))]
Knowledge based reduction with 7 factoid took 377 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-06-02 23:39:01] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
[2024-06-02 23:39:01] [INFO ] Invariant cache hit.
[2024-06-02 23:39:01] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:39:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:39:01] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 23:39:01] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-06-02 23:39:01] [INFO ] After 58ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 23:39:01] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-06-02 23:39:01] [INFO ] After 283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 411/411 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 141 transition count 409
Free-agglomeration rule applied 14 times.
Iterating global reduction 1 with 14 rules applied. Total rules applied 16 place count 141 transition count 395
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 35 place count 127 transition count 390
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 125 transition count 388
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 125 transition count 388
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 42 place count 125 transition count 385
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 59 place count 125 transition count 368
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 125 transition count 368
Applied a total of 60 rules in 19 ms. Remains 125 /141 variables (removed 16) and now considering 368/411 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 125/141 places, 368/411 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 3) seen :0
Finished probabilistic random walk after 3206 steps, run visited all 3 properties in 22 ms. (steps per millisecond=145 )
Probabilistic random walk after 3206 steps, saw 1456 distinct states, run finished after 25 ms. (steps per millisecond=128 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (F (AND p0 p2)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p2)), (F (NOT (AND p0 (NOT p2)))), (F (NOT p1)), (F (AND p0 (NOT p1))), (F p2), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 7 factoid took 768 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 138 ms.
Product exploration explored 100000 steps with 11 reset in 123 ms.
Built C files in :
/tmp/ltsmin13894663838503422570
[2024-06-02 23:39:03] [INFO ] Computing symmetric may disable matrix : 411 transitions.
[2024-06-02 23:39:03] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:39:03] [INFO ] Computing symmetric may enable matrix : 411 transitions.
[2024-06-02 23:39:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:39:03] [INFO ] Computing Do-Not-Accords matrix : 411 transitions.
[2024-06-02 23:39:03] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:39:03] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13894663838503422570
Running compilation step : cd /tmp/ltsmin13894663838503422570;'/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 828 ms.
Running link step : cd /tmp/ltsmin13894663838503422570;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin13894663838503422570;'/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/stateBased12293545332172842465.hoa' '--buchi-type=spotba'
LTSmin run took 985 ms.
FORMULA FireWire-PT-18-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-18-LTLFireability-14 finished in 8729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 540/540 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 291 transition count 490
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 291 transition count 490
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 291 transition count 488
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 285 transition count 479
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 285 transition count 479
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 281 transition count 472
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 281 transition count 472
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 279 transition count 466
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 279 transition count 466
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 277 transition count 462
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 277 transition count 462
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 275 transition count 457
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 275 transition count 457
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 273 transition count 453
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 273 transition count 453
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 271 transition count 449
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 271 transition count 449
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 270 transition count 447
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 270 transition count 447
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 269 transition count 444
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 269 transition count 444
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 268 transition count 442
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 268 transition count 442
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 267 transition count 439
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 267 transition count 439
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 266 transition count 437
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 266 transition count 437
Applied a total of 74 rules in 28 ms. Remains 266 /302 variables (removed 36) and now considering 437/540 (removed 103) transitions.
// Phase 1: matrix 437 rows 266 cols
[2024-06-02 23:39:05] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:39:05] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 23:39:05] [INFO ] Invariant cache hit.
[2024-06-02 23:39:05] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2024-06-02 23:39:05] [INFO ] Invariant cache hit.
[2024-06-02 23:39:05] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 266/302 places, 437/540 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 514 ms. Remains : 266/302 places, 437/540 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-18-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s29 0) (EQ s145 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 252 ms.
Product exploration explored 100000 steps with 50000 reset in 239 ms.
Computed a total of 59 stabilizing places and 77 stable transitions
Computed a total of 59 stabilizing places and 77 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-18-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-18-LTLFireability-15 finished in 1118 ms.
All properties solved by simple procedures.
Total runtime 46751 ms.

BK_STOP 1717371547187

--------------------
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="FireWire-PT-18"
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 FireWire-PT-18, 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 r571-tall-171734910400193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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