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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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 101K 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-10-LTLFireability-00
FORMULA_NAME FireWire-PT-10-LTLFireability-01
FORMULA_NAME FireWire-PT-10-LTLFireability-02
FORMULA_NAME FireWire-PT-10-LTLFireability-03
FORMULA_NAME FireWire-PT-10-LTLFireability-04
FORMULA_NAME FireWire-PT-10-LTLFireability-05
FORMULA_NAME FireWire-PT-10-LTLFireability-06
FORMULA_NAME FireWire-PT-10-LTLFireability-07
FORMULA_NAME FireWire-PT-10-LTLFireability-08
FORMULA_NAME FireWire-PT-10-LTLFireability-09
FORMULA_NAME FireWire-PT-10-LTLFireability-10
FORMULA_NAME FireWire-PT-10-LTLFireability-11
FORMULA_NAME FireWire-PT-10-LTLFireability-12
FORMULA_NAME FireWire-PT-10-LTLFireability-13
FORMULA_NAME FireWire-PT-10-LTLFireability-14
FORMULA_NAME FireWire-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717369574571

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 23:06:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 23:06:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:06:16] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-06-02 23:06:16] [INFO ] Transformed 131 places.
[2024-06-02 23:06:16] [INFO ] Transformed 409 transitions.
[2024-06-02 23:06:16] [INFO ] Found NUPN structural information;
[2024-06-02 23:06:16] [INFO ] Parsed PT model containing 131 places and 409 transitions and 1529 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
FORMULA FireWire-PT-10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 353/353 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 128 transition count 347
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 128 transition count 347
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 128 transition count 345
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 128 transition count 339
Applied a total of 14 rules in 27 ms. Remains 128 /131 variables (removed 3) and now considering 339/353 (removed 14) transitions.
[2024-06-02 23:06:16] [INFO ] Flow matrix only has 313 transitions (discarded 26 similar events)
// Phase 1: matrix 313 rows 128 cols
[2024-06-02 23:06:16] [INFO ] Computed 8 invariants in 21 ms
[2024-06-02 23:06:16] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-06-02 23:06:16] [INFO ] Flow matrix only has 313 transitions (discarded 26 similar events)
[2024-06-02 23:06:16] [INFO ] Invariant cache hit.
[2024-06-02 23:06:16] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 23:06:17] [INFO ] Implicit Places using invariants and state equation in 254 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 496 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 127/131 places, 339/353 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 529 ms. Remains : 127/131 places, 339/353 transitions.
Support contains 31 out of 127 places after structural reductions.
[2024-06-02 23:06:17] [INFO ] Flatten gal took : 50 ms
[2024-06-02 23:06:17] [INFO ] Flatten gal took : 23 ms
[2024-06-02 23:06:17] [INFO ] Input system was already deterministic with 339 transitions.
Incomplete random walk after 10000 steps, including 563 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 28) seen :10
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2024-06-02 23:06:17] [INFO ] Flow matrix only has 313 transitions (discarded 26 similar events)
// Phase 1: matrix 313 rows 127 cols
[2024-06-02 23:06:17] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:06:18] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:06:18] [INFO ] After 106ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:15
[2024-06-02 23:06:18] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 23:06:18] [INFO ] After 34ms SMT Verify possible using 45 Read/Feed constraints in real domain returned unsat :1 sat :0 real:16
[2024-06-02 23:06:18] [INFO ] After 290ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:16
[2024-06-02 23:06:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:06:18] [INFO ] After 291ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :16
[2024-06-02 23:06:18] [INFO ] After 296ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :1 sat :16
[2024-06-02 23:06:19] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 7 ms to minimize.
[2024-06-02 23:06:19] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:06:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2024-06-02 23:06:19] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-02 23:06:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-06-02 23:06:19] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:06:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-06-02 23:06:19] [INFO ] After 877ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :16
Attempting to minimize the solution found.
Minimization took 223 ms.
[2024-06-02 23:06:19] [INFO ] After 1518ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :16
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 180 ms.
Support contains 17 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 339/339 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 127 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 126 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 126 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 125 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 125 transition count 331
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 124 transition count 330
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
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 13 place count 122 transition count 334
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 17 place count 122 transition count 330
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 122 transition count 328
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 122 transition count 329
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 25 place count 120 transition count 327
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 120 transition count 325
Applied a total of 27 rules in 77 ms. Remains 120 /127 variables (removed 7) and now considering 325/339 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 120/127 places, 325/339 transitions.
Incomplete random walk after 10000 steps, including 523 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-06-02 23:06:20] [INFO ] Flow matrix only has 298 transitions (discarded 27 similar events)
// Phase 1: matrix 298 rows 120 cols
[2024-06-02 23:06:20] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 23:06:20] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-06-02 23:06:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 23:06:20] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-06-02 23:06:20] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 23:06:20] [INFO ] After 163ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-06-02 23:06:20] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:06:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-06-02 23:06:21] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-02 23:06:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-06-02 23:06:21] [INFO ] After 493ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 139 ms.
[2024-06-02 23:06:21] [INFO ] After 894ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 29 ms.
Support contains 12 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 325/325 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 119 transition count 322
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 119 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 118 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 117 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 117 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 116 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 116 transition count 315
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 115 transition count 317
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 115 transition count 315
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 115 transition count 314
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 115 transition count 313
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 17 place count 114 transition count 311
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 113 transition count 310
Applied a total of 18 rules in 42 ms. Remains 113 /120 variables (removed 7) and now considering 310/325 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 113/120 places, 310/325 transitions.
Incomplete random walk after 10000 steps, including 582 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 277 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 141 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 154 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 134 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Finished probabilistic random walk after 802484 steps, run visited all 10 properties in 2136 ms. (steps per millisecond=375 )
Probabilistic random walk after 802484 steps, saw 167656 distinct states, run finished after 2136 ms. (steps per millisecond=375 ) properties seen :10
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 22 stabilizing places and 46 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(G(p1))))))'
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 334
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 121 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 119 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 119 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 114 transition count 307
Applied a total of 27 rules in 21 ms. Remains 114 /127 variables (removed 13) and now considering 307/339 (removed 32) transitions.
[2024-06-02 23:06:24] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
// Phase 1: matrix 281 rows 114 cols
[2024-06-02 23:06:24] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:06:24] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 23:06:24] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2024-06-02 23:06:24] [INFO ] Invariant cache hit.
[2024-06-02 23:06:24] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 23:06:24] [INFO ] Implicit Places using invariants and state equation in 274 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 343 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/127 places, 307/339 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 367 ms. Remains : 113/127 places, 307/339 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 252 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s10 0) (EQ s47 0)), p1:(AND (EQ s8 1) (EQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-00 finished in 674 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 333
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 333
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 124 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 123 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 123 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 122 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 122 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 121 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 121 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 120 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 120 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 119 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 118 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 117 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 116 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 114 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 114 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 113 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 113 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 112 transition count 305
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 109 transition count 311
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 109 transition count 305
Applied a total of 41 rules in 55 ms. Remains 109 /127 variables (removed 18) and now considering 305/339 (removed 34) transitions.
[2024-06-02 23:06:24] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
// Phase 1: matrix 272 rows 109 cols
[2024-06-02 23:06:24] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:06:24] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 23:06:24] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
[2024-06-02 23:06:24] [INFO ] Invariant cache hit.
[2024-06-02 23:06:25] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 23:06:25] [INFO ] Implicit Places using invariants and state equation in 166 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 228 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/127 places, 305/339 transitions.
Applied a total of 0 rules in 9 ms. Remains 108 /108 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 292 ms. Remains : 108/127 places, 305/339 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-02 finished in 339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (F(p0)&&X(G(!p0))))))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 126 transition count 337
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 126 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 126 transition count 336
Applied a total of 3 rules in 8 ms. Remains 126 /127 variables (removed 1) and now considering 336/339 (removed 3) transitions.
[2024-06-02 23:06:25] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
// Phase 1: matrix 310 rows 126 cols
[2024-06-02 23:06:25] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:06:25] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 23:06:25] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
[2024-06-02 23:06:25] [INFO ] Invariant cache hit.
[2024-06-02 23:06:25] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 23:06:25] [INFO ] Implicit Places using invariants and state equation in 216 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 281 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/127 places, 336/339 transitions.
Applied a total of 0 rules in 2 ms. Remains 125 /125 variables (removed 0) and now considering 336/336 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 292 ms. Remains : 125/127 places, 336/339 transitions.
Stuttering acceptance computed with spot in 146 ms :[p0, p0, true, true, true]
Running random walk in product with property : FireWire-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (EQ s9 1) (EQ s111 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-03 finished in 454 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) U p1)||X((p0||X(X(F(p2)))))))'
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 126 transition count 336
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 126 transition count 336
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 125 transition count 334
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 125 transition count 334
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 124 transition count 331
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 123 transition count 329
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 123 transition count 329
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 122 transition count 326
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 121 transition count 324
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 121 transition count 324
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 120 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 119 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 119 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 118 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 117 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 116 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 115 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 115 transition count 310
Applied a total of 24 rules in 21 ms. Remains 115 /127 variables (removed 12) and now considering 310/339 (removed 29) transitions.
[2024-06-02 23:06:25] [INFO ] Flow matrix only has 284 transitions (discarded 26 similar events)
// Phase 1: matrix 284 rows 115 cols
[2024-06-02 23:06:25] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:06:25] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 23:06:25] [INFO ] Flow matrix only has 284 transitions (discarded 26 similar events)
[2024-06-02 23:06:25] [INFO ] Invariant cache hit.
[2024-06-02 23:06:25] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 23:06:25] [INFO ] Implicit Places using invariants and state equation in 228 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 289 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/127 places, 310/339 transitions.
Applied a total of 0 rules in 2 ms. Remains 114 /114 variables (removed 0) and now considering 310/310 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 312 ms. Remains : 114/127 places, 310/339 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FireWire-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}]], initial=1, aps=[p1:(AND (EQ s5 1) (EQ s38 1)), p2:(AND (EQ s8 1) (EQ s30 1)), p0:(EQ s102 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-04 finished in 508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(p2))))'
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 334
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 123 transition count 328
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 122 transition count 327
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 15 place count 120 transition count 331
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 120 transition count 327
Applied a total of 19 rules in 26 ms. Remains 120 /127 variables (removed 7) and now considering 327/339 (removed 12) transitions.
[2024-06-02 23:06:26] [INFO ] Flow matrix only has 297 transitions (discarded 30 similar events)
// Phase 1: matrix 297 rows 120 cols
[2024-06-02 23:06:26] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:06:26] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 23:06:26] [INFO ] Flow matrix only has 297 transitions (discarded 30 similar events)
[2024-06-02 23:06:26] [INFO ] Invariant cache hit.
[2024-06-02 23:06:26] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 23:06:26] [INFO ] Implicit Places using invariants and state equation in 188 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 246 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/127 places, 327/339 transitions.
Applied a total of 0 rules in 18 ms. Remains 119 /119 variables (removed 0) and now considering 327/327 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 290 ms. Remains : 119/127 places, 327/339 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : FireWire-PT-10-LTLFireability-05 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 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s8 0) (EQ s97 0)), p1:(AND (EQ s4 1) (EQ s108 1)), p2:(AND (EQ s7 1) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-05 finished in 493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(((!X(p0) U p1)||F(p2)||p1)))))'
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 334
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 124 transition count 331
Applied a total of 7 rules in 5 ms. Remains 124 /127 variables (removed 3) and now considering 331/339 (removed 8) transitions.
[2024-06-02 23:06:26] [INFO ] Flow matrix only has 305 transitions (discarded 26 similar events)
// Phase 1: matrix 305 rows 124 cols
[2024-06-02 23:06:26] [INFO ] Computed 7 invariants in 11 ms
[2024-06-02 23:06:26] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 23:06:26] [INFO ] Flow matrix only has 305 transitions (discarded 26 similar events)
[2024-06-02 23:06:26] [INFO ] Invariant cache hit.
[2024-06-02 23:06:26] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 23:06:26] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-06-02 23:06:26] [INFO ] Flow matrix only has 305 transitions (discarded 26 similar events)
[2024-06-02 23:06:26] [INFO ] Invariant cache hit.
[2024-06-02 23:06:27] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/127 places, 331/339 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 424 ms. Remains : 124/127 places, 331/339 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s3 0) (EQ s112 0)), p1:(AND (EQ s13 1) (EQ s25 1)), p0:(AND (EQ s3 1) (EQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 153 ms.
Product exploration explored 100000 steps with 3 reset in 82 ms.
Computed a total of 20 stabilizing places and 41 stable transitions
Computed a total of 20 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 100 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 551 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 164 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 149 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Finished probabilistic random walk after 194372 steps, run visited all 3 properties in 528 ms. (steps per millisecond=368 )
Probabilistic random walk after 194372 steps, saw 41412 distinct states, run finished after 528 ms. (steps per millisecond=368 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1))), (F (AND p0 (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 338 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 331/331 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 331/331 (removed 0) transitions.
[2024-06-02 23:06:29] [INFO ] Flow matrix only has 305 transitions (discarded 26 similar events)
[2024-06-02 23:06:29] [INFO ] Invariant cache hit.
[2024-06-02 23:06:29] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-02 23:06:29] [INFO ] Flow matrix only has 305 transitions (discarded 26 similar events)
[2024-06-02 23:06:29] [INFO ] Invariant cache hit.
[2024-06-02 23:06:29] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 23:06:29] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2024-06-02 23:06:29] [INFO ] Flow matrix only has 305 transitions (discarded 26 similar events)
[2024-06-02 23:06:29] [INFO ] Invariant cache hit.
[2024-06-02 23:06:29] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 643 ms. Remains : 124/124 places, 331/331 transitions.
Computed a total of 20 stabilizing places and 41 stable transitions
Computed a total of 20 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 113 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 585 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 155 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 168 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Finished probabilistic random walk after 194372 steps, run visited all 3 properties in 655 ms. (steps per millisecond=296 )
Probabilistic random walk after 194372 steps, saw 41412 distinct states, run finished after 655 ms. (steps per millisecond=296 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1))), (F (AND p0 (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 164 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 53 ms.
Product exploration explored 100000 steps with 0 reset in 84 ms.
Built C files in :
/tmp/ltsmin5974284140162427870
[2024-06-02 23:06:31] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5974284140162427870
Running compilation step : cd /tmp/ltsmin5974284140162427870;'/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 547 ms.
Running link step : cd /tmp/ltsmin5974284140162427870;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin5974284140162427870;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15597199303205344758.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 331/331 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 331/331 (removed 0) transitions.
[2024-06-02 23:06:46] [INFO ] Flow matrix only has 305 transitions (discarded 26 similar events)
[2024-06-02 23:06:46] [INFO ] Invariant cache hit.
[2024-06-02 23:06:46] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 23:06:46] [INFO ] Flow matrix only has 305 transitions (discarded 26 similar events)
[2024-06-02 23:06:46] [INFO ] Invariant cache hit.
[2024-06-02 23:06:47] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 23:06:47] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-06-02 23:06:47] [INFO ] Flow matrix only has 305 transitions (discarded 26 similar events)
[2024-06-02 23:06:47] [INFO ] Invariant cache hit.
[2024-06-02 23:06:47] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 397 ms. Remains : 124/124 places, 331/331 transitions.
Built C files in :
/tmp/ltsmin11150194242990102863
[2024-06-02 23:06:47] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11150194242990102863
Running compilation step : cd /tmp/ltsmin11150194242990102863;'/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 468 ms.
Running link step : cd /tmp/ltsmin11150194242990102863;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11150194242990102863;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4072360632314232252.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 23:07:02] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:07:02] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:07:02] [INFO ] Time to serialize gal into /tmp/LTL6053467481226511990.gal : 4 ms
[2024-06-02 23:07:02] [INFO ] Time to serialize properties into /tmp/LTL10335226106192149801.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6053467481226511990.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17643958359634806340.hoa' '-atoms' '/tmp/LTL10335226106192149801.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10335226106192149801.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17643958359634806340.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...699
Computing Next relation with stutter on 79224 deadlock states
Detected timeout of ITS tools.
[2024-06-02 23:07:17] [INFO ] Flatten gal took : 23 ms
[2024-06-02 23:07:17] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:07:17] [INFO ] Time to serialize gal into /tmp/LTL10654580706836523678.gal : 5 ms
[2024-06-02 23:07:17] [INFO ] Time to serialize properties into /tmp/LTL5062556629643283492.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10654580706836523678.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5062556629643283492.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(X((((!(X("((p3==1)&&(p119==1))")))U("((p13==1)&&(p25==1))"))||(F("((p3==0)||(p119==0))")))||("((p13==1)&&(p25==1))"))))))
Formula 0 simplified : G(F(!"((p13==1)&&(p25==1))" & X(!"((p13==1)&&(p25==1))" W "((p3==1)&&(p119==1))")) & FG!"((p3==0)||(p119==0))")
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...699
Computing Next relation with stutter on 79224 deadlock states
Detected timeout of ITS tools.
[2024-06-02 23:07:32] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:07:32] [INFO ] Applying decomposition
[2024-06-02 23:07:32] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4779874441277907662.txt' '-o' '/tmp/graph4779874441277907662.bin' '-w' '/tmp/graph4779874441277907662.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4779874441277907662.bin' '-l' '-1' '-v' '-w' '/tmp/graph4779874441277907662.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:07:32] [INFO ] Decomposing Gal with order
[2024-06-02 23:07:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:07:32] [INFO ] Removed a total of 527 redundant transitions.
[2024-06-02 23:07:32] [INFO ] Flatten gal took : 60 ms
[2024-06-02 23:07:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 121 labels/synchronizations in 13 ms.
[2024-06-02 23:07:32] [INFO ] Time to serialize gal into /tmp/LTL4972965698556350621.gal : 5 ms
[2024-06-02 23:07:32] [INFO ] Time to serialize properties into /tmp/LTL9855840313977900652.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4972965698556350621.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9855840313977900652.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G(X((((!(X("((i0.u0.p3==1)&&(i0.u26.p119==1))")))U("((i1.i0.u4.p13==1)&&(i1.i0.u8.p25==1))"))||(F("((i0.u0.p3==0)||(i0.u26.p119==...211
Formula 0 simplified : G(F(!"((i1.i0.u4.p13==1)&&(i1.i0.u8.p25==1))" & X(!"((i1.i0.u4.p13==1)&&(i1.i0.u8.p25==1))" W "((i0.u0.p3==1)&&(i0.u26.p119==1))")) ...196
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t55, t56, t61, t66, t71, t76, t80, t88, t89, t90, t91, t94,...867
Computing Next relation with stutter on 79224 deadlock states
13 unique states visited
0 strongly connected components in search stack
22 transitions explored
8 items max in DFS search stack
1076 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.7901,222620,1,0,273703,5831,3821,1.20136e+06,376,42621,811902
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FireWire-PT-10-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property FireWire-PT-10-LTLFireability-06 finished in 78217 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&&X(p1)))&&F(G(p2)))))'
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 334
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 121 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 120 transition count 321
Applied a total of 15 rules in 11 ms. Remains 120 /127 variables (removed 7) and now considering 321/339 (removed 18) transitions.
[2024-06-02 23:07:44] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
// Phase 1: matrix 295 rows 120 cols
[2024-06-02 23:07:44] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:07:44] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 23:07:44] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
[2024-06-02 23:07:44] [INFO ] Invariant cache hit.
[2024-06-02 23:07:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 23:07:45] [INFO ] Implicit Places using invariants and state equation in 214 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 281 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 119/127 places, 321/339 transitions.
Applied a total of 0 rules in 1 ms. Remains 119 /119 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 295 ms. Remains : 119/127 places, 321/339 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : FireWire-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s13 0) (EQ s25 0)), p2:(OR (EQ s3 0) (EQ s93 0)), p1:(AND (EQ s3 1) (EQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-08 finished in 499 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 333
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 333
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 124 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 123 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 123 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 122 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 122 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 121 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 121 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 120 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 120 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 119 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 118 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 117 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 116 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 114 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 114 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 113 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 113 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 112 transition count 305
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 109 transition count 311
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 109 transition count 305
Applied a total of 41 rules in 38 ms. Remains 109 /127 variables (removed 18) and now considering 305/339 (removed 34) transitions.
[2024-06-02 23:07:45] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
// Phase 1: matrix 272 rows 109 cols
[2024-06-02 23:07:45] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:07:45] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 23:07:45] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
[2024-06-02 23:07:45] [INFO ] Invariant cache hit.
[2024-06-02 23:07:45] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 23:07:45] [INFO ] Implicit Places using invariants and state equation in 166 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 237 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/127 places, 305/339 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 282 ms. Remains : 108/127 places, 305/339 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s97 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-09 finished in 452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(!p0) U p1)&&F(G(!p1))))'
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 334
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 121 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 119 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 119 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 114 transition count 307
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 113 transition count 306
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 111 transition count 310
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 111 transition count 306
Applied a total of 37 rules in 35 ms. Remains 111 /127 variables (removed 16) and now considering 306/339 (removed 33) transitions.
[2024-06-02 23:07:45] [INFO ] Flow matrix only has 276 transitions (discarded 30 similar events)
// Phase 1: matrix 276 rows 111 cols
[2024-06-02 23:07:45] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:07:45] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 23:07:45] [INFO ] Flow matrix only has 276 transitions (discarded 30 similar events)
[2024-06-02 23:07:45] [INFO ] Invariant cache hit.
[2024-06-02 23:07:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 23:07:46] [INFO ] Implicit Places using invariants and state equation in 153 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 224 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/127 places, 306/339 transitions.
Applied a total of 0 rules in 5 ms. Remains 110 /110 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 266 ms. Remains : 110/127 places, 306/339 transitions.
Stuttering acceptance computed with spot in 197 ms :[true, p0, (NOT p1), p1]
Running random walk in product with property : FireWire-PT-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s8 1) (EQ s50 1)), p0:(AND (EQ s8 1) (EQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-10 finished in 479 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(p1))&&G(p2)&&p0)))'
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 334
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 121 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 119 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 119 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 114 transition count 307
Applied a total of 27 rules in 23 ms. Remains 114 /127 variables (removed 13) and now considering 307/339 (removed 32) transitions.
[2024-06-02 23:07:46] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
// Phase 1: matrix 281 rows 114 cols
[2024-06-02 23:07:46] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:07:46] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-06-02 23:07:46] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2024-06-02 23:07:46] [INFO ] Invariant cache hit.
[2024-06-02 23:07:46] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 23:07:46] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2024-06-02 23:07:46] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2024-06-02 23:07:46] [INFO ] Invariant cache hit.
[2024-06-02 23:07:46] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/127 places, 307/339 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 572 ms. Remains : 114/127 places, 307/339 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : FireWire-PT-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}, { cond=(AND p0 p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s25 1)), p2:(AND (EQ s6 1) (EQ s111 1)), p1:(AND (EQ s8 1) (EQ s113 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-11 finished in 756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 333
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 333
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 124 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 123 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 123 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 122 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 122 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 121 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 121 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 120 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 120 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 119 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 118 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 117 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 116 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 114 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 114 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 113 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 113 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 112 transition count 305
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 35 place count 109 transition count 311
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 109 transition count 305
Applied a total of 41 rules in 27 ms. Remains 109 /127 variables (removed 18) and now considering 305/339 (removed 34) transitions.
[2024-06-02 23:07:47] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
// Phase 1: matrix 272 rows 109 cols
[2024-06-02 23:07:47] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:07:47] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 23:07:47] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
[2024-06-02 23:07:47] [INFO ] Invariant cache hit.
[2024-06-02 23:07:47] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 23:07:47] [INFO ] Implicit Places using invariants and state equation in 149 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 230 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/127 places, 305/339 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 261 ms. Remains : 108/127 places, 305/339 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-12 finished in 308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 334
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 121 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 119 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 119 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 114 transition count 307
Applied a total of 27 rules in 13 ms. Remains 114 /127 variables (removed 13) and now considering 307/339 (removed 32) transitions.
[2024-06-02 23:07:47] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
// Phase 1: matrix 281 rows 114 cols
[2024-06-02 23:07:47] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:07:47] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 23:07:47] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2024-06-02 23:07:47] [INFO ] Invariant cache hit.
[2024-06-02 23:07:47] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 23:07:47] [INFO ] Implicit Places using invariants and state equation in 294 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 352 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/127 places, 307/339 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 366 ms. Remains : 113/127 places, 307/339 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (EQ s9 0) (EQ s16 0)), p0:(OR (EQ s7 0) (EQ s50 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 198 ms.
Product exploration explored 100000 steps with 50000 reset in 199 ms.
Computed a total of 10 stabilizing places and 17 stable transitions
Computed a total of 10 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 43 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-10-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-10-LTLFireability-14 finished in 941 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(X((F(p1)&&p0)))||G(p2))))'
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 334
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 121 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 120 transition count 321
Applied a total of 15 rules in 5 ms. Remains 120 /127 variables (removed 7) and now considering 321/339 (removed 18) transitions.
[2024-06-02 23:07:48] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
// Phase 1: matrix 295 rows 120 cols
[2024-06-02 23:07:48] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:07:48] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 23:07:48] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
[2024-06-02 23:07:48] [INFO ] Invariant cache hit.
[2024-06-02 23:07:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 23:07:48] [INFO ] Implicit Places using invariants and state equation in 183 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 293 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 119/127 places, 321/339 transitions.
Applied a total of 0 rules in 0 ms. Remains 119 /119 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 300 ms. Remains : 119/127 places, 321/339 transitions.
Stuttering acceptance computed with spot in 356 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2)]
Running random walk in product with property : FireWire-PT-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={} source=2 dest: 8}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 1}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=p2, acceptance={} source=8 dest: 3}, { cond=(NOT p2), acceptance={} source=8 dest: 6}], [{ cond=(NOT p2), acceptance={} source=9 dest: 7}, { cond=p2, acceptance={} source=9 dest: 9}]], initial=2, aps=[p1:(AND (EQ s3 1) (EQ s81 1)), p0:(AND (EQ s3 1) (EQ s81 1)), p2:(EQ s25 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, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-15 finished in 689 ms.
All properties solved by simple procedures.
Total runtime 92771 ms.

BK_STOP 1717369669900

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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