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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K 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 97K 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-08-LTLFireability-00
FORMULA_NAME FireWire-PT-08-LTLFireability-01
FORMULA_NAME FireWire-PT-08-LTLFireability-02
FORMULA_NAME FireWire-PT-08-LTLFireability-03
FORMULA_NAME FireWire-PT-08-LTLFireability-04
FORMULA_NAME FireWire-PT-08-LTLFireability-05
FORMULA_NAME FireWire-PT-08-LTLFireability-06
FORMULA_NAME FireWire-PT-08-LTLFireability-07
FORMULA_NAME FireWire-PT-08-LTLFireability-08
FORMULA_NAME FireWire-PT-08-LTLFireability-09
FORMULA_NAME FireWire-PT-08-LTLFireability-10
FORMULA_NAME FireWire-PT-08-LTLFireability-11
FORMULA_NAME FireWire-PT-08-LTLFireability-12
FORMULA_NAME FireWire-PT-08-LTLFireability-13
FORMULA_NAME FireWire-PT-08-LTLFireability-14
FORMULA_NAME FireWire-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717369438826

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-08
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 23:04:00] [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:04:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:04:00] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2024-06-02 23:04:00] [INFO ] Transformed 127 places.
[2024-06-02 23:04:00] [INFO ] Transformed 397 transitions.
[2024-06-02 23:04:00] [INFO ] Found NUPN structural information;
[2024-06-02 23:04:00] [INFO ] Parsed PT model containing 127 places and 397 transitions and 1475 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
FORMULA FireWire-PT-08-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-08-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-08-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-08-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-08-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 344/344 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 337
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 337
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 333
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 123 transition count 327
Applied a total of 16 rules in 30 ms. Remains 123 /127 variables (removed 4) and now considering 327/344 (removed 17) transitions.
[2024-06-02 23:04:00] [INFO ] Flow matrix only has 301 transitions (discarded 26 similar events)
// Phase 1: matrix 301 rows 123 cols
[2024-06-02 23:04:00] [INFO ] Computed 8 invariants in 19 ms
[2024-06-02 23:04:01] [INFO ] Implicit Places using invariants in 549 ms returned []
[2024-06-02 23:04:01] [INFO ] Flow matrix only has 301 transitions (discarded 26 similar events)
[2024-06-02 23:04:01] [INFO ] Invariant cache hit.
[2024-06-02 23:04:01] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 23:04:01] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
[2024-06-02 23:04:01] [INFO ] Flow matrix only has 301 transitions (discarded 26 similar events)
[2024-06-02 23:04:01] [INFO ] Invariant cache hit.
[2024-06-02 23:04:01] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/127 places, 327/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 929 ms. Remains : 123/127 places, 327/344 transitions.
Support contains 34 out of 123 places after structural reductions.
[2024-06-02 23:04:01] [INFO ] Flatten gal took : 50 ms
[2024-06-02 23:04:01] [INFO ] Flatten gal took : 28 ms
[2024-06-02 23:04:01] [INFO ] Input system was already deterministic with 327 transitions.
Support contains 33 out of 123 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 573 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 27) seen :14
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 373 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 262 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 148 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 169 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :1
Running SMT prover for 9 properties.
[2024-06-02 23:04:02] [INFO ] Flow matrix only has 301 transitions (discarded 26 similar events)
[2024-06-02 23:04:02] [INFO ] Invariant cache hit.
[2024-06-02 23:04:03] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:04:03] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-06-02 23:04:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-02 23:04:03] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2024-06-02 23:04:03] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 23:04:03] [INFO ] After 128ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :2 sat :7
[2024-06-02 23:04:03] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 6 ms to minimize.
[2024-06-02 23:04:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2024-06-02 23:04:03] [INFO ] After 367ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 92 ms.
[2024-06-02 23:04:03] [INFO ] After 694ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 58 ms.
Support contains 11 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 327/327 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 123 transition count 324
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 1 with 2 rules applied. Total rules applied 5 place count 122 transition count 323
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 11 place count 119 transition count 329
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 17 place count 119 transition count 323
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 119 transition count 320
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 118 transition count 319
Applied a total of 21 rules in 66 ms. Remains 118 /123 variables (removed 5) and now considering 319/327 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 118/123 places, 319/327 transitions.
Incomplete random walk after 10000 steps, including 609 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 115 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 151 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-06-02 23:04:04] [INFO ] Flow matrix only has 291 transitions (discarded 28 similar events)
// Phase 1: matrix 291 rows 118 cols
[2024-06-02 23:04:04] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 23:04:04] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:04:04] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-02 23:04:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:04:04] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-02 23:04:04] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 23:04:04] [INFO ] After 80ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-06-02 23:04:04] [INFO ] After 212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 75 ms.
[2024-06-02 23:04:04] [INFO ] After 484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 32 ms.
Support contains 9 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 319/319 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 117 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 117 transition count 317
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 117 transition count 316
Applied a total of 3 rules in 24 ms. Remains 117 /118 variables (removed 1) and now considering 316/319 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 117/118 places, 316/319 transitions.
Incomplete random walk after 10000 steps, including 590 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 280 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 135 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 109 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 134 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 980181 steps, run timeout after 3001 ms. (steps per millisecond=326 ) properties seen :{0=1, 3=1, 4=1, 5=1}
Probabilistic random walk after 980181 steps, saw 219877 distinct states, run finished after 3002 ms. (steps per millisecond=326 ) properties seen :4
Running SMT prover for 2 properties.
[2024-06-02 23:04:08] [INFO ] Flow matrix only has 288 transitions (discarded 28 similar events)
// Phase 1: matrix 288 rows 117 cols
[2024-06-02 23:04:08] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 23:04:08] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 23:04:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:04:08] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 23:04:08] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 23:04:08] [INFO ] After 39ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-02 23:04:08] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-06-02 23:04:08] [INFO ] After 205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 316/316 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 116 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 116 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 115 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 115 transition count 311
Applied a total of 4 rules in 15 ms. Remains 115 /117 variables (removed 2) and now considering 311/316 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 115/117 places, 311/316 transitions.
Incomplete random walk after 10000 steps, including 590 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 932515 steps, run timeout after 3001 ms. (steps per millisecond=310 ) properties seen :{}
Probabilistic random walk after 932515 steps, saw 209560 distinct states, run finished after 3003 ms. (steps per millisecond=310 ) properties seen :0
Running SMT prover for 2 properties.
[2024-06-02 23:04:11] [INFO ] Flow matrix only has 283 transitions (discarded 28 similar events)
// Phase 1: matrix 283 rows 115 cols
[2024-06-02 23:04:11] [INFO ] Computed 8 invariants in 6 ms
[2024-06-02 23:04:11] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 23:04:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 23:04:11] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 23:04:11] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 23:04:12] [INFO ] After 35ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-02 23:04:12] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:04:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-06-02 23:04:12] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-06-02 23:04:12] [INFO ] After 258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 311/311 transitions.
Applied a total of 0 rules in 9 ms. Remains 115 /115 variables (removed 0) and now considering 311/311 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 115/115 places, 311/311 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 311/311 transitions.
Applied a total of 0 rules in 6 ms. Remains 115 /115 variables (removed 0) and now considering 311/311 (removed 0) transitions.
[2024-06-02 23:04:12] [INFO ] Flow matrix only has 283 transitions (discarded 28 similar events)
[2024-06-02 23:04:12] [INFO ] Invariant cache hit.
[2024-06-02 23:04:12] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 23:04:12] [INFO ] Flow matrix only has 283 transitions (discarded 28 similar events)
[2024-06-02 23:04:12] [INFO ] Invariant cache hit.
[2024-06-02 23:04:12] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 23:04:12] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2024-06-02 23:04:12] [INFO ] Redundant transitions in 19 ms returned []
[2024-06-02 23:04:12] [INFO ] Flow matrix only has 283 transitions (discarded 28 similar events)
[2024-06-02 23:04:12] [INFO ] Invariant cache hit.
[2024-06-02 23:04:12] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 392 ms. Remains : 115/115 places, 311/311 transitions.
Graph (trivial) has 112 edges and 115 vertex of which 31 / 115 are part of one of the 5 SCC in 7 ms
Free SCC test removed 26 places
Drop transitions removed 122 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 129 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 3 place count 88 transition count 181
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 88 transition count 179
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 7 place count 87 transition count 178
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 87 transition count 177
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 10 place count 86 transition count 176
Free-agglomeration rule applied 2 times with reduction of 1 identical transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 86 transition count 173
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 84 transition count 172
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 84 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 84 transition count 171
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 83 transition count 170
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 83 transition count 170
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 83 transition count 170
Applied a total of 20 rules in 50 ms. Remains 83 /115 variables (removed 32) and now considering 170/311 (removed 141) transitions.
Running SMT prover for 2 properties.
[2024-06-02 23:04:12] [INFO ] Flow matrix only has 168 transitions (discarded 2 similar events)
// Phase 1: matrix 168 rows 83 cols
[2024-06-02 23:04:12] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 23:04:12] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 23:04:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:04:12] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 23:04:12] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-06-02 23:04:12] [INFO ] After 116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA FireWire-PT-08-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA FireWire-PT-08-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 23 stabilizing places and 48 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' '!(F((p0||(X(F(p1))&&(p2 U p3)))))'
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 327/327 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 121 transition count 322
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 121 transition count 322
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 119 transition count 317
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 118 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 118 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 117 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 116 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 116 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 115 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 114 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 114 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 113 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 112 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 112 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 111 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 110 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 110 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 109 transition count 293
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 108 transition count 291
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 108 transition count 291
Applied a total of 30 rules in 18 ms. Remains 108 /123 variables (removed 15) and now considering 291/327 (removed 36) transitions.
[2024-06-02 23:04:13] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
// Phase 1: matrix 265 rows 108 cols
[2024-06-02 23:04:13] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 23:04:13] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 23:04:13] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
[2024-06-02 23:04:13] [INFO ] Invariant cache hit.
[2024-06-02 23:04:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 23:04:13] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-06-02 23:04:13] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
[2024-06-02 23:04:13] [INFO ] Invariant cache hit.
[2024-06-02 23:04:13] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/123 places, 291/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 361 ms. Remains : 108/123 places, 291/327 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 :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : FireWire-PT-08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s10 1) (EQ s42 1)), p3:(AND (EQ s5 1) (EQ s15 1)), p2:(AND (EQ s7 1) (EQ s49 1)), p1:(OR (EQ s7 0) (EQ s49 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 3 ms.
FORMULA FireWire-PT-08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-08-LTLFireability-00 finished in 710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 327/327 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 119 transition count 319
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 119 transition count 319
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 119 transition count 318
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 117 transition count 313
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 106 transition count 287
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 35 place count 105 transition count 286
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 102 transition count 292
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 102 transition count 286
Applied a total of 47 rules in 57 ms. Remains 102 /123 variables (removed 21) and now considering 286/327 (removed 41) transitions.
[2024-06-02 23:04:13] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
// Phase 1: matrix 253 rows 102 cols
[2024-06-02 23:04:13] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 23:04:13] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 23:04:13] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 23:04:13] [INFO ] Invariant cache hit.
[2024-06-02 23:04:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 23:04:14] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2024-06-02 23:04:14] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 23:04:14] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 23:04:14] [INFO ] Invariant cache hit.
[2024-06-02 23:04:14] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/123 places, 286/327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 406 ms. Remains : 102/123 places, 286/327 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s7 1) (NEQ s87 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 177 ms.
Product exploration explored 100000 steps with 0 reset in 82 ms.
Computed a total of 8 stabilizing places and 15 stable transitions
Computed a total of 8 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 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 :[(NOT p0)]
Incomplete random walk after 10000 steps, including 574 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1798 steps, run visited all 1 properties in 15 ms. (steps per millisecond=119 )
Probabilistic random walk after 1798 steps, saw 935 distinct states, run finished after 16 ms. (steps per millisecond=112 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 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 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 286/286 transitions.
Applied a total of 0 rules in 9 ms. Remains 102 /102 variables (removed 0) and now considering 286/286 (removed 0) transitions.
[2024-06-02 23:04:14] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 23:04:14] [INFO ] Invariant cache hit.
[2024-06-02 23:04:14] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 23:04:14] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 23:04:14] [INFO ] Invariant cache hit.
[2024-06-02 23:04:14] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 23:04:14] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-06-02 23:04:14] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 23:04:14] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 23:04:14] [INFO ] Invariant cache hit.
[2024-06-02 23:04:15] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 336 ms. Remains : 102/102 places, 286/286 transitions.
Computed a total of 8 stabilizing places and 15 stable transitions
Computed a total of 8 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 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 27 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 564 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1798 steps, run visited all 1 properties in 10 ms. (steps per millisecond=179 )
Probabilistic random walk after 1798 steps, saw 935 distinct states, run finished after 10 ms. (steps per millisecond=179 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2 reset in 71 ms.
Product exploration explored 100000 steps with 0 reset in 89 ms.
Built C files in :
/tmp/ltsmin4307748137857929289
[2024-06-02 23:04:15] [INFO ] Computing symmetric may disable matrix : 286 transitions.
[2024-06-02 23:04:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:04:15] [INFO ] Computing symmetric may enable matrix : 286 transitions.
[2024-06-02 23:04:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:04:15] [INFO ] Computing Do-Not-Accords matrix : 286 transitions.
[2024-06-02 23:04:15] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:04:15] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4307748137857929289
Running compilation step : cd /tmp/ltsmin4307748137857929289;'/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 629 ms.
Running link step : cd /tmp/ltsmin4307748137857929289;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin4307748137857929289;'/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/stateBased7803681304520085825.hoa' '--buchi-type=spotba'
LTSmin run took 1815 ms.
FORMULA FireWire-PT-08-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-08-LTLFireability-01 finished in 4491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)&&(!p1 U (p2||G(!p1)))))'
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 327/327 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 119 transition count 319
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 119 transition count 319
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 119 transition count 318
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 117 transition count 313
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 114 transition count 306
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 1 with 2 rules applied. Total rules applied 19 place count 113 transition count 305
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 110 transition count 311
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 110 transition count 305
Applied a total of 31 rules in 29 ms. Remains 110 /123 variables (removed 13) and now considering 305/327 (removed 22) transitions.
[2024-06-02 23:04:18] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
// Phase 1: matrix 272 rows 110 cols
[2024-06-02 23:04:18] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 23:04:18] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 23:04:18] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
[2024-06-02 23:04:18] [INFO ] Invariant cache hit.
[2024-06-02 23:04:18] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 23:04:18] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-06-02 23:04:18] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 23:04:18] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
[2024-06-02 23:04:18] [INFO ] Invariant cache hit.
[2024-06-02 23:04:18] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/123 places, 305/327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 388 ms. Remains : 110/123 places, 305/327 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : FireWire-PT-08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=2, aps=[p0:(OR (EQ s2 0) (EQ s69 0)), p2:(AND (NEQ s49 1) (NOT (AND (EQ s7 1) (EQ s97 1)))), p1:(AND (EQ s7 1) (EQ s97 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 66 ms.
Product exploration explored 100000 steps with 0 reset in 88 ms.
Computed a total of 16 stabilizing places and 34 stable transitions
Computed a total of 16 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 p2)), true, (X (X p0)), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 132 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 588 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1973517 steps, run timeout after 3001 ms. (steps per millisecond=657 ) properties seen :{}
Probabilistic random walk after 1973517 steps, saw 384927 distinct states, run finished after 3001 ms. (steps per millisecond=657 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:04:22] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
[2024-06-02 23:04:22] [INFO ] Invariant cache hit.
[2024-06-02 23:04:22] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:04:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 23:04:22] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:04:22] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 23:04:22] [INFO ] After 24ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:04:22] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2024-06-02 23:04:22] [INFO ] After 241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 305/305 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 110 transition count 299
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 110 transition count 301
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 10 place count 109 transition count 299
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 109 transition count 297
Applied a total of 12 rules in 21 ms. Remains 109 /110 variables (removed 1) and now considering 297/305 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 109/110 places, 297/305 transitions.
Incomplete random walk after 10000 steps, including 635 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 143 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1924630 steps, run timeout after 3001 ms. (steps per millisecond=641 ) properties seen :{}
Probabilistic random walk after 1924630 steps, saw 403528 distinct states, run finished after 3001 ms. (steps per millisecond=641 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:04:25] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
// Phase 1: matrix 268 rows 109 cols
[2024-06-02 23:04:25] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 23:04:25] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:04:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:04:25] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:04:25] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 23:04:25] [INFO ] After 21ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:04:25] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-06-02 23:04:25] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
Applied a total of 0 rules in 6 ms. Remains 109 /109 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 109/109 places, 297/297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
Applied a total of 0 rules in 5 ms. Remains 109 /109 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-02 23:04:25] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2024-06-02 23:04:25] [INFO ] Invariant cache hit.
[2024-06-02 23:04:25] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 23:04:25] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2024-06-02 23:04:25] [INFO ] Invariant cache hit.
[2024-06-02 23:04:25] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 23:04:25] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-06-02 23:04:25] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 23:04:25] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2024-06-02 23:04:25] [INFO ] Invariant cache hit.
[2024-06-02 23:04:26] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 448 ms. Remains : 109/109 places, 297/297 transitions.
Graph (trivial) has 110 edges and 109 vertex of which 29 / 109 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 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 3 place count 83 transition count 170
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 83 transition count 167
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 8 place count 82 transition count 166
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 82 transition count 165
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 11 place count 81 transition count 164
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 81 transition count 159
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 78 transition count 158
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 78 transition count 158
Applied a total of 20 rules in 17 ms. Remains 78 /109 variables (removed 31) and now considering 158/297 (removed 139) transitions.
Running SMT prover for 1 properties.
[2024-06-02 23:04:26] [INFO ] Flow matrix only has 156 transitions (discarded 2 similar events)
// Phase 1: matrix 156 rows 78 cols
[2024-06-02 23:04:26] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 23:04:26] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:04:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:04:26] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:04:26] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-06-02 23:04:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-06-02 23:04:26] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-06-02 23:04:26] [INFO ] After 117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 p2)), true, (X (X p0)), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Support contains 2 out of 110 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 305/305 transitions.
Applied a total of 0 rules in 7 ms. Remains 110 /110 variables (removed 0) and now considering 305/305 (removed 0) transitions.
[2024-06-02 23:04:26] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
// Phase 1: matrix 272 rows 110 cols
[2024-06-02 23:04:26] [INFO ] Computed 8 invariants in 8 ms
[2024-06-02 23:04:26] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 23:04:26] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
[2024-06-02 23:04:26] [INFO ] Invariant cache hit.
[2024-06-02 23:04:26] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 23:04:26] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-06-02 23:04:26] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 23:04:26] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
[2024-06-02 23:04:26] [INFO ] Invariant cache hit.
[2024-06-02 23:04:26] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 366 ms. Remains : 110/110 places, 305/305 transitions.
Computed a total of 16 stabilizing places and 34 stable transitions
Computed a total of 16 stabilizing places and 34 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 611 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2047290 steps, run timeout after 3001 ms. (steps per millisecond=682 ) properties seen :{}
Probabilistic random walk after 2047290 steps, saw 393793 distinct states, run finished after 3001 ms. (steps per millisecond=682 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:04:30] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
[2024-06-02 23:04:30] [INFO ] Invariant cache hit.
[2024-06-02 23:04:30] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:04:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:04:30] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:04:30] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 23:04:30] [INFO ] After 25ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:04:30] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-06-02 23:04:30] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 305/305 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 110 transition count 299
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 110 transition count 301
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 10 place count 109 transition count 299
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 109 transition count 297
Applied a total of 12 rules in 14 ms. Remains 109 /110 variables (removed 1) and now considering 297/305 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 109/110 places, 297/305 transitions.
Incomplete random walk after 10000 steps, including 582 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2047355 steps, run timeout after 3001 ms. (steps per millisecond=682 ) properties seen :{}
Probabilistic random walk after 2047355 steps, saw 423233 distinct states, run finished after 3001 ms. (steps per millisecond=682 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:04:33] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
// Phase 1: matrix 268 rows 109 cols
[2024-06-02 23:04:33] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 23:04:33] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:04:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 23:04:33] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:04:33] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 23:04:33] [INFO ] After 21ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:04:33] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-06-02 23:04:33] [INFO ] After 134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 109/109 places, 297/297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-02 23:04:33] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2024-06-02 23:04:33] [INFO ] Invariant cache hit.
[2024-06-02 23:04:33] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 23:04:33] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2024-06-02 23:04:33] [INFO ] Invariant cache hit.
[2024-06-02 23:04:33] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 23:04:33] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-06-02 23:04:33] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 23:04:33] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2024-06-02 23:04:33] [INFO ] Invariant cache hit.
[2024-06-02 23:04:33] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 405 ms. Remains : 109/109 places, 297/297 transitions.
Graph (trivial) has 110 edges and 109 vertex of which 29 / 109 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 transitions.
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 3 place count 83 transition count 170
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 83 transition count 167
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 8 place count 82 transition count 166
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 82 transition count 165
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 11 place count 81 transition count 164
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 81 transition count 159
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 78 transition count 158
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 78 transition count 158
Applied a total of 20 rules in 14 ms. Remains 78 /109 variables (removed 31) and now considering 158/297 (removed 139) transitions.
Running SMT prover for 1 properties.
[2024-06-02 23:04:33] [INFO ] Flow matrix only has 156 transitions (discarded 2 similar events)
// Phase 1: matrix 156 rows 78 cols
[2024-06-02 23:04:33] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 23:04:33] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:04:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:04:33] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:04:34] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 1 ms to minimize.
[2024-06-02 23:04:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-06-02 23:04:34] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-06-02 23:04:34] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 65 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 45 ms.
Product exploration explored 100000 steps with 3 reset in 44 ms.
Built C files in :
/tmp/ltsmin4611861411943042241
[2024-06-02 23:04:34] [INFO ] Computing symmetric may disable matrix : 305 transitions.
[2024-06-02 23:04:34] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:04:34] [INFO ] Computing symmetric may enable matrix : 305 transitions.
[2024-06-02 23:04:34] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:04:34] [INFO ] Computing Do-Not-Accords matrix : 305 transitions.
[2024-06-02 23:04:34] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:04:34] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4611861411943042241
Running compilation step : cd /tmp/ltsmin4611861411943042241;'/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 580 ms.
Running link step : cd /tmp/ltsmin4611861411943042241;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin4611861411943042241;'/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/stateBased8850019750620686406.hoa' '--buchi-type=spotba'
LTSmin run took 1594 ms.
FORMULA FireWire-PT-08-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-08-LTLFireability-02 finished in 18433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U G(p1))&&G(F(p2)))))'
Support contains 3 out of 123 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 327/327 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 120 transition count 321
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 120 transition count 321
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 120 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 119 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 119 transition count 318
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 9 place count 118 transition count 317
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 115 transition count 323
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 115 transition count 317
Applied a total of 21 rules in 20 ms. Remains 115 /123 variables (removed 8) and now considering 317/327 (removed 10) transitions.
[2024-06-02 23:04:36] [INFO ] Flow matrix only has 284 transitions (discarded 33 similar events)
// Phase 1: matrix 284 rows 115 cols
[2024-06-02 23:04:36] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 23:04:36] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 23:04:36] [INFO ] Flow matrix only has 284 transitions (discarded 33 similar events)
[2024-06-02 23:04:36] [INFO ] Invariant cache hit.
[2024-06-02 23:04:36] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 23:04:37] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2024-06-02 23:04:37] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 23:04:37] [INFO ] Flow matrix only has 284 transitions (discarded 33 similar events)
[2024-06-02 23:04:37] [INFO ] Invariant cache hit.
[2024-06-02 23:04:37] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/123 places, 317/327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 501 ms. Remains : 115/123 places, 317/327 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : FireWire-PT-08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s64 1), p1:(AND (EQ s5 1) (EQ s26 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 0 ms.
FORMULA FireWire-PT-08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-08-LTLFireability-06 finished in 634 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 327/327 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 119 transition count 319
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 119 transition count 319
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 119 transition count 318
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 117 transition count 313
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 106 transition count 287
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 1 with 2 rules applied. Total rules applied 35 place count 105 transition count 286
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 102 transition count 292
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 102 transition count 286
Applied a total of 47 rules in 29 ms. Remains 102 /123 variables (removed 21) and now considering 286/327 (removed 41) transitions.
[2024-06-02 23:04:37] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
// Phase 1: matrix 253 rows 102 cols
[2024-06-02 23:04:37] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 23:04:37] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 23:04:37] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 23:04:37] [INFO ] Invariant cache hit.
[2024-06-02 23:04:37] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 23:04:37] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-06-02 23:04:37] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 23:04:37] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 23:04:37] [INFO ] Invariant cache hit.
[2024-06-02 23:04:37] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/123 places, 286/327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 373 ms. Remains : 102/123 places, 286/327 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s5 1) (NEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 51 ms.
Product exploration explored 100000 steps with 0 reset in 45 ms.
Computed a total of 8 stabilizing places and 15 stable transitions
Computed a total of 8 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Finished random walk after 545 steps, including 37 resets, run visited all 1 properties in 3 ms. (steps per millisecond=181 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 286/286 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 286/286 (removed 0) transitions.
[2024-06-02 23:04:38] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 23:04:38] [INFO ] Invariant cache hit.
[2024-06-02 23:04:38] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 23:04:38] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 23:04:38] [INFO ] Invariant cache hit.
[2024-06-02 23:04:38] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 23:04:38] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-06-02 23:04:38] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 23:04:38] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 23:04:38] [INFO ] Invariant cache hit.
[2024-06-02 23:04:38] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 327 ms. Remains : 102/102 places, 286/286 transitions.
Computed a total of 8 stabilizing places and 15 stable transitions
Computed a total of 8 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 5764 steps, including 332 resets, run visited all 1 properties in 15 ms. (steps per millisecond=384 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 45 ms.
Product exploration explored 100000 steps with 2 reset in 43 ms.
Built C files in :
/tmp/ltsmin1116207724124207602
[2024-06-02 23:04:39] [INFO ] Computing symmetric may disable matrix : 286 transitions.
[2024-06-02 23:04:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:04:39] [INFO ] Computing symmetric may enable matrix : 286 transitions.
[2024-06-02 23:04:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:04:39] [INFO ] Computing Do-Not-Accords matrix : 286 transitions.
[2024-06-02 23:04:39] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:04:39] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1116207724124207602
Running compilation step : cd /tmp/ltsmin1116207724124207602;'/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 533 ms.
Running link step : cd /tmp/ltsmin1116207724124207602;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin1116207724124207602;'/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/stateBased15522343913814135932.hoa' '--buchi-type=spotba'
LTSmin run took 433 ms.
FORMULA FireWire-PT-08-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-08-LTLFireability-07 finished in 2989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||(G(p0) U p1)))||X((p2 U p3))))'
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 327/327 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 120 transition count 320
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 120 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 120 transition count 319
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 118 transition count 314
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 112 transition count 299
Applied a total of 23 rules in 13 ms. Remains 112 /123 variables (removed 11) and now considering 299/327 (removed 28) transitions.
[2024-06-02 23:04:40] [INFO ] Flow matrix only has 273 transitions (discarded 26 similar events)
// Phase 1: matrix 273 rows 112 cols
[2024-06-02 23:04:40] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 23:04:40] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 23:04:40] [INFO ] Flow matrix only has 273 transitions (discarded 26 similar events)
[2024-06-02 23:04:40] [INFO ] Invariant cache hit.
[2024-06-02 23:04:40] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 23:04:40] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2024-06-02 23:04:40] [INFO ] Flow matrix only has 273 transitions (discarded 26 similar events)
[2024-06-02 23:04:40] [INFO ] Invariant cache hit.
[2024-06-02 23:04:40] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/123 places, 299/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 481 ms. Remains : 112/123 places, 299/327 transitions.
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(OR p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=3 dest: 1}, { cond=(OR (AND p0 (NOT p3) p2) (AND p1 (NOT p3) p2)), acceptance={} source=3 dest: 3}, { cond=(OR (AND p0 (NOT p3) (NOT p2)) (AND p1 (NOT p3) (NOT p2))), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(OR p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p3:(AND (EQ s10 1) (EQ s105 1)), p2:(EQ s49 1), p0:(EQ s28 1), p1:(AND (EQ s6 1) (EQ s111 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-08-LTLFireability-11 finished in 704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(G(!p1) U G(p2))))'
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 327/327 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 120 transition count 320
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 120 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 120 transition count 319
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 118 transition count 314
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 112 transition count 299
Applied a total of 23 rules in 11 ms. Remains 112 /123 variables (removed 11) and now considering 299/327 (removed 28) transitions.
[2024-06-02 23:04:40] [INFO ] Flow matrix only has 273 transitions (discarded 26 similar events)
[2024-06-02 23:04:40] [INFO ] Invariant cache hit.
[2024-06-02 23:04:41] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 23:04:41] [INFO ] Flow matrix only has 273 transitions (discarded 26 similar events)
[2024-06-02 23:04:41] [INFO ] Invariant cache hit.
[2024-06-02 23:04:41] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 23:04:41] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-06-02 23:04:41] [INFO ] Flow matrix only has 273 transitions (discarded 26 similar events)
[2024-06-02 23:04:41] [INFO ] Invariant cache hit.
[2024-06-02 23:04:41] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/123 places, 299/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 359 ms. Remains : 112/123 places, 299/327 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p2)), true, (NOT p0), (AND p2 p1), (NOT p2), (NOT p2)]
Running random walk in product with property : FireWire-PT-08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(OR p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p2 p1), acceptance={} source=0 dest: 4}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND p2 p1), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p2 p1), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s3 1) (EQ s85 1)), p1:(AND (EQ s8 1) (EQ s101 1)), p0:(OR (EQ s10 0) (EQ s105 0) (AND (EQ s8 1) (EQ s101 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 27 steps with 3 reset in 0 ms.
FORMULA FireWire-PT-08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-08-LTLFireability-12 finished in 582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||G(p1))))'
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 327/327 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 121 transition count 323
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 121 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 121 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 120 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 120 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 119 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 118 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 110 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 110 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 109 transition count 293
Applied a total of 29 rules in 18 ms. Remains 109 /123 variables (removed 14) and now considering 293/327 (removed 34) transitions.
[2024-06-02 23:04:41] [INFO ] Flow matrix only has 267 transitions (discarded 26 similar events)
// Phase 1: matrix 267 rows 109 cols
[2024-06-02 23:04:41] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 23:04:41] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-02 23:04:41] [INFO ] Flow matrix only has 267 transitions (discarded 26 similar events)
[2024-06-02 23:04:41] [INFO ] Invariant cache hit.
[2024-06-02 23:04:41] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 23:04:41] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2024-06-02 23:04:41] [INFO ] Flow matrix only has 267 transitions (discarded 26 similar events)
[2024-06-02 23:04:41] [INFO ] Invariant cache hit.
[2024-06-02 23:04:42] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/123 places, 293/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 477 ms. Remains : 109/123 places, 293/327 transitions.
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FireWire-PT-08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(OR (EQ s3 0) (EQ s38 0)), p1:(OR (EQ s9 0) (EQ s19 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 207 ms.
Product exploration explored 100000 steps with 33333 reset in 191 ms.
Computed a total of 10 stabilizing places and 17 stable transitions
Computed a total of 10 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 30 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-08-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-08-LTLFireability-13 finished in 1126 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((F(p0)&&X((F(p2)&&p1)))))'
Support contains 8 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 327/327 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 120 transition count 320
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 120 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 120 transition count 319
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 118 transition count 314
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 110 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 110 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 109 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 109 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 108 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 108 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 107 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 107 transition count 288
Applied a total of 33 rules in 12 ms. Remains 107 /123 variables (removed 16) and now considering 288/327 (removed 39) transitions.
[2024-06-02 23:04:42] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
// Phase 1: matrix 262 rows 107 cols
[2024-06-02 23:04:42] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 23:04:42] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-06-02 23:04:42] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2024-06-02 23:04:42] [INFO ] Invariant cache hit.
[2024-06-02 23:04:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 23:04:43] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2024-06-02 23:04:43] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2024-06-02 23:04:43] [INFO ] Invariant cache hit.
[2024-06-02 23:04:43] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 107/123 places, 288/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 428 ms. Remains : 107/123 places, 288/327 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : FireWire-PT-08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (EQ s3 1) (EQ s21 1)) (AND (EQ s8 1) (EQ s32 1))), p1:(AND (EQ s7 1) (EQ s51 1)), p2:(AND (EQ s35 1) (EQ s45 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-08-LTLFireability-15 finished in 645 ms.
All properties solved by simple procedures.
Total runtime 42993 ms.

BK_STOP 1717369484389

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-08.tgz
mv FireWire-PT-08 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;