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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 22:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 11 22:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 22:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 22:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 46K May 18 16:42 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 GPUForwardProgress-PT-08b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716554104421

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=GPUForwardProgress-PT-08b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 12:35:05] [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-05-24 12:35:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 12:35:05] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2024-05-24 12:35:05] [INFO ] Transformed 188 places.
[2024-05-24 12:35:05] [INFO ] Transformed 197 transitions.
[2024-05-24 12:35:05] [INFO ] Found NUPN structural information;
[2024-05-24 12:35:05] [INFO ] Parsed PT model containing 188 places and 197 transitions and 477 arcs in 107 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 197/197 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 197
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 171 transition count 181
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 171 transition count 181
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 41 place count 163 transition count 173
Iterating global reduction 1 with 8 rules applied. Total rules applied 49 place count 163 transition count 173
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 55 place count 163 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 162 transition count 166
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 162 transition count 166
Applied a total of 57 rules in 43 ms. Remains 162 /188 variables (removed 26) and now considering 166/197 (removed 31) transitions.
// Phase 1: matrix 166 rows 162 cols
[2024-05-24 12:35:06] [INFO ] Computed 9 invariants in 16 ms
[2024-05-24 12:35:06] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-24 12:35:06] [INFO ] Invariant cache hit.
[2024-05-24 12:35:06] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2024-05-24 12:35:06] [INFO ] Invariant cache hit.
[2024-05-24 12:35:06] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 162/188 places, 166/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 488 ms. Remains : 162/188 places, 166/197 transitions.
Support contains 37 out of 162 places after structural reductions.
[2024-05-24 12:35:07] [INFO ] Flatten gal took : 32 ms
[2024-05-24 12:35:07] [INFO ] Flatten gal took : 13 ms
[2024-05-24 12:35:07] [INFO ] Input system was already deterministic with 166 transitions.
Support contains 36 out of 162 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 127 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 32) seen :27
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2024-05-24 12:35:07] [INFO ] Invariant cache hit.
[2024-05-24 12:35:07] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 8 ms returned sat
[2024-05-24 12:35:07] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 12:35:07] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 3 ms returned sat
[2024-05-24 12:35:07] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 12:35:07] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-24 12:35:08] [INFO ] After 188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 77 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=38 )
Parikh walk visited 2 properties in 7 ms.
Computed a total of 30 stabilizing places and 30 stable transitions
Graph (complete) has 247 edges and 162 vertex of which 150 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.5 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' '!(((p0||G(p1)) U (X(F(p3))&&p2)))'
Support contains 6 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 166/166 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 155 transition count 159
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 155 transition count 159
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 153 transition count 157
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 153 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 153 transition count 156
Applied a total of 19 rules in 11 ms. Remains 153 /162 variables (removed 9) and now considering 156/166 (removed 10) transitions.
// Phase 1: matrix 156 rows 153 cols
[2024-05-24 12:35:08] [INFO ] Computed 9 invariants in 5 ms
[2024-05-24 12:35:08] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-24 12:35:08] [INFO ] Invariant cache hit.
[2024-05-24 12:35:08] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-05-24 12:35:08] [INFO ] Invariant cache hit.
[2024-05-24 12:35:08] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/162 places, 156/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 237 ms. Remains : 153/162 places, 156/166 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 261 ms :[(OR (NOT p2) (NOT p3)), true, (NOT p1), (NOT p3)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=0 dest: 2}, { cond=p2, acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s109 1) (EQ s140 1) (EQ s151 1)), p0:(EQ s92 1), p1:(NEQ s16 1), p3:(EQ s62 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1434 steps with 15 reset in 16 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-00 finished in 562 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&X(p1)))&&F(p2))))'
Support contains 5 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 166/166 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 155 transition count 159
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 155 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 155 transition count 158
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 153 transition count 156
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 153 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 153 transition count 155
Applied a total of 20 rules in 10 ms. Remains 153 /162 variables (removed 9) and now considering 155/166 (removed 11) transitions.
// Phase 1: matrix 155 rows 153 cols
[2024-05-24 12:35:08] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 12:35:09] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 12:35:09] [INFO ] Invariant cache hit.
[2024-05-24 12:35:09] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-05-24 12:35:09] [INFO ] Invariant cache hit.
[2024-05-24 12:35:09] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/162 places, 155/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 153/162 places, 155/166 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s104 0) (EQ s140 0) (EQ s151 0)), p2:(EQ s64 1), p1:(EQ s133 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3154 reset in 248 ms.
Product exploration explored 100000 steps with 3284 reset in 166 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Graph (complete) has 236 edges and 153 vertex of which 141 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Computed a total of 27 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 120 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 12:35:10] [INFO ] Invariant cache hit.
[2024-05-24 12:35:10] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 12:35:10] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 4 ms returned sat
[2024-05-24 12:35:10] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p0)), (F p2)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 193 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
[2024-05-24 12:35:10] [INFO ] Invariant cache hit.
[2024-05-24 12:35:11] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-24 12:35:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:35:11] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-24 12:35:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:35:11] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 3 ms returned sat
[2024-05-24 12:35:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:35:11] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-24 12:35:11] [INFO ] Computed and/alt/rep : 154/254/154 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-24 12:35:11] [INFO ] Added : 147 causal constraints over 30 iterations in 388 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 155/155 transitions.
Graph (trivial) has 120 edges and 153 vertex of which 6 / 153 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 230 edges and 148 vertex of which 136 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 135 transition count 82
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 128 place count 72 transition count 82
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 128 place count 72 transition count 63
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 166 place count 53 transition count 63
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 172 place count 47 transition count 57
Iterating global reduction 2 with 6 rules applied. Total rules applied 178 place count 47 transition count 57
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 226 place count 23 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 227 place count 23 transition count 32
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 233 place count 17 transition count 21
Iterating global reduction 3 with 6 rules applied. Total rules applied 239 place count 17 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 243 place count 15 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 244 place count 14 transition count 19
Applied a total of 244 rules in 24 ms. Remains 14 /153 variables (removed 139) and now considering 19/155 (removed 136) transitions.
[2024-05-24 12:35:11] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
// Phase 1: matrix 18 rows 14 cols
[2024-05-24 12:35:11] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 12:35:11] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 12:35:11] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
[2024-05-24 12:35:11] [INFO ] Invariant cache hit.
[2024-05-24 12:35:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:35:11] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-24 12:35:11] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-24 12:35:11] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
[2024-05-24 12:35:11] [INFO ] Invariant cache hit.
[2024-05-24 12:35:11] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/153 places, 19/155 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 14/153 places, 19/155 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND p1 p0 p2)), (X (NOT (AND p1 p0 p2))), (X (NOT p2)), (X p2), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 5 factoid took 501 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter insensitive) to 6 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Finished random walk after 8 steps, including 0 resets, run visited all 6 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND p1 p0 p2)), (X (NOT (AND p1 p0 p2))), (X (NOT p2)), (X p2), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT p2))), (X (X p2)), (F (AND p2 p0 p1)), (F (NOT (AND (NOT p2) p0 p1))), (F (NOT p1)), (F (NOT p0)), (F (AND p0 (NOT p1))), (F p2)]
Knowledge based reduction with 5 factoid took 608 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter insensitive) to 6 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
[2024-05-24 12:35:13] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
[2024-05-24 12:35:13] [INFO ] Invariant cache hit.
[2024-05-24 12:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:35:13] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-24 12:35:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:35:13] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 12:35:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:35:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:35:13] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-24 12:35:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 12:35:13] [INFO ] Computed and/alt/rep : 16/53/15 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 12:35:13] [INFO ] Added : 9 causal constraints over 3 iterations in 11 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Stuttering criterion allowed to conclude after 7 steps with 1 reset in 0 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-01 finished in 4871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 2 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 166/166 transitions.
Graph (complete) has 247 edges and 162 vertex of which 150 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 149 transition count 87
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 81 rules applied. Total rules applied 157 place count 74 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 160 place count 71 transition count 81
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 160 place count 71 transition count 63
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 196 place count 53 transition count 63
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 203 place count 46 transition count 56
Iterating global reduction 3 with 7 rules applied. Total rules applied 210 place count 46 transition count 56
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 264 place count 19 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 265 place count 19 transition count 28
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 272 place count 12 transition count 15
Iterating global reduction 4 with 7 rules applied. Total rules applied 279 place count 12 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 283 place count 10 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 284 place count 9 transition count 15
Applied a total of 284 rules in 21 ms. Remains 9 /162 variables (removed 153) and now considering 15/166 (removed 151) transitions.
// Phase 1: matrix 15 rows 9 cols
[2024-05-24 12:35:13] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 12:35:13] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-24 12:35:13] [INFO ] Invariant cache hit.
[2024-05-24 12:35:13] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-24 12:35:13] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-24 12:35:13] [INFO ] Invariant cache hit.
[2024-05-24 12:35:13] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/162 places, 15/166 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 9/162 places, 15/166 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s0 0), p1:(EQ s5 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7901 reset in 127 ms.
Product exploration explored 100000 steps with 7746 reset in 126 ms.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 95 steps, including 6 resets, run visited all 2 properties in 3 ms. (steps per millisecond=31 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-05-24 12:35:14] [INFO ] Invariant cache hit.
[2024-05-24 12:35:14] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 12:35:14] [INFO ] Invariant cache hit.
[2024-05-24 12:35:14] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-24 12:35:14] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-24 12:35:14] [INFO ] Invariant cache hit.
[2024-05-24 12:35:14] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 9/9 places, 15/15 transitions.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 73 steps, including 3 resets, run visited all 2 properties in 2 ms. (steps per millisecond=36 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7942 reset in 88 ms.
Product exploration explored 100000 steps with 7980 reset in 190 ms.
Built C files in :
/tmp/ltsmin17106520190603655177
[2024-05-24 12:35:15] [INFO ] Computing symmetric may disable matrix : 15 transitions.
[2024-05-24 12:35:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:35:15] [INFO ] Computing symmetric may enable matrix : 15 transitions.
[2024-05-24 12:35:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:35:15] [INFO ] Computing Do-Not-Accords matrix : 15 transitions.
[2024-05-24 12:35:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:35:15] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17106520190603655177
Running compilation step : cd /tmp/ltsmin17106520190603655177;'/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 176 ms.
Running link step : cd /tmp/ltsmin17106520190603655177;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin17106520190603655177;'/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/stateBased2887073679238495527.hoa' '--buchi-type=spotba'
LTSmin run took 81 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-02 finished in 2298 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&&(p1||X(p1))))))'
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 166/166 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 155 transition count 159
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 155 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 155 transition count 158
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 153 transition count 156
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 153 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 153 transition count 155
Applied a total of 20 rules in 15 ms. Remains 153 /162 variables (removed 9) and now considering 155/166 (removed 11) transitions.
// Phase 1: matrix 155 rows 153 cols
[2024-05-24 12:35:16] [INFO ] Computed 9 invariants in 9 ms
[2024-05-24 12:35:16] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-24 12:35:16] [INFO ] Invariant cache hit.
[2024-05-24 12:35:16] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-05-24 12:35:16] [INFO ] Invariant cache hit.
[2024-05-24 12:35:16] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/162 places, 155/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 209 ms. Remains : 153/162 places, 155/166 transitions.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s42 1), p1:(AND (EQ s131 1) (EQ s144 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 73 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-03 finished in 292 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(p1))&&((X(!p1)||X(p2)) U p3))))'
Support contains 6 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 166/166 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 155 transition count 159
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 155 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 155 transition count 158
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 154 transition count 157
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 154 transition count 157
Applied a total of 17 rules in 13 ms. Remains 154 /162 variables (removed 8) and now considering 157/166 (removed 9) transitions.
// Phase 1: matrix 157 rows 154 cols
[2024-05-24 12:35:16] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 12:35:16] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-24 12:35:16] [INFO ] Invariant cache hit.
[2024-05-24 12:35:16] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-24 12:35:16] [INFO ] Invariant cache hit.
[2024-05-24 12:35:16] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/162 places, 157/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 192 ms. Remains : 154/162 places, 157/166 transitions.
Stuttering acceptance computed with spot in 664 ms :[(OR (NOT p3) (NOT p1)), (OR (NOT p1) (NOT p3)), (NOT p1), (OR (NOT p3) (AND p1 (NOT p2))), (NOT p1), true, (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p3), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND p2 (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s110 1) (EQ s141 1) (EQ s152 1)), p3:(EQ s64 1), p1:(NEQ s32 1), p2:(EQ s123 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, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 1 reset in 0 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-06 finished in 879 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(p1)||p0)))'
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 166/166 transitions.
Graph (trivial) has 133 edges and 162 vertex of which 6 / 162 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 241 edges and 157 vertex of which 145 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 144 transition count 85
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 74 rules applied. Total rules applied 147 place count 73 transition count 82
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 149 place count 72 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 150 place count 71 transition count 81
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 150 place count 71 transition count 64
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 184 place count 54 transition count 64
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 191 place count 47 transition count 57
Iterating global reduction 4 with 7 rules applied. Total rules applied 198 place count 47 transition count 57
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 250 place count 21 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 251 place count 21 transition count 30
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 258 place count 14 transition count 17
Iterating global reduction 5 with 7 rules applied. Total rules applied 265 place count 14 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 267 place count 13 transition count 16
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 268 place count 13 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 269 place count 12 transition count 15
Applied a total of 269 rules in 20 ms. Remains 12 /162 variables (removed 150) and now considering 15/166 (removed 151) transitions.
// Phase 1: matrix 15 rows 12 cols
[2024-05-24 12:35:17] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:35:17] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 12:35:17] [INFO ] Invariant cache hit.
[2024-05-24 12:35:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:35:17] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-24 12:35:17] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-24 12:35:17] [INFO ] Invariant cache hit.
[2024-05-24 12:35:17] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/162 places, 15/166 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100 ms. Remains : 12/162 places, 15/166 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s4 1), p0:(OR (EQ s3 1) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 4 reset in 0 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-07 finished in 155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0) U ((p1&&X(!p0))||X(G(!p0)))) U (G((X(!p0) U ((p1&&X(!p0))||X(G(!p0)))))||((p2 U (p3||G(p2)))&&(X(!p0) U ((p1&&X(!p0))||X(G(!p0))))))))'
Support contains 7 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 166/166 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 155 transition count 159
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 155 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 155 transition count 158
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 153 transition count 156
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 153 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 153 transition count 155
Applied a total of 20 rules in 18 ms. Remains 153 /162 variables (removed 9) and now considering 155/166 (removed 11) transitions.
// Phase 1: matrix 155 rows 153 cols
[2024-05-24 12:35:17] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 12:35:17] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-24 12:35:17] [INFO ] Invariant cache hit.
[2024-05-24 12:35:17] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-24 12:35:17] [INFO ] Invariant cache hit.
[2024-05-24 12:35:17] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/162 places, 155/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 248 ms. Remains : 153/162 places, 155/166 transitions.
Stuttering acceptance computed with spot in 238 ms :[p0, p0, p0, (AND p0 (NOT p2) (NOT p3)), true, (AND (NOT p3) (NOT p2) p0), (AND (NOT p3) (NOT p2) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(AND (NEQ s6 1) (NEQ s12 1)), p2:(NEQ s12 1), p1:(NEQ s19 1), p0:(AND (EQ s50 1) (EQ s105 1) (EQ s140 1) (EQ s151 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 156 ms.
Product exploration explored 100000 steps with 50000 reset in 161 ms.
Computed a total of 28 stabilizing places and 28 stable transitions
Graph (complete) has 236 edges and 153 vertex of which 141 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Computed a total of 28 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p3 p2 p1 (NOT p0)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p0)), true, (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 17 ms. Reduced automaton from 7 states, 18 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-08b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-09 finished in 845 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(p0)||F(p1))) U p0)))'
Support contains 3 out of 162 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 166/166 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 154 transition count 158
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 154 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 154 transition count 157
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 152 transition count 155
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 152 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 152 transition count 154
Applied a total of 22 rules in 6 ms. Remains 152 /162 variables (removed 10) and now considering 154/166 (removed 12) transitions.
// Phase 1: matrix 154 rows 152 cols
[2024-05-24 12:35:18] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 12:35:18] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-24 12:35:18] [INFO ] Invariant cache hit.
[2024-05-24 12:35:18] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-24 12:35:18] [INFO ] Invariant cache hit.
[2024-05-24 12:35:18] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 152/162 places, 154/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 211 ms. Remains : 152/162 places, 154/166 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s59 1) (EQ s139 1) (EQ s150 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][false, false]]
Stuttering criterion allowed to conclude after 73 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-10 finished in 288 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||G(p1))))'
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 166/166 transitions.
Graph (trivial) has 133 edges and 162 vertex of which 6 / 162 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 241 edges and 157 vertex of which 145 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 144 transition count 85
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 74 rules applied. Total rules applied 147 place count 73 transition count 82
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 149 place count 72 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 150 place count 71 transition count 81
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 150 place count 71 transition count 64
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 184 place count 54 transition count 64
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 191 place count 47 transition count 57
Iterating global reduction 4 with 7 rules applied. Total rules applied 198 place count 47 transition count 57
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 250 place count 21 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 251 place count 21 transition count 30
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 256 place count 16 transition count 21
Iterating global reduction 5 with 5 rules applied. Total rules applied 261 place count 16 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 15 transition count 20
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 265 place count 15 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 266 place count 14 transition count 19
Applied a total of 266 rules in 18 ms. Remains 14 /162 variables (removed 148) and now considering 19/166 (removed 147) transitions.
[2024-05-24 12:35:18] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
// Phase 1: matrix 17 rows 14 cols
[2024-05-24 12:35:18] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:35:18] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 12:35:18] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
[2024-05-24 12:35:18] [INFO ] Invariant cache hit.
[2024-05-24 12:35:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:35:18] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-24 12:35:18] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-24 12:35:18] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
[2024-05-24 12:35:18] [INFO ] Invariant cache hit.
[2024-05-24 12:35:18] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/162 places, 19/166 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 14/162 places, 19/166 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(NEQ s6 1), p0:(AND (EQ s9 1) (EQ s2 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 15 steps with 2 reset in 0 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-11 finished in 157 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 166/166 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 156 transition count 160
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 156 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 156 transition count 159
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 154 transition count 157
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 154 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 154 transition count 156
Applied a total of 18 rules in 9 ms. Remains 154 /162 variables (removed 8) and now considering 156/166 (removed 10) transitions.
// Phase 1: matrix 156 rows 154 cols
[2024-05-24 12:35:18] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 12:35:18] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-24 12:35:18] [INFO ] Invariant cache hit.
[2024-05-24 12:35:18] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-05-24 12:35:18] [INFO ] Invariant cache hit.
[2024-05-24 12:35:18] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/162 places, 156/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 154/162 places, 156/166 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s148 1) (EQ s90 1)), p0:(NEQ s113 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-12 finished in 314 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||G((F(p1)&&F(G(p2)))))))'
Support contains 5 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 166/166 transitions.
Graph (trivial) has 128 edges and 162 vertex of which 6 / 162 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 241 edges and 157 vertex of which 145 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.5 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 144 transition count 91
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 135 place count 79 transition count 88
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 139 place count 78 transition count 85
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 142 place count 75 transition count 85
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 142 place count 75 transition count 66
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 180 place count 56 transition count 66
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 188 place count 48 transition count 58
Iterating global reduction 4 with 8 rules applied. Total rules applied 196 place count 48 transition count 58
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 244 place count 24 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 245 place count 24 transition count 33
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 250 place count 19 transition count 24
Iterating global reduction 5 with 5 rules applied. Total rules applied 255 place count 19 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 259 place count 17 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 260 place count 16 transition count 22
Applied a total of 260 rules in 17 ms. Remains 16 /162 variables (removed 146) and now considering 22/166 (removed 144) transitions.
[2024-05-24 12:35:19] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
// Phase 1: matrix 21 rows 16 cols
[2024-05-24 12:35:19] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 12:35:19] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 12:35:19] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
[2024-05-24 12:35:19] [INFO ] Invariant cache hit.
[2024-05-24 12:35:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:35:19] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-24 12:35:19] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-24 12:35:19] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
[2024-05-24 12:35:19] [INFO ] Invariant cache hit.
[2024-05-24 12:35:19] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/162 places, 22/166 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 16/162 places, 22/166 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (AND p0 (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s1 1), p1:(AND (EQ s1 1) (EQ s10 1)), p2:(AND (EQ s6 1) (EQ s13 1) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-13 finished in 216 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' '!(((p0 U X(X(p0))) U G((G(p1) U X(!p0)))))'
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 166/166 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 154 transition count 158
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 154 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 154 transition count 157
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 152 transition count 155
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 152 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 152 transition count 154
Applied a total of 22 rules in 5 ms. Remains 152 /162 variables (removed 10) and now considering 154/166 (removed 12) transitions.
// Phase 1: matrix 154 rows 152 cols
[2024-05-24 12:35:19] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 12:35:19] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 12:35:19] [INFO ] Invariant cache hit.
[2024-05-24 12:35:19] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-24 12:35:19] [INFO ] Invariant cache hit.
[2024-05-24 12:35:19] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 152/162 places, 154/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184 ms. Remains : 152/162 places, 154/166 transitions.
Stuttering acceptance computed with spot in 978 ms :[p0, false, p0, false, false, false, (AND (NOT p1) p0), p0, false, (NOT p0), true, false, (NOT p0), (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0)), p0, p0, (AND (NOT p1) p0), p0, (NOT p0), (NOT p1), false, (AND (NOT p0) (NOT p1)), false, (AND p0 (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 5}, { cond=p1, acceptance={1} source=0 dest: 6}, { cond=p1, acceptance={0, 1} source=0 dest: 7}, { cond=(AND p1 p0), acceptance={} source=0 dest: 8}], [{ cond=p0, acceptance={} source=1 dest: 9}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND p1 p0), acceptance={1} source=2 dest: 6}, { cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 7}, { cond=(AND p1 p0), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 11}], [{ cond=p0, acceptance={} source=4 dest: 12}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 9}, { cond=(AND p1 p0), acceptance={} source=5 dest: 13}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=6 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 4}, { cond=(AND p1 p0), acceptance={1} source=6 dest: 6}, { cond=(AND p1 p0), acceptance={} source=6 dest: 8}, { cond=(AND p1 p0), acceptance={} source=6 dest: 14}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=7 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 4}, { cond=(AND p1 p0), acceptance={1} source=7 dest: 6}, { cond=(AND p1 p0), acceptance={0, 1} source=7 dest: 7}, { cond=(AND p1 p0), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 12}, { cond=(AND p1 p0), acceptance={} source=8 dest: 15}], [{ cond=(NOT p0), acceptance={} source=9 dest: 10}], [{ cond=true, acceptance={0, 1} source=10 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=11 dest: 16}, { cond=(NOT p0), acceptance={} source=11 dest: 17}, { cond=(AND p1 (NOT p0)), acceptance={} source=11 dest: 18}, { cond=(AND p1 (NOT p0)), acceptance={} source=11 dest: 19}], [{ cond=(NOT p0), acceptance={} source=12 dest: 20}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=13 dest: 10}, { cond=(AND p1 (NOT p0)), acceptance={} source=13 dest: 21}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=14 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=14 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=14 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=14 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=14 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={1} source=14 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=14 dest: 14}, { cond=(AND p1 (NOT p0)), acceptance={} source=14 dest: 22}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=15 dest: 20}, { cond=(AND p1 (NOT p0)), acceptance={} source=15 dest: 23}], [{ cond=p0, acceptance={} source=16 dest: 10}], [{ cond=(NOT p1), acceptance={} source=17 dest: 16}, { cond=true, acceptance={} source=17 dest: 17}, { cond=p1, acceptance={} source=17 dest: 18}, { cond=p1, acceptance={} source=17 dest: 19}], [{ cond=(AND (NOT p1) p0), acceptance={} source=18 dest: 10}, { cond=(AND p1 p0), acceptance={} source=18 dest: 21}], [{ cond=(AND (NOT p1) p0), acceptance={} source=19 dest: 16}, { cond=(AND p1 p0), acceptance={} source=19 dest: 18}, { cond=(AND p1 p0), acceptance={0, 1} source=19 dest: 19}], [{ cond=(NOT p0), acceptance={} source=20 dest: 9}], [{ cond=(NOT p1), acceptance={} source=21 dest: 10}, { cond=p1, acceptance={} source=21 dest: 21}], [{ cond=(NOT p1), acceptance={} source=22 dest: 11}, { cond=p1, acceptance={} source=22 dest: 24}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=23 dest: 9}, { cond=(AND p1 (NOT p0)), acceptance={} source=23 dest: 13}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=24 dest: 16}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=24 dest: 17}, { cond=(AND p1 (NOT p0)), acceptance={} source=24 dest: 18}, { cond=(AND p1 (NOT p0)), acceptance={} source=24 dest: 25}], [{ cond=(NOT p1), acceptance={} source=25 dest: 16}, { cond=(NOT p1), acceptance={} source=25 dest: 17}, { cond=p1, acceptance={} source=25 dest: 18}, { cond=p1, acceptance={} source=25 dest: 25}]], initial=0, aps=[p1:(OR (EQ s137 1) (EQ s145 1)), p0:(EQ s77 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 30141 reset in 128 ms.
Product exploration explored 100000 steps with 30002 reset in 136 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Graph (complete) has 235 edges and 152 vertex of which 140 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Computed a total of 27 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), true, (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 145 ms. Reduced automaton from 26 states, 77 edges and 2 AP (stutter sensitive) to 13 states, 48 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 448 ms :[p0, (NOT p0), p0, (AND (NOT p1) p0), p0, true, (AND (NOT p1) (NOT p0)), false, (AND p1 p0), p0, (NOT p1), (AND (NOT p1) p0), false]
Incomplete random walk after 10000 steps, including 125 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :6
Finished Best-First random walk after 2101 steps, including 4 resets, run visited all 1 properties in 4 ms. (steps per millisecond=525 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), true, (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p1 p0)), (F p1), (F (AND p1 (NOT p0))), (F p0), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 (NOT p0))))
Knowledge based reduction with 11 factoid took 260 ms. Reduced automaton from 13 states, 48 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-08b-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-14 finished in 2429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 166/166 transitions.
Graph (trivial) has 133 edges and 162 vertex of which 6 / 162 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 241 edges and 157 vertex of which 145 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 144 transition count 85
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 74 rules applied. Total rules applied 147 place count 73 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 148 place count 72 transition count 82
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 148 place count 72 transition count 63
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 186 place count 53 transition count 63
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 194 place count 45 transition count 55
Iterating global reduction 3 with 8 rules applied. Total rules applied 202 place count 45 transition count 55
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 252 place count 20 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 253 place count 20 transition count 29
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 260 place count 13 transition count 16
Iterating global reduction 4 with 7 rules applied. Total rules applied 267 place count 13 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 271 place count 11 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 272 place count 10 transition count 14
Applied a total of 272 rules in 19 ms. Remains 10 /162 variables (removed 152) and now considering 14/166 (removed 152) transitions.
[2024-05-24 12:35:21] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 10 cols
[2024-05-24 12:35:21] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 12:35:21] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 12:35:21] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2024-05-24 12:35:21] [INFO ] Invariant cache hit.
[2024-05-24 12:35:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:35:21] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-24 12:35:21] [INFO ] Redundant transitions in 31 ms returned []
[2024-05-24 12:35:21] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2024-05-24 12:35:21] [INFO ] Invariant cache hit.
[2024-05-24 12:35:21] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/162 places, 14/166 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137 ms. Remains : 10/162 places, 14/166 transitions.
Stuttering acceptance computed with spot in 390 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s7 1) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-15 finished in 539 ms.
All properties solved by simple procedures.
Total runtime 16394 ms.

BK_STOP 1716554125630

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-08b"
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 GPUForwardProgress-PT-08b, 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 r197-tall-171640625300308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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