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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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 153K 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-14-LTLCardinality-00
FORMULA_NAME FireWire-PT-14-LTLCardinality-01
FORMULA_NAME FireWire-PT-14-LTLCardinality-02
FORMULA_NAME FireWire-PT-14-LTLCardinality-03
FORMULA_NAME FireWire-PT-14-LTLCardinality-04
FORMULA_NAME FireWire-PT-14-LTLCardinality-05
FORMULA_NAME FireWire-PT-14-LTLCardinality-06
FORMULA_NAME FireWire-PT-14-LTLCardinality-07
FORMULA_NAME FireWire-PT-14-LTLCardinality-08
FORMULA_NAME FireWire-PT-14-LTLCardinality-09
FORMULA_NAME FireWire-PT-14-LTLCardinality-10
FORMULA_NAME FireWire-PT-14-LTLCardinality-11
FORMULA_NAME FireWire-PT-14-LTLCardinality-12
FORMULA_NAME FireWire-PT-14-LTLCardinality-13
FORMULA_NAME FireWire-PT-14-LTLCardinality-14
FORMULA_NAME FireWire-PT-14-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717370050767

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-14
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 23:14:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 23:14:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:14:12] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-06-02 23:14:12] [INFO ] Transformed 205 places.
[2024-06-02 23:14:12] [INFO ] Transformed 610 transitions.
[2024-06-02 23:14:12] [INFO ] Found NUPN structural information;
[2024-06-02 23:14:12] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2315 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 71 transitions
Reduce redundant transitions removed 71 transitions.
FORMULA FireWire-PT-14-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-14-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-14-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-14-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-14-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-14-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-14-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 539/539 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 199 transition count 527
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 199 transition count 527
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 199 transition count 524
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 197 transition count 518
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 197 transition count 518
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 196 transition count 516
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 196 transition count 516
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 195 transition count 513
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 195 transition count 513
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 194 transition count 511
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 194 transition count 511
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 194 transition count 505
Applied a total of 31 rules in 63 ms. Remains 194 /205 variables (removed 11) and now considering 505/539 (removed 34) transitions.
[2024-06-02 23:14:12] [INFO ] Flow matrix only has 473 transitions (discarded 32 similar events)
// Phase 1: matrix 473 rows 194 cols
[2024-06-02 23:14:12] [INFO ] Computed 10 invariants in 15 ms
[2024-06-02 23:14:13] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-06-02 23:14:13] [INFO ] Flow matrix only has 473 transitions (discarded 32 similar events)
[2024-06-02 23:14:13] [INFO ] Invariant cache hit.
[2024-06-02 23:14:13] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-06-02 23:14:13] [INFO ] Implicit Places using invariants and state equation in 382 ms returned [21, 141]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 849 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 192/205 places, 505/539 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 918 ms. Remains : 192/205 places, 505/539 transitions.
Support contains 28 out of 192 places after structural reductions.
[2024-06-02 23:14:13] [INFO ] Flatten gal took : 63 ms
[2024-06-02 23:14:13] [INFO ] Flatten gal took : 32 ms
[2024-06-02 23:14:13] [INFO ] Input system was already deterministic with 505 transitions.
Incomplete random walk after 10000 steps, including 295 resets, run finished after 549 ms. (steps per millisecond=18 ) properties (out of 20) seen :8
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 69 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-06-02 23:14:14] [INFO ] Flow matrix only has 473 transitions (discarded 32 similar events)
// Phase 1: matrix 473 rows 192 cols
[2024-06-02 23:14:14] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 23:14:14] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-06-02 23:14:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:14:15] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-06-02 23:14:15] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-06-02 23:14:15] [INFO ] After 209ms SMT Verify possible using 70 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-06-02 23:14:15] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 6 ms to minimize.
[2024-06-02 23:14:15] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 0 ms to minimize.
[2024-06-02 23:14:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 189 ms
[2024-06-02 23:14:15] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:14:16] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:14:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2024-06-02 23:14:16] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:14:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-06-02 23:14:16] [INFO ] After 930ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 166 ms.
[2024-06-02 23:14:16] [INFO ] After 1490ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 44 ms.
Support contains 16 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 505/505 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 192 transition count 502
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 192 transition count 500
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 190 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 189 transition count 497
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 189 transition count 497
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 188 transition count 495
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 188 transition count 495
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 187 transition count 492
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 187 transition count 492
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 186 transition count 490
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 186 transition count 490
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 185 transition count 487
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 185 transition count 487
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 23 place count 182 transition count 484
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 29 place count 179 transition count 490
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 35 place count 179 transition count 484
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 179 transition count 481
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 41 place count 179 transition count 487
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 50 place count 176 transition count 481
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 56 place count 176 transition count 475
Applied a total of 56 rules in 135 ms. Remains 176 /192 variables (removed 16) and now considering 475/505 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 176/192 places, 475/505 transitions.
Incomplete random walk after 10000 steps, including 310 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 72 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 70 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 427823 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{2=1, 7=1, 9=1}
Probabilistic random walk after 427823 steps, saw 127620 distinct states, run finished after 3002 ms. (steps per millisecond=142 ) properties seen :3
Running SMT prover for 7 properties.
[2024-06-02 23:14:20] [INFO ] Flow matrix only has 438 transitions (discarded 37 similar events)
// Phase 1: matrix 438 rows 176 cols
[2024-06-02 23:14:20] [INFO ] Computed 8 invariants in 8 ms
[2024-06-02 23:14:20] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-02 23:14:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 23:14:20] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-06-02 23:14:20] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-02 23:14:20] [INFO ] After 118ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-06-02 23:14:20] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:14:21] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:14:21] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-06-02 23:14:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 213 ms
[2024-06-02 23:14:21] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:14:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2024-06-02 23:14:21] [INFO ] After 550ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 101 ms.
[2024-06-02 23:14:21] [INFO ] After 910ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 47 ms.
Support contains 12 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 475/475 transitions.
Applied a total of 0 rules in 11 ms. Remains 176 /176 variables (removed 0) and now considering 475/475 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 176/176 places, 475/475 transitions.
Incomplete random walk after 10000 steps, including 291 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 70 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 432433 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :{}
Probabilistic random walk after 432433 steps, saw 129080 distinct states, run finished after 3002 ms. (steps per millisecond=144 ) properties seen :0
Running SMT prover for 7 properties.
[2024-06-02 23:14:24] [INFO ] Flow matrix only has 438 transitions (discarded 37 similar events)
[2024-06-02 23:14:24] [INFO ] Invariant cache hit.
[2024-06-02 23:14:25] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-02 23:14:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:14:25] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-06-02 23:14:25] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-02 23:14:25] [INFO ] After 120ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-06-02 23:14:25] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:14:25] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 0 ms to minimize.
[2024-06-02 23:14:25] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-06-02 23:14:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 203 ms
[2024-06-02 23:14:25] [INFO ] After 477ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 92 ms.
[2024-06-02 23:14:25] [INFO ] After 819ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 22 ms.
Support contains 12 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 475/475 transitions.
Applied a total of 0 rules in 14 ms. Remains 176 /176 variables (removed 0) and now considering 475/475 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 176/176 places, 475/475 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 475/475 transitions.
Applied a total of 0 rules in 10 ms. Remains 176 /176 variables (removed 0) and now considering 475/475 (removed 0) transitions.
[2024-06-02 23:14:25] [INFO ] Flow matrix only has 438 transitions (discarded 37 similar events)
[2024-06-02 23:14:25] [INFO ] Invariant cache hit.
[2024-06-02 23:14:26] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 23:14:26] [INFO ] Flow matrix only has 438 transitions (discarded 37 similar events)
[2024-06-02 23:14:26] [INFO ] Invariant cache hit.
[2024-06-02 23:14:26] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-02 23:14:26] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2024-06-02 23:14:26] [INFO ] Redundant transitions in 30 ms returned []
[2024-06-02 23:14:26] [INFO ] Flow matrix only has 438 transitions (discarded 37 similar events)
[2024-06-02 23:14:26] [INFO ] Invariant cache hit.
[2024-06-02 23:14:26] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 623 ms. Remains : 176/176 places, 475/475 transitions.
Graph (trivial) has 139 edges and 176 vertex of which 29 / 176 are part of one of the 4 SCC in 2 ms
Free SCC test removed 25 places
Drop transitions removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 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 150 transition count 330
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 150 transition count 321
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 14 place count 149 transition count 320
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 149 transition count 319
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 17 place count 148 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 147 transition count 267
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 147 transition count 267
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 147 transition count 252
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 138 transition count 249
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 138 transition count 249
Applied a total of 46 rules in 38 ms. Remains 138 /176 variables (removed 38) and now considering 249/475 (removed 226) transitions.
Running SMT prover for 7 properties.
[2024-06-02 23:14:26] [INFO ] Flow matrix only has 247 transitions (discarded 2 similar events)
// Phase 1: matrix 247 rows 138 cols
[2024-06-02 23:14:26] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 23:14:26] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-02 23:14:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:14:26] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-06-02 23:14:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 23:14:26] [INFO ] After 55ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-06-02 23:14:26] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-06-02 23:14:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-06-02 23:14:26] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 0 ms to minimize.
[2024-06-02 23:14:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-06-02 23:14:27] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-06-02 23:14:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-06-02 23:14:27] [INFO ] After 286ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-06-02 23:14:27] [INFO ] After 506ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Computed a total of 51 stabilizing places and 117 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' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 505/505 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 192 transition count 503
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 190 transition count 503
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 188 transition count 498
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 188 transition count 498
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 186 transition count 493
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 186 transition count 493
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 184 transition count 488
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 184 transition count 488
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 182 transition count 483
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 182 transition count 483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 180 transition count 478
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 180 transition count 478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 178 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 178 transition count 473
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 177 transition count 471
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 177 transition count 471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 176 transition count 469
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 176 transition count 469
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 173 transition count 466
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 0 with 6 rules applied. Total rules applied 44 place count 170 transition count 472
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 170 transition count 466
Applied a total of 50 rules in 70 ms. Remains 170 /192 variables (removed 22) and now considering 466/505 (removed 39) transitions.
[2024-06-02 23:14:27] [INFO ] Flow matrix only has 427 transitions (discarded 39 similar events)
// Phase 1: matrix 427 rows 170 cols
[2024-06-02 23:14:27] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 23:14:27] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 23:14:27] [INFO ] Flow matrix only has 427 transitions (discarded 39 similar events)
[2024-06-02 23:14:27] [INFO ] Invariant cache hit.
[2024-06-02 23:14:27] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-02 23:14:27] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-06-02 23:14:27] [INFO ] Redundant transitions in 11 ms returned []
[2024-06-02 23:14:27] [INFO ] Flow matrix only has 427 transitions (discarded 39 similar events)
[2024-06-02 23:14:27] [INFO ] Invariant cache hit.
[2024-06-02 23:14:27] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/192 places, 466/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 631 ms. Remains : 170/192 places, 466/505 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 227 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-14-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s66 1), p1:(OR (EQ s135 0) (EQ s105 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 12 steps with 5 reset in 3 ms.
FORMULA FireWire-PT-14-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLCardinality-00 finished in 915 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((G(p0) U p1)&&(F(G(p3))||p2)))))'
Support contains 8 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 505/505 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 190 transition count 499
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 190 transition count 499
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 188 transition count 495
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 188 transition count 495
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 186 transition count 489
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 186 transition count 489
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 184 transition count 485
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 184 transition count 485
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 182 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 182 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 180 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 180 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 178 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 178 transition count 470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 177 transition count 468
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 177 transition count 468
Applied a total of 30 rules in 16 ms. Remains 177 /192 variables (removed 15) and now considering 468/505 (removed 37) transitions.
[2024-06-02 23:14:28] [INFO ] Flow matrix only has 436 transitions (discarded 32 similar events)
// Phase 1: matrix 436 rows 177 cols
[2024-06-02 23:14:28] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 23:14:28] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 23:14:28] [INFO ] Flow matrix only has 436 transitions (discarded 32 similar events)
[2024-06-02 23:14:28] [INFO ] Invariant cache hit.
[2024-06-02 23:14:28] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 23:14:28] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2024-06-02 23:14:28] [INFO ] Flow matrix only has 436 transitions (discarded 32 similar events)
[2024-06-02 23:14:28] [INFO ] Invariant cache hit.
[2024-06-02 23:14:28] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 177/192 places, 468/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 590 ms. Remains : 177/192 places, 468/505 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : FireWire-PT-14-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p2) p3)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) p0 p2 p3), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={1} source=3 dest: 4}, { cond=(AND (NOT p1) p0 p2 p3), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={0, 1} source=3 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p0) (NOT p2) p3)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={0, 1} source=4 dest: 3}, { cond=(OR (AND (NOT p1) p0 p3) (AND p0 (NOT p2) p3)), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p1) p0 (NOT p3)) (AND p0 (NOT p2) (NOT p3))), acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) p3), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={1} source=5 dest: 4}, { cond=(AND (NOT p1) p0 p3), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s156 0) (EQ s2 1)), p0:(OR (EQ s129 0) (EQ s70 1)), p2:(OR (EQ s169 0) (EQ s95 1)), p3:(OR (EQ s135 0) (EQ s81 1))], nbAcceptance=2, 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]]
Product exploration explored 100000 steps with 50000 reset in 330 ms.
Product exploration explored 100000 steps with 50000 reset in 261 ms.
Computed a total of 36 stabilizing places and 80 stable transitions
Computed a total of 36 stabilizing places and 80 stable transitions
Detected a total of 36/177 stabilizing places and 80/468 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2 p3), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0 p2 p3)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p2) p3))))), (X (X (NOT (AND (NOT p1) p0 p2 (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 212 ms. Reduced automaton from 6 states, 24 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-14-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-14-LTLCardinality-02 finished in 1775 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 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 505/505 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 191 transition count 501
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 188 transition count 501
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 185 transition count 493
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 185 transition count 493
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 182 transition count 486
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 182 transition count 486
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 179 transition count 478
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 179 transition count 478
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 176 transition count 471
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 176 transition count 471
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 174 transition count 466
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 174 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 172 transition count 461
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 172 transition count 461
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 170 transition count 457
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 170 transition count 457
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 168 transition count 452
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 168 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 167 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 167 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 166 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 166 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 165 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 165 transition count 446
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 162 transition count 443
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 0 with 6 rules applied. Total rules applied 64 place count 159 transition count 449
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 159 transition count 443
Applied a total of 70 rules in 60 ms. Remains 159 /192 variables (removed 33) and now considering 443/505 (removed 62) transitions.
[2024-06-02 23:14:30] [INFO ] Flow matrix only has 404 transitions (discarded 39 similar events)
// Phase 1: matrix 404 rows 159 cols
[2024-06-02 23:14:30] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 23:14:30] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 23:14:30] [INFO ] Flow matrix only has 404 transitions (discarded 39 similar events)
[2024-06-02 23:14:30] [INFO ] Invariant cache hit.
[2024-06-02 23:14:30] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 23:14:30] [INFO ] Implicit Places using invariants and state equation in 253 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 338 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/192 places, 443/505 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 405 ms. Remains : 158/192 places, 443/505 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-14-LTLCardinality-04 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 (EQ s71 1) (EQ s81 0) (EQ s108 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 3 reset in 168 ms.
Product exploration explored 100000 steps with 3 reset in 82 ms.
Computed a total of 20 stabilizing places and 55 stable transitions
Computed a total of 20 stabilizing places and 55 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 171 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 39 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 316 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1341765 steps, run timeout after 3001 ms. (steps per millisecond=447 ) properties seen :{}
Probabilistic random walk after 1341765 steps, saw 335546 distinct states, run finished after 3002 ms. (steps per millisecond=446 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:14:33] [INFO ] Flow matrix only has 404 transitions (discarded 39 similar events)
// Phase 1: matrix 404 rows 158 cols
[2024-06-02 23:14:33] [INFO ] Computed 7 invariants in 10 ms
[2024-06-02 23:14:33] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:14:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:14:34] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:14:34] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 23:14:34] [INFO ] After 27ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:14:34] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-06-02 23:14:34] [INFO ] After 174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 443/443 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 158 transition count 437
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 158 transition count 443
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 155 transition count 437
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 155 transition count 431
Applied a total of 24 rules in 25 ms. Remains 155 /158 variables (removed 3) and now considering 431/443 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 155/158 places, 431/443 transitions.
Incomplete random walk after 10000 steps, including 330 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1196179 steps, run visited all 1 properties in 2737 ms. (steps per millisecond=437 )
Probabilistic random walk after 1196179 steps, saw 349960 distinct states, run finished after 2738 ms. (steps per millisecond=436 ) 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 103 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)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 443/443 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 443/443 (removed 0) transitions.
[2024-06-02 23:14:37] [INFO ] Flow matrix only has 404 transitions (discarded 39 similar events)
[2024-06-02 23:14:37] [INFO ] Invariant cache hit.
[2024-06-02 23:14:37] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 23:14:37] [INFO ] Flow matrix only has 404 transitions (discarded 39 similar events)
[2024-06-02 23:14:37] [INFO ] Invariant cache hit.
[2024-06-02 23:14:37] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 23:14:37] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-06-02 23:14:37] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 23:14:37] [INFO ] Flow matrix only has 404 transitions (discarded 39 similar events)
[2024-06-02 23:14:37] [INFO ] Invariant cache hit.
[2024-06-02 23:14:37] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 495 ms. Remains : 158/158 places, 443/443 transitions.
Computed a total of 20 stabilizing places and 55 stable transitions
Computed a total of 20 stabilizing places and 55 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 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 34 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 315 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1357469 steps, run timeout after 3001 ms. (steps per millisecond=452 ) properties seen :{}
Probabilistic random walk after 1357469 steps, saw 339074 distinct states, run finished after 3001 ms. (steps per millisecond=452 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:14:40] [INFO ] Flow matrix only has 404 transitions (discarded 39 similar events)
[2024-06-02 23:14:40] [INFO ] Invariant cache hit.
[2024-06-02 23:14:40] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:14:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:14:40] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:14:40] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 23:14:41] [INFO ] After 22ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:14:41] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-06-02 23:14:41] [INFO ] After 189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 443/443 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 158 transition count 437
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 158 transition count 443
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 155 transition count 437
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 155 transition count 431
Applied a total of 24 rules in 18 ms. Remains 155 /158 variables (removed 3) and now considering 431/443 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 155/158 places, 431/443 transitions.
Incomplete random walk after 10000 steps, including 325 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1196179 steps, run visited all 1 properties in 2743 ms. (steps per millisecond=436 )
Probabilistic random walk after 1196179 steps, saw 349960 distinct states, run finished after 2743 ms. (steps per millisecond=436 ) 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 135 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 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4 reset in 48 ms.
Product exploration explored 100000 steps with 3 reset in 192 ms.
Built C files in :
/tmp/ltsmin2686138690331533400
[2024-06-02 23:14:44] [INFO ] Computing symmetric may disable matrix : 443 transitions.
[2024-06-02 23:14:44] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:14:44] [INFO ] Computing symmetric may enable matrix : 443 transitions.
[2024-06-02 23:14:44] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:14:44] [INFO ] Computing Do-Not-Accords matrix : 443 transitions.
[2024-06-02 23:14:44] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:14:44] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2686138690331533400
Running compilation step : cd /tmp/ltsmin2686138690331533400;'/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 989 ms.
Running link step : cd /tmp/ltsmin2686138690331533400;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin2686138690331533400;'/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/stateBased12055760604773712037.hoa' '--buchi-type=spotba'
LTSmin run took 1151 ms.
FORMULA FireWire-PT-14-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-14-LTLCardinality-04 finished in 16707 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)))||(F(p0)&&p2))))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 505/505 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 189 transition count 497
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 189 transition count 497
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 186 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 186 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 183 transition count 482
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 183 transition count 482
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 180 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 180 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 177 transition count 467
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 177 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 175 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 175 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 173 transition count 457
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 173 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 172 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 172 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 171 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 171 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 170 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 170 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 169 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 169 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 168 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 168 transition count 446
Applied a total of 48 rules in 23 ms. Remains 168 /192 variables (removed 24) and now considering 446/505 (removed 59) transitions.
[2024-06-02 23:14:46] [INFO ] Flow matrix only has 414 transitions (discarded 32 similar events)
// Phase 1: matrix 414 rows 168 cols
[2024-06-02 23:14:46] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 23:14:46] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 23:14:46] [INFO ] Flow matrix only has 414 transitions (discarded 32 similar events)
[2024-06-02 23:14:46] [INFO ] Invariant cache hit.
[2024-06-02 23:14:46] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 23:14:47] [INFO ] Implicit Places using invariants and state equation in 276 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 358 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 167/192 places, 446/505 transitions.
Applied a total of 0 rules in 2 ms. Remains 167 /167 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 385 ms. Remains : 167/192 places, 446/505 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-14-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p0 p1), acceptance={} source=5 dest: 4}]], initial=2, aps=[p0:(EQ s165 1), p2:(AND (EQ s133 0) (EQ s33 1)), p1:(AND (EQ s133 0) (EQ s33 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-14-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLCardinality-05 finished in 629 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 505/505 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 189 transition count 497
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 189 transition count 497
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 186 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 186 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 183 transition count 482
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 183 transition count 482
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 180 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 180 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 177 transition count 467
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 177 transition count 467
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 174 transition count 460
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 174 transition count 460
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 171 transition count 453
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 171 transition count 453
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 168 transition count 446
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 168 transition count 446
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 166 transition count 441
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 166 transition count 441
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 164 transition count 437
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 164 transition count 437
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 162 transition count 433
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 162 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 161 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 161 transition count 431
Applied a total of 62 rules in 20 ms. Remains 161 /192 variables (removed 31) and now considering 431/505 (removed 74) transitions.
[2024-06-02 23:14:47] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 161 cols
[2024-06-02 23:14:47] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 23:14:47] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 23:14:47] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:14:47] [INFO ] Invariant cache hit.
[2024-06-02 23:14:47] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:14:47] [INFO ] Implicit Places using invariants and state equation in 243 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 327 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/192 places, 431/505 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 353 ms. Remains : 160/192 places, 431/505 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-14-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s36 1), p0:(OR (EQ s98 0) (EQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-14-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLCardinality-08 finished in 503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 505/505 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 189 transition count 497
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 189 transition count 497
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 186 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 186 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 183 transition count 482
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 183 transition count 482
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 180 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 180 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 177 transition count 467
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 177 transition count 467
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 174 transition count 460
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 174 transition count 460
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 171 transition count 453
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 171 transition count 453
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 168 transition count 446
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 168 transition count 446
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 166 transition count 441
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 166 transition count 441
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 164 transition count 437
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 164 transition count 437
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 162 transition count 433
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 162 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 161 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 161 transition count 431
Applied a total of 62 rules in 18 ms. Remains 161 /192 variables (removed 31) and now considering 431/505 (removed 74) transitions.
[2024-06-02 23:14:47] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:14:47] [INFO ] Invariant cache hit.
[2024-06-02 23:14:47] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 23:14:47] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:14:47] [INFO ] Invariant cache hit.
[2024-06-02 23:14:48] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:14:48] [INFO ] Implicit Places using invariants and state equation in 240 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 324 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/192 places, 431/505 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 344 ms. Remains : 160/192 places, 431/505 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FireWire-PT-14-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s98 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 260 ms.
Product exploration explored 100000 steps with 50000 reset in 219 ms.
Computed a total of 19 stabilizing places and 43 stable transitions
Computed a total of 19 stabilizing places and 43 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 22 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-14-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-14-LTLCardinality-10 finished in 954 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((X(X(p1))&&p0))&&X(F(p2))))'
Support contains 4 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 505/505 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 190 transition count 500
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 190 transition count 500
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 188 transition count 495
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 188 transition count 495
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 186 transition count 490
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 186 transition count 490
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 184 transition count 485
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 184 transition count 485
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 182 transition count 480
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 182 transition count 480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 180 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 180 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 178 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 178 transition count 470
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 176 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 176 transition count 465
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 174 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 174 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 172 transition count 456
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 172 transition count 456
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 170 transition count 452
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 170 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 169 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 169 transition count 450
Applied a total of 46 rules in 22 ms. Remains 169 /192 variables (removed 23) and now considering 450/505 (removed 55) transitions.
[2024-06-02 23:14:48] [INFO ] Flow matrix only has 418 transitions (discarded 32 similar events)
// Phase 1: matrix 418 rows 169 cols
[2024-06-02 23:14:48] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 23:14:48] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 23:14:48] [INFO ] Flow matrix only has 418 transitions (discarded 32 similar events)
[2024-06-02 23:14:48] [INFO ] Invariant cache hit.
[2024-06-02 23:14:48] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:14:49] [INFO ] Implicit Places using invariants and state equation in 232 ms returned [78]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 318 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 168/192 places, 450/505 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 450/450 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 342 ms. Remains : 168/192 places, 450/505 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : FireWire-PT-14-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s45 0) (EQ s60 1)), p2:(AND (EQ s45 0) (EQ s60 1)), p1:(OR (EQ s121 0) (EQ s166 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-14-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLCardinality-12 finished in 618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 505/505 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 191 transition count 501
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 188 transition count 501
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 185 transition count 493
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 185 transition count 493
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 182 transition count 486
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 182 transition count 486
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 179 transition count 478
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 179 transition count 478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 177 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 177 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 175 transition count 468
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 175 transition count 468
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 173 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 173 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 171 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 171 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 169 transition count 454
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 169 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 168 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 168 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 167 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 167 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 166 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 166 transition count 448
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 163 transition count 445
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 0 with 6 rules applied. Total rules applied 62 place count 160 transition count 451
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 160 transition count 445
Applied a total of 68 rules in 46 ms. Remains 160 /192 variables (removed 32) and now considering 445/505 (removed 60) transitions.
[2024-06-02 23:14:49] [INFO ] Flow matrix only has 406 transitions (discarded 39 similar events)
// Phase 1: matrix 406 rows 160 cols
[2024-06-02 23:14:49] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 23:14:49] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 23:14:49] [INFO ] Flow matrix only has 406 transitions (discarded 39 similar events)
[2024-06-02 23:14:49] [INFO ] Invariant cache hit.
[2024-06-02 23:14:49] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 23:14:49] [INFO ] Implicit Places using invariants and state equation in 242 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 322 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/192 places, 445/505 transitions.
Applied a total of 0 rules in 6 ms. Remains 159 /159 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 375 ms. Remains : 159/192 places, 445/505 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-14-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s70 0) (EQ s38 1)), p1:(EQ s93 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-14-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLCardinality-13 finished in 529 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)||X(p1)||G(!p1)))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 505/505 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 189 transition count 497
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 189 transition count 497
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 186 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 186 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 183 transition count 482
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 183 transition count 482
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 180 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 180 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 177 transition count 467
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 177 transition count 467
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 174 transition count 460
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 174 transition count 460
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 171 transition count 453
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 171 transition count 453
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 168 transition count 446
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 168 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 167 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 167 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 166 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 166 transition count 441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 165 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 165 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 164 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 164 transition count 437
Applied a total of 56 rules in 19 ms. Remains 164 /192 variables (removed 28) and now considering 437/505 (removed 68) transitions.
[2024-06-02 23:14:49] [INFO ] Flow matrix only has 405 transitions (discarded 32 similar events)
// Phase 1: matrix 405 rows 164 cols
[2024-06-02 23:14:49] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 23:14:50] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 23:14:50] [INFO ] Flow matrix only has 405 transitions (discarded 32 similar events)
[2024-06-02 23:14:50] [INFO ] Invariant cache hit.
[2024-06-02 23:14:50] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:14:50] [INFO ] Implicit Places using invariants and state equation in 353 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 439 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/192 places, 437/505 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 437/437 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 461 ms. Remains : 163/192 places, 437/505 transitions.
Stuttering acceptance computed with spot in 320 ms :[true, (NOT p1), false, (AND (NOT p0) (NOT p1)), p1, (AND p1 (NOT p0)), (NOT p0), false, false]
Running random walk in product with property : FireWire-PT-14-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 5}]], initial=2, aps=[p1:(AND (NEQ s106 0) (NEQ s158 1)), p0:(EQ s120 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, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 109 ms.
Product exploration explored 100000 steps with 5 reset in 78 ms.
Computed a total of 22 stabilizing places and 49 stable transitions
Computed a total of 22 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 236 ms. Reduced automaton from 9 states, 19 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 288 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-06-02 23:14:51] [INFO ] Flow matrix only has 405 transitions (discarded 32 similar events)
// Phase 1: matrix 405 rows 163 cols
[2024-06-02 23:14:51] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:14:51] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:14:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:14:51] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 23:14:51] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:14:51] [INFO ] After 76ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 23:14:51] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-06-02 23:14:51] [INFO ] After 352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 437/437 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 163 transition count 434
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 163 transition count 431
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 9 place count 160 transition count 431
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 157 transition count 428
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 21 place count 154 transition count 434
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 27 place count 154 transition count 428
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 154 transition count 425
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 154 transition count 431
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 42 place count 151 transition count 425
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 48 place count 151 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 150 transition count 418
Applied a total of 49 rules in 32 ms. Remains 150 /163 variables (removed 13) and now considering 418/437 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 150/163 places, 418/437 transitions.
Incomplete random walk after 10000 steps, including 317 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 67 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Finished probabilistic random walk after 750342 steps, run visited all 3 properties in 1731 ms. (steps per millisecond=433 )
Probabilistic random walk after 750342 steps, saw 221841 distinct states, run finished after 1731 ms. (steps per millisecond=433 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) p1))
Knowledge based reduction with 11 factoid took 308 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-14-LTLCardinality-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-14-LTLCardinality-15 finished in 4234 ms.
All properties solved by simple procedures.
Total runtime 41903 ms.

BK_STOP 1717370095200

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-14"
export BK_EXAMINATION="LTLCardinality"
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-14, examination is LTLCardinality"
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-171734910400172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-14.tgz
mv FireWire-PT-14 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;