fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r571-tall-171734910300113
Last Updated
July 7, 2024

About the Execution of 2023-gold for FireWire-PT-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
488.191 27562.00 50522.00 335.80 FFFFFFFTFFFFFFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K 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 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.6K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K 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 86K 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-02-LTLFireability-00
FORMULA_NAME FireWire-PT-02-LTLFireability-01
FORMULA_NAME FireWire-PT-02-LTLFireability-02
FORMULA_NAME FireWire-PT-02-LTLFireability-03
FORMULA_NAME FireWire-PT-02-LTLFireability-04
FORMULA_NAME FireWire-PT-02-LTLFireability-05
FORMULA_NAME FireWire-PT-02-LTLFireability-06
FORMULA_NAME FireWire-PT-02-LTLFireability-07
FORMULA_NAME FireWire-PT-02-LTLFireability-08
FORMULA_NAME FireWire-PT-02-LTLFireability-09
FORMULA_NAME FireWire-PT-02-LTLFireability-10
FORMULA_NAME FireWire-PT-02-LTLFireability-11
FORMULA_NAME FireWire-PT-02-LTLFireability-12
FORMULA_NAME FireWire-PT-02-LTLFireability-13
FORMULA_NAME FireWire-PT-02-LTLFireability-14
FORMULA_NAME FireWire-PT-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717369077904

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-02
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 22:57:59] [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 22:57:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:57:59] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-06-02 22:57:59] [INFO ] Transformed 108 places.
[2024-06-02 22:57:59] [INFO ] Transformed 355 transitions.
[2024-06-02 22:57:59] [INFO ] Found NUPN structural information;
[2024-06-02 22:57:59] [INFO ] Parsed PT model containing 108 places and 355 transitions and 1311 arcs in 125 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 2 formulas.
Ensure Unique test removed 54 transitions
Reduce redundant transitions removed 54 transitions.
FORMULA FireWire-PT-02-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-02-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 301/301 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 105 transition count 294
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 105 transition count 294
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 105 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 104 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 104 transition count 290
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 104 transition count 284
Applied a total of 16 rules in 27 ms. Remains 104 /108 variables (removed 4) and now considering 284/301 (removed 17) transitions.
[2024-06-02 22:57:59] [INFO ] Flow matrix only has 258 transitions (discarded 26 similar events)
// Phase 1: matrix 258 rows 104 cols
[2024-06-02 22:57:59] [INFO ] Computed 8 invariants in 12 ms
[2024-06-02 22:58:00] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-06-02 22:58:00] [INFO ] Flow matrix only has 258 transitions (discarded 26 similar events)
[2024-06-02 22:58:00] [INFO ] Invariant cache hit.
[2024-06-02 22:58:00] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:58:00] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2024-06-02 22:58:00] [INFO ] Flow matrix only has 258 transitions (discarded 26 similar events)
[2024-06-02 22:58:00] [INFO ] Invariant cache hit.
[2024-06-02 22:58:00] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 104/108 places, 284/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 668 ms. Remains : 104/108 places, 284/301 transitions.
Support contains 41 out of 104 places after structural reductions.
[2024-06-02 22:58:00] [INFO ] Flatten gal took : 47 ms
[2024-06-02 22:58:00] [INFO ] Flatten gal took : 20 ms
[2024-06-02 22:58:00] [INFO ] Input system was already deterministic with 284 transitions.
Incomplete random walk after 10000 steps, including 586 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 34) seen :16
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 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 10 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 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 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 12 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 12 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 14 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 18) seen :2
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2024-06-02 22:58:01] [INFO ] Flow matrix only has 258 transitions (discarded 26 similar events)
[2024-06-02 22:58:01] [INFO ] Invariant cache hit.
[2024-06-02 22:58:01] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:58:01] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-06-02 22:58:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:58:01] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :15
[2024-06-02 22:58:01] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:58:01] [INFO ] After 178ms SMT Verify possible using 39 Read/Feed constraints in natural domain returned unsat :1 sat :15
[2024-06-02 22:58:02] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 4 ms to minimize.
[2024-06-02 22:58:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-06-02 22:58:02] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:58:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-06-02 22:58:02] [INFO ] After 566ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :15
Attempting to minimize the solution found.
Minimization took 171 ms.
[2024-06-02 22:58:02] [INFO ] After 1118ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :15
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 72 ms.
Support contains 21 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 284/284 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 104 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 103 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 103 transition count 279
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 102 transition count 279
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 2 with 6 rules applied. Total rules applied 13 place count 99 transition count 285
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 19 place count 99 transition count 279
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 99 transition count 276
Applied a total of 22 rules in 54 ms. Remains 99 /104 variables (removed 5) and now considering 276/284 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 99/104 places, 276/284 transitions.
Incomplete random walk after 10000 steps, including 582 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 38 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 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 19 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 11 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 21 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 3 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 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 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 5 ms. (steps per millisecond=200 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 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 17 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Probabilistic random walk after 1000001 steps, saw 208014 distinct states, run finished after 2538 ms. (steps per millisecond=394 ) properties seen :14
Running SMT prover for 1 properties.
[2024-06-02 22:58:05] [INFO ] Flow matrix only has 248 transitions (discarded 28 similar events)
// Phase 1: matrix 248 rows 99 cols
[2024-06-02 22:58:05] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 22:58:05] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 22:58:05] [INFO ] After 48ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 22:58:05] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:58:05] [INFO ] After 15ms SMT Verify possible using 40 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:58:05] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:58:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 22:58:05] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:58:05] [INFO ] After 23ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:58:05] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-06-02 22:58:05] [INFO ] After 141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 276/276 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 96 transition count 268
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 96 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 96 transition count 267
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 94 transition count 263
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 94 transition count 263
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 94 transition count 265
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 15 place count 93 transition count 263
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 93 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 92 transition count 260
Applied a total of 18 rules in 42 ms. Remains 92 /99 variables (removed 7) and now considering 260/276 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 92/99 places, 260/276 transitions.
Incomplete random walk after 10000 steps, including 683 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 180 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 216 steps, run visited all 1 properties in 3 ms. (steps per millisecond=72 )
Probabilistic random walk after 216 steps, saw 179 distinct states, run finished after 3 ms. (steps per millisecond=72 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
FORMULA FireWire-PT-02-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FireWire-PT-02-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 6 stabilizing places and 11 stable transitions
FORMULA FireWire-PT-02-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(G(p1))))||((p0||X(G(p1)))&&X(X(F(!p2))))))'
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 101 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 99 transition count 271
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 99 transition count 271
Applied a total of 11 rules in 6 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 22:58:06] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 99 cols
[2024-06-02 22:58:06] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:58:06] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 22:58:06] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 22:58:06] [INFO ] Invariant cache hit.
[2024-06-02 22:58:06] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 22:58:06] [INFO ] Implicit Places using invariants and state equation in 287 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 350 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/104 places, 271/284 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 361 ms. Remains : 98/104 places, 271/284 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 473 ms :[true, (AND p2 (NOT p0) (NOT p1)), (AND p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1)), p2, (NOT p1)]
Running random walk in product with property : FireWire-PT-02-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 2}], [{ cond=p2, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=3, aps=[p0:(AND (EQ s8 1) (EQ s97 1)), p2:(AND (EQ s8 1) (EQ s81 1)), p1:(AND (EQ s7 1) (EQ s51 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][false, false, 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-02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLFireability-00 finished in 890 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X(G((p1||F(p2)))))))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 101 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 99 transition count 271
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 99 transition count 271
Applied a total of 11 rules in 6 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 22:58:07] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 22:58:07] [INFO ] Invariant cache hit.
[2024-06-02 22:58:07] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 22:58:07] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 22:58:07] [INFO ] Invariant cache hit.
[2024-06-02 22:58:07] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 22:58:07] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-06-02 22:58:07] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 22:58:07] [INFO ] Invariant cache hit.
[2024-06-02 22:58:07] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/104 places, 271/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 392 ms. Remains : 99/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 324 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FireWire-PT-02-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(AND (EQ s8 1) (EQ s25 1)), p2:(AND (EQ s55 1) (EQ s61 1)), p0:(AND (EQ s5 1) (EQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLFireability-01 finished in 738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!((F(p0) U (X(p1)||!p1)) U X(p0))))'
Support contains 2 out of 104 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 101 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 99 transition count 271
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 99 transition count 271
Applied a total of 11 rules in 18 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 22:58:07] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 22:58:07] [INFO ] Invariant cache hit.
[2024-06-02 22:58:07] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 22:58:07] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 22:58:07] [INFO ] Invariant cache hit.
[2024-06-02 22:58:07] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 22:58:08] [INFO ] Implicit Places using invariants and state equation in 221 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 274 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/104 places, 271/284 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 294 ms. Remains : 98/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, p0, p0, p0]
Running random walk in product with property : FireWire-PT-02-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s57 1) (EQ s70 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]]
Product exploration explored 100000 steps with 1 reset in 140 ms.
Product exploration explored 100000 steps with 0 reset in 86 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, p0, p0, p0]
Incomplete random walk after 10000 steps, including 537 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1066644 steps, run visited all 1 properties in 1371 ms. (steps per millisecond=778 )
Probabilistic random walk after 1066644 steps, saw 195392 distinct states, run finished after 1372 ms. (steps per millisecond=777 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 122 ms :[true, p0, p0, p0]
Support contains 2 out of 98 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 271/271 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
[2024-06-02 22:58:10] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 98 cols
[2024-06-02 22:58:10] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:58:10] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 22:58:10] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 22:58:10] [INFO ] Invariant cache hit.
[2024-06-02 22:58:10] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 22:58:10] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-06-02 22:58:10] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 22:58:10] [INFO ] Invariant cache hit.
[2024-06-02 22:58:10] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 300 ms. Remains : 98/98 places, 271/271 transitions.
Computed a total of 5 stabilizing places and 11 stable transitions
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, p0, p0, p0]
Incomplete random walk after 10000 steps, including 537 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1066644 steps, run visited all 1 properties in 1395 ms. (steps per millisecond=764 )
Probabilistic random walk after 1066644 steps, saw 195392 distinct states, run finished after 1396 ms. (steps per millisecond=764 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 117 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 119 ms :[true, p0, p0, p0]
Product exploration explored 100000 steps with 0 reset in 81 ms.
Product exploration explored 100000 steps with 0 reset in 85 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 120 ms :[true, p0, p0, p0]
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 271/271 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 98 transition count 271
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 98 transition count 271
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 98 transition count 271
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 97 transition count 270
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 97 transition count 270
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 97 transition count 282
Deduced a syphon composed of 4 places in 0 ms
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 97 transition count 276
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 13 rules in 19 ms. Remains 97 /98 variables (removed 1) and now considering 276/271 (removed -5) transitions.
[2024-06-02 22:58:13] [INFO ] Redundant transitions in 12 ms returned []
[2024-06-02 22:58:13] [INFO ] Flow matrix only has 243 transitions (discarded 33 similar events)
// Phase 1: matrix 243 rows 97 cols
[2024-06-02 22:58:13] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:58:13] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/98 places, 276/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159 ms. Remains : 97/98 places, 276/271 transitions.
Built C files in :
/tmp/ltsmin9941998349768461368
[2024-06-02 22:58:13] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9941998349768461368
Running compilation step : cd /tmp/ltsmin9941998349768461368;'/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 457 ms.
Running link step : cd /tmp/ltsmin9941998349768461368;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9941998349768461368;'/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/stateBased7284074219081824858.hoa' '--buchi-type=spotba'
LTSmin run took 754 ms.
FORMULA FireWire-PT-02-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-02-LTLFireability-04 finished in 6911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1&&X(F((F(!p3)&&p2))))))'
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 101 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 99 transition count 271
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 99 transition count 271
Applied a total of 11 rules in 6 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 22:58:14] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 99 cols
[2024-06-02 22:58:14] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:58:14] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 22:58:14] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 22:58:14] [INFO ] Invariant cache hit.
[2024-06-02 22:58:14] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 22:58:15] [INFO ] Implicit Places using invariants and state equation in 248 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 308 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/104 places, 271/284 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 316 ms. Remains : 98/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p2) (NOT p1) p3), (NOT p0), (OR (NOT p2) p3), p3]
Running random walk in product with property : FireWire-PT-02-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND p2 p3), acceptance={} source=2 dest: 3}], [{ cond=p3, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s30 1), p0:(AND (EQ s8 1) (EQ s54 1)), p2:(AND (EQ s6 1) (EQ s53 1)), p3:(AND (EQ s6 1) (EQ s53 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-02-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLFireability-05 finished in 525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 102 transition count 279
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 102 transition count 279
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 102 transition count 278
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 101 transition count 276
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 101 transition count 276
Applied a total of 7 rules in 7 ms. Remains 101 /104 variables (removed 3) and now considering 276/284 (removed 8) transitions.
[2024-06-02 22:58:15] [INFO ] Flow matrix only has 250 transitions (discarded 26 similar events)
// Phase 1: matrix 250 rows 101 cols
[2024-06-02 22:58:15] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 22:58:15] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 22:58:15] [INFO ] Flow matrix only has 250 transitions (discarded 26 similar events)
[2024-06-02 22:58:15] [INFO ] Invariant cache hit.
[2024-06-02 22:58:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:58:15] [INFO ] Implicit Places using invariants and state equation in 209 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 274 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 100/104 places, 276/284 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 282 ms. Remains : 100/104 places, 276/284 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-02-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s9 0) (EQ s17 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 227 ms.
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-02-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-02-LTLFireability-07 finished in 811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0) U p1))||G(!p1)))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 101 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 99 transition count 271
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 99 transition count 271
Applied a total of 11 rules in 5 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 22:58:16] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 99 cols
[2024-06-02 22:58:16] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:58:16] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 22:58:16] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 22:58:16] [INFO ] Invariant cache hit.
[2024-06-02 22:58:16] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 22:58:16] [INFO ] Implicit Places using invariants and state equation in 238 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 302 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/104 places, 271/284 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 309 ms. Remains : 98/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 189 ms :[false, (NOT p1), false, (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : FireWire-PT-02-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}]], initial=0, aps=[p1:(EQ s13 1), p0:(AND (EQ s8 1) (EQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25032 reset in 161 ms.
Product exploration explored 100000 steps with 25023 reset in 176 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 141 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 275 ms :[(NOT p0), false, (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Finished random walk after 6637 steps, including 366 resets, run visited all 5 properties in 24 ms. (steps per millisecond=276 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND (NOT p0) p1)), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 218 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), false, (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), false, (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 271/271 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 97 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 96 transition count 269
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 96 transition count 268
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 95 transition count 268
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 2 with 4 rules applied. Total rules applied 8 place count 93 transition count 272
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 93 transition count 268
Applied a total of 12 rules in 22 ms. Remains 93 /98 variables (removed 5) and now considering 268/271 (removed 3) transitions.
[2024-06-02 22:58:18] [INFO ] Flow matrix only has 238 transitions (discarded 30 similar events)
// Phase 1: matrix 238 rows 93 cols
[2024-06-02 22:58:18] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:58:18] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 22:58:18] [INFO ] Flow matrix only has 238 transitions (discarded 30 similar events)
[2024-06-02 22:58:18] [INFO ] Invariant cache hit.
[2024-06-02 22:58:18] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 22:58:18] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-06-02 22:58:18] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 22:58:18] [INFO ] Flow matrix only has 238 transitions (discarded 30 similar events)
[2024-06-02 22:58:18] [INFO ] Invariant cache hit.
[2024-06-02 22:58:18] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/98 places, 268/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 275 ms. Remains : 93/98 places, 268/271 transitions.
Computed a total of 2 stabilizing places and 8 stable transitions
Computed a total of 2 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 94 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 266 ms :[(NOT p0), (AND (NOT p0) p1), false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), false]
Incomplete random walk after 10000 steps, including 587 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:58:18] [INFO ] Flow matrix only has 238 transitions (discarded 30 similar events)
[2024-06-02 22:58:18] [INFO ] Invariant cache hit.
[2024-06-02 22:58:18] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 22:58:18] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:58:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 22:58:18] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:58:18] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 22:58:18] [INFO ] After 23ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:58:18] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-06-02 22:58:18] [INFO ] After 157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 268/268 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 93 transition count 263
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 93 transition count 265
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 9 place count 92 transition count 263
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 92 transition count 261
Applied a total of 11 rules in 17 ms. Remains 92 /93 variables (removed 1) and now considering 261/268 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 92/93 places, 261/268 transitions.
Incomplete random walk after 10000 steps, including 659 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2349 steps, run visited all 1 properties in 8 ms. (steps per millisecond=293 )
Probabilistic random walk after 2349 steps, saw 1383 distinct states, run finished after 8 ms. (steps per millisecond=293 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 p0)), (F p0), (F (AND (NOT p1) p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 11 factoid took 245 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 280 ms :[(NOT p0), (AND (NOT p0) p1), false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), false]
Stuttering acceptance computed with spot in 252 ms :[(NOT p0), (AND (NOT p0) p1), false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), false]
Stuttering acceptance computed with spot in 250 ms :[(NOT p0), (AND (NOT p0) p1), false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), false]
Product exploration explored 100000 steps with 1 reset in 68 ms.
Stuttering criterion allowed to conclude after 34 steps with 1 reset in 0 ms.
FORMULA FireWire-PT-02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLFireability-08 finished in 4104 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&&((p1 U p2) U (G((p1 U p2))||(!p3&&(p1 U p2))))))))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 102 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 102 transition count 281
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 101 transition count 281
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 99 transition count 276
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 99 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 99 transition count 275
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 10 place count 98 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 98 transition count 273
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 3 with 6 rules applied. Total rules applied 17 place count 95 transition count 279
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 95 transition count 273
Applied a total of 23 rules in 26 ms. Remains 95 /104 variables (removed 9) and now considering 273/284 (removed 11) transitions.
[2024-06-02 22:58:20] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
// Phase 1: matrix 240 rows 95 cols
[2024-06-02 22:58:20] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:58:20] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 22:58:20] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
[2024-06-02 22:58:20] [INFO ] Invariant cache hit.
[2024-06-02 22:58:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:58:20] [INFO ] Implicit Places using invariants and state equation in 120 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 177 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/104 places, 273/284 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 209 ms. Remains : 94/104 places, 273/284 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : FireWire-PT-02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 2}, { cond=(OR (AND p0 p3 p2) (AND p0 p3 p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p3 p2) (AND p3 p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s6 0) (EQ s66 0)), p2:(AND (EQ s2 1) (EQ s73 1)), p1:(AND (EQ s6 1) (EQ s66 1)), p3:(AND (EQ s7 1) (EQ s67 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 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLFireability-10 finished in 429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 102 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 102 transition count 281
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 101 transition count 281
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 98 transition count 273
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 98 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 98 transition count 272
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 13 place count 96 transition count 268
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 96 transition count 268
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 3 with 6 rules applied. Total rules applied 21 place count 93 transition count 274
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 27 place count 93 transition count 268
Applied a total of 27 rules in 23 ms. Remains 93 /104 variables (removed 11) and now considering 268/284 (removed 16) transitions.
[2024-06-02 22:58:20] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
// Phase 1: matrix 235 rows 93 cols
[2024-06-02 22:58:20] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:58:20] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 22:58:20] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 22:58:20] [INFO ] Invariant cache hit.
[2024-06-02 22:58:20] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 22:58:20] [INFO ] Implicit Places using invariants and state equation in 219 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 276 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/104 places, 268/284 transitions.
Applied a total of 0 rules in 4 ms. Remains 92 /92 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 305 ms. Remains : 92/104 places, 268/284 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-02-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s48 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-02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLFireability-11 finished in 357 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 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 102 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 102 transition count 281
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 101 transition count 281
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 98 transition count 273
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 98 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 98 transition count 272
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 13 place count 96 transition count 268
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 96 transition count 268
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 3 with 6 rules applied. Total rules applied 21 place count 93 transition count 274
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 27 place count 93 transition count 268
Applied a total of 27 rules in 21 ms. Remains 93 /104 variables (removed 11) and now considering 268/284 (removed 16) transitions.
[2024-06-02 22:58:20] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 22:58:20] [INFO ] Invariant cache hit.
[2024-06-02 22:58:21] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-02 22:58:21] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 22:58:21] [INFO ] Invariant cache hit.
[2024-06-02 22:58:21] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 22:58:21] [INFO ] Implicit Places using invariants and state equation in 192 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 270 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/104 places, 268/284 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 296 ms. Remains : 92/104 places, 268/284 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-02-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 s3 1) (EQ s64 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-02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLFireability-12 finished in 343 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(F((G(F(p1))&&p0)))))'
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 101 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 99 transition count 271
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 99 transition count 271
Applied a total of 11 rules in 6 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 22:58:21] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 99 cols
[2024-06-02 22:58:21] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:58:21] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 22:58:21] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 22:58:21] [INFO ] Invariant cache hit.
[2024-06-02 22:58:21] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 22:58:21] [INFO ] Implicit Places using invariants and state equation in 189 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 252 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/104 places, 271/284 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 261 ms. Remains : 98/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : FireWire-PT-02-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s14 1) (EQ s24 1)), p0:(AND (EQ s58 1) (EQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-02-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLFireability-14 finished in 495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&(F(p1)||X(p2)))))'
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 101 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 99 transition count 271
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 99 transition count 271
Applied a total of 11 rules in 3 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 22:58:21] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 22:58:21] [INFO ] Invariant cache hit.
[2024-06-02 22:58:21] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 22:58:21] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 22:58:21] [INFO ] Invariant cache hit.
[2024-06-02 22:58:21] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 22:58:22] [INFO ] Implicit Places using invariants and state equation in 224 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 279 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/104 places, 271/284 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 284 ms. Remains : 98/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-02-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s49 0), p0:(AND (OR (EQ s6 0) (EQ s82 0)) (OR (EQ s10 0) (EQ s23 0))), p2:(AND (EQ s6 1) (EQ s82 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 59 ms.
Product exploration explored 100000 steps with 1 reset in 58 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 519 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2482 steps, run visited all 1 properties in 7 ms. (steps per millisecond=354 )
Probabilistic random walk after 2482 steps, saw 1168 distinct states, run finished after 7 ms. (steps per millisecond=354 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Support contains 4 out of 98 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 271/271 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 97 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 96 transition count 269
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 96 transition count 268
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 95 transition count 268
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 2 with 6 rules applied. Total rules applied 10 place count 92 transition count 274
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 92 transition count 268
Applied a total of 16 rules in 16 ms. Remains 92 /98 variables (removed 6) and now considering 268/271 (removed 3) transitions.
[2024-06-02 22:58:22] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
// Phase 1: matrix 235 rows 92 cols
[2024-06-02 22:58:22] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:58:22] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 22:58:22] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 22:58:22] [INFO ] Invariant cache hit.
[2024-06-02 22:58:22] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 22:58:22] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-06-02 22:58:22] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 22:58:22] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 22:58:22] [INFO ] Invariant cache hit.
[2024-06-02 22:58:23] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/98 places, 268/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 363 ms. Remains : 92/98 places, 268/271 transitions.
Computed a total of 2 stabilizing places and 8 stable transitions
Computed a total of 2 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 659 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10366 steps, run visited all 1 properties in 17 ms. (steps per millisecond=609 )
Probabilistic random walk after 10366 steps, saw 5170 distinct states, run finished after 17 ms. (steps per millisecond=609 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2 reset in 60 ms.
Product exploration explored 100000 steps with 0 reset in 62 ms.
Built C files in :
/tmp/ltsmin18156563555043903417
[2024-06-02 22:58:23] [INFO ] Computing symmetric may disable matrix : 268 transitions.
[2024-06-02 22:58:23] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:58:23] [INFO ] Computing symmetric may enable matrix : 268 transitions.
[2024-06-02 22:58:23] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:58:23] [INFO ] Computing Do-Not-Accords matrix : 268 transitions.
[2024-06-02 22:58:23] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:58:23] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18156563555043903417
Running compilation step : cd /tmp/ltsmin18156563555043903417;'/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 484 ms.
Running link step : cd /tmp/ltsmin18156563555043903417;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin18156563555043903417;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased677754716776810860.hoa' '--buchi-type=spotba'
LTSmin run took 387 ms.
FORMULA FireWire-PT-02-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-02-LTLFireability-15 finished in 2713 ms.
All properties solved by simple procedures.
Total runtime 25084 ms.

BK_STOP 1717369105466

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-02"
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-02, 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-171734910300113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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