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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 01:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 12 01:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 01:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 01:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 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 61K 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 DiscoveryGPU-PT-08b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716421064858

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=DiscoveryGPU-PT-08b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 23:37:46] [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-22 23:37:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:37:46] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2024-05-22 23:37:46] [INFO ] Transformed 240 places.
[2024-05-22 23:37:46] [INFO ] Transformed 254 transitions.
[2024-05-22 23:37:46] [INFO ] Found NUPN structural information;
[2024-05-22 23:37:46] [INFO ] Parsed PT model containing 240 places and 254 transitions and 661 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 254/254 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 224 transition count 254
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 51 place count 189 transition count 219
Iterating global reduction 1 with 35 rules applied. Total rules applied 86 place count 189 transition count 219
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 181 transition count 211
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 181 transition count 211
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 107 place count 176 transition count 206
Iterating global reduction 1 with 5 rules applied. Total rules applied 112 place count 176 transition count 206
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 116 place count 172 transition count 202
Iterating global reduction 1 with 4 rules applied. Total rules applied 120 place count 172 transition count 202
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 170 transition count 198
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 170 transition count 198
Applied a total of 124 rules in 61 ms. Remains 170 /240 variables (removed 70) and now considering 198/254 (removed 56) transitions.
// Phase 1: matrix 198 rows 170 cols
[2024-05-22 23:37:47] [INFO ] Computed 2 invariants in 13 ms
[2024-05-22 23:37:47] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-22 23:37:47] [INFO ] Invariant cache hit.
[2024-05-22 23:37:47] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
[2024-05-22 23:37:47] [INFO ] Invariant cache hit.
[2024-05-22 23:37:47] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 170/240 places, 198/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 750 ms. Remains : 170/240 places, 198/254 transitions.
Support contains 35 out of 170 places after structural reductions.
[2024-05-22 23:37:47] [INFO ] Flatten gal took : 40 ms
[2024-05-22 23:37:47] [INFO ] Flatten gal took : 15 ms
[2024-05-22 23:37:47] [INFO ] Input system was already deterministic with 198 transitions.
Support contains 34 out of 170 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 32) seen :31
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:37:47] [INFO ] Invariant cache hit.
[2024-05-22 23:37:47] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 28 stabilizing places and 28 stable transitions
Graph (complete) has 331 edges and 170 vertex of which 167 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)&&(p1||F(p2)))))))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 160 transition count 188
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 188
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 155 transition count 182
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 155 transition count 182
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 152 transition count 178
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 152 transition count 178
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 149 transition count 175
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 149 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 147 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 147 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 146 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 146 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 145 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 145 transition count 170
Applied a total of 50 rules in 23 ms. Remains 145 /170 variables (removed 25) and now considering 170/198 (removed 28) transitions.
// Phase 1: matrix 170 rows 145 cols
[2024-05-22 23:37:48] [INFO ] Computed 2 invariants in 6 ms
[2024-05-22 23:37:48] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-22 23:37:48] [INFO ] Invariant cache hit.
[2024-05-22 23:37:48] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-05-22 23:37:48] [INFO ] Invariant cache hit.
[2024-05-22 23:37:48] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 145/170 places, 170/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 254 ms. Remains : 145/170 places, 170/198 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 409 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=6, aps=[p0:(EQ s78 0), p1:(EQ s108 1), p2:(OR (EQ s89 0) (EQ s141 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 214 steps with 0 reset in 5 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-00 finished in 900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 158 transition count 186
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 158 transition count 186
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 151 transition count 177
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 151 transition count 177
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 146 transition count 171
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 146 transition count 171
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 141 transition count 165
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 141 transition count 165
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 138 transition count 161
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 138 transition count 161
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 136 transition count 159
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 136 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 135 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 135 transition count 158
Applied a total of 70 rules in 21 ms. Remains 135 /170 variables (removed 35) and now considering 158/198 (removed 40) transitions.
// Phase 1: matrix 158 rows 135 cols
[2024-05-22 23:37:49] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:37:49] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 23:37:49] [INFO ] Invariant cache hit.
[2024-05-22 23:37:49] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2024-05-22 23:37:49] [INFO ] Invariant cache hit.
[2024-05-22 23:37:49] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/170 places, 158/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 222 ms. Remains : 135/170 places, 158/198 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-01 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 s52 1) (EQ s134 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]]
Product exploration explored 100000 steps with 806 reset in 221 ms.
Stack based approach found an accepted trace after 84 steps with 0 reset with depth 85 and stack size 85 in 1 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-01 finished in 531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1))))'
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 159 transition count 187
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 159 transition count 187
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 152 transition count 178
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 152 transition count 178
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 147 transition count 172
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 147 transition count 172
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 142 transition count 166
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 142 transition count 166
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 139 transition count 162
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 139 transition count 162
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 137 transition count 160
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 137 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 136 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 136 transition count 159
Applied a total of 68 rules in 20 ms. Remains 136 /170 variables (removed 34) and now considering 159/198 (removed 39) transitions.
// Phase 1: matrix 159 rows 136 cols
[2024-05-22 23:37:49] [INFO ] Computed 2 invariants in 13 ms
[2024-05-22 23:37:49] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-22 23:37:49] [INFO ] Invariant cache hit.
[2024-05-22 23:37:49] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2024-05-22 23:37:49] [INFO ] Invariant cache hit.
[2024-05-22 23:37:50] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/170 places, 159/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 246 ms. Remains : 136/170 places, 159/198 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s126 0), p0:(EQ s105 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 410 steps with 1 reset in 4 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-02 finished in 402 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)||F(p1)) U (F(!p1)&&p2)))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 160 transition count 188
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 188
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 154 transition count 180
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 154 transition count 180
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 150 transition count 175
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 150 transition count 175
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 146 transition count 170
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 146 transition count 170
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 144 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 144 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 143 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 143 transition count 167
Applied a total of 54 rules in 17 ms. Remains 143 /170 variables (removed 27) and now considering 167/198 (removed 31) transitions.
// Phase 1: matrix 167 rows 143 cols
[2024-05-22 23:37:50] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 23:37:50] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 23:37:50] [INFO ] Invariant cache hit.
[2024-05-22 23:37:50] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-22 23:37:50] [INFO ] Invariant cache hit.
[2024-05-22 23:37:50] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 143/170 places, 167/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 232 ms. Remains : 143/170 places, 167/198 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p2) p1), (AND (NOT p1) (NOT p0)), p1, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p2 p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s21 1) (NEQ s125 1)), p1:(EQ s33 1), p0:(EQ s21 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 343 steps with 0 reset in 5 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-03 finished in 393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Graph (complete) has 331 edges and 170 vertex of which 167 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 166 transition count 164
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 136 transition count 164
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 61 place count 136 transition count 141
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 107 place count 113 transition count 141
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 113 place count 107 transition count 134
Iterating global reduction 2 with 6 rules applied. Total rules applied 119 place count 107 transition count 134
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 122 place count 104 transition count 131
Iterating global reduction 2 with 3 rules applied. Total rules applied 125 place count 104 transition count 131
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 102 transition count 128
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 102 transition count 128
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 131 place count 100 transition count 125
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 100 transition count 125
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 99 transition count 124
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 99 transition count 124
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 215 place count 59 transition count 84
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 222 place count 52 transition count 71
Iterating global reduction 2 with 7 rules applied. Total rules applied 229 place count 52 transition count 71
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 236 place count 45 transition count 62
Iterating global reduction 2 with 7 rules applied. Total rules applied 243 place count 45 transition count 62
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 249 place count 39 transition count 51
Iterating global reduction 2 with 6 rules applied. Total rules applied 255 place count 39 transition count 51
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 261 place count 33 transition count 44
Iterating global reduction 2 with 6 rules applied. Total rules applied 267 place count 33 transition count 44
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 273 place count 27 transition count 33
Iterating global reduction 2 with 6 rules applied. Total rules applied 279 place count 27 transition count 33
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 285 place count 21 transition count 26
Iterating global reduction 2 with 6 rules applied. Total rules applied 291 place count 21 transition count 26
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 293 place count 19 transition count 23
Iterating global reduction 2 with 2 rules applied. Total rules applied 295 place count 19 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 296 place count 18 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 297 place count 18 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 298 place count 18 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 300 place count 16 transition count 19
Reduce places removed 1 places and 0 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 2 with 2 rules applied. Total rules applied 302 place count 15 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 303 place count 14 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 303 place count 14 transition count 16
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 307 place count 12 transition count 16
Applied a total of 307 rules in 53 ms. Remains 12 /170 variables (removed 158) and now considering 16/198 (removed 182) transitions.
[2024-05-22 23:37:50] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 12 cols
[2024-05-22 23:37:50] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:37:50] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-22 23:37:50] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2024-05-22 23:37:50] [INFO ] Invariant cache hit.
[2024-05-22 23:37:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 23:37:50] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-22 23:37:50] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:37:50] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2024-05-22 23:37:50] [INFO ] Invariant cache hit.
[2024-05-22 23:37:50] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/170 places, 16/198 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 12/170 places, 16/198 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-04 finished in 190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&(p1 U (G(X(p0)) U p1))))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 158 transition count 186
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 158 transition count 186
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 151 transition count 177
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 151 transition count 177
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 146 transition count 171
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 146 transition count 171
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 141 transition count 165
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 141 transition count 165
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 138 transition count 161
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 138 transition count 161
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 136 transition count 159
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 136 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 135 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 135 transition count 158
Applied a total of 70 rules in 22 ms. Remains 135 /170 variables (removed 35) and now considering 158/198 (removed 40) transitions.
// Phase 1: matrix 158 rows 135 cols
[2024-05-22 23:37:50] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 23:37:50] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 23:37:50] [INFO ] Invariant cache hit.
[2024-05-22 23:37:50] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2024-05-22 23:37:50] [INFO ] Invariant cache hit.
[2024-05-22 23:37:51] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/170 places, 158/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 229 ms. Remains : 135/170 places, 158/198 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (EQ s103 1) (EQ s131 1)), p1:(AND (EQ s51 1) (EQ s131 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-05 finished in 412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1 U X(p2)))))))'
Support contains 5 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 160 transition count 188
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 188
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 155 transition count 182
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 155 transition count 182
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 151 transition count 177
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 151 transition count 177
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 147 transition count 172
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 147 transition count 172
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 144 transition count 168
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 144 transition count 168
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 142 transition count 166
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 142 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 141 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 141 transition count 165
Applied a total of 58 rules in 17 ms. Remains 141 /170 variables (removed 29) and now considering 165/198 (removed 33) transitions.
// Phase 1: matrix 165 rows 141 cols
[2024-05-22 23:37:51] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:37:51] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 23:37:51] [INFO ] Invariant cache hit.
[2024-05-22 23:37:51] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-05-22 23:37:51] [INFO ] Invariant cache hit.
[2024-05-22 23:37:51] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/170 places, 165/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 241 ms. Remains : 141/170 places, 165/198 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}, { cond=p1, acceptance={0} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s37 0) (EQ s137 0)), p1:(EQ s11 1), p2:(AND (EQ s64 1) (EQ s140 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 262 steps with 0 reset in 4 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-06 finished in 490 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(X(F(p0)))||(X(p1) U p2))))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 159 transition count 187
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 159 transition count 187
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 152 transition count 178
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 152 transition count 178
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 147 transition count 172
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 147 transition count 172
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 143 transition count 168
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 143 transition count 168
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 141 transition count 165
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 141 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 140 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 140 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 139 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 139 transition count 163
Applied a total of 62 rules in 24 ms. Remains 139 /170 variables (removed 31) and now considering 163/198 (removed 35) transitions.
// Phase 1: matrix 163 rows 139 cols
[2024-05-22 23:37:51] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:37:51] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 23:37:51] [INFO ] Invariant cache hit.
[2024-05-22 23:37:51] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-22 23:37:51] [INFO ] Invariant cache hit.
[2024-05-22 23:37:51] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 139/170 places, 163/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 220 ms. Remains : 139/170 places, 163/198 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s113 1), p0:(OR (EQ s125 0) (EQ s135 0) (EQ s113 1)), p1:(EQ s88 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33203 reset in 184 ms.
Product exploration explored 100000 steps with 33582 reset in 197 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 279 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 107 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Incomplete random walk after 10000 steps, including 37 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :3
Finished Best-First random walk after 8615 steps, including 2 resets, run visited all 1 properties in 9 ms. (steps per millisecond=957 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0) (NOT p2)))]
Knowledge based reduction with 6 factoid took 221 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 139 /139 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-05-22 23:37:53] [INFO ] Invariant cache hit.
[2024-05-22 23:37:53] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 23:37:53] [INFO ] Invariant cache hit.
[2024-05-22 23:37:53] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2024-05-22 23:37:53] [INFO ] Invariant cache hit.
[2024-05-22 23:37:53] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 139/139 places, 163/163 transitions.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 279 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 103 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :3
Finished Best-First random walk after 986 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=197 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0) (NOT p2)))]
Knowledge based reduction with 6 factoid took 230 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Product exploration explored 100000 steps with 33237 reset in 143 ms.
Product exploration explored 100000 steps with 33330 reset in 142 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 163/163 transitions.
Graph (complete) has 279 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 138 transition count 162
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 25 Pre rules applied. Total rules applied 17 place count 138 transition count 162
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 42 place count 138 transition count 162
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 63 place count 138 transition count 170
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 136 transition count 168
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 136 transition count 168
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 76 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 83 place count 136 transition count 200
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 89 place count 130 transition count 188
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 95 place count 130 transition count 188
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 113 place count 112 transition count 158
Deduced a syphon composed of 64 places in 1 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 131 place count 112 transition count 158
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 148 place count 95 transition count 130
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 165 place count 95 transition count 130
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 170 place count 90 transition count 125
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 175 place count 90 transition count 125
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 183 place count 82 transition count 113
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 191 place count 82 transition count 113
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 207 place count 66 transition count 89
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 223 place count 66 transition count 89
Deduced a syphon composed of 36 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 225 place count 66 transition count 87
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 225 rules in 63 ms. Remains 66 /139 variables (removed 73) and now considering 87/163 (removed 76) transitions.
[2024-05-22 23:37:55] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 23:37:55] [INFO ] Flow matrix only has 83 transitions (discarded 4 similar events)
// Phase 1: matrix 83 rows 66 cols
[2024-05-22 23:37:55] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:37:55] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/139 places, 87/163 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 66/139 places, 87/163 transitions.
Built C files in :
/tmp/ltsmin158494198483005734
[2024-05-22 23:37:55] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin158494198483005734
Running compilation step : cd /tmp/ltsmin158494198483005734;'/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 347 ms.
Running link step : cd /tmp/ltsmin158494198483005734;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin158494198483005734;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9865665505004473848.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 163/163 transitions.
Applied a total of 0 rules in 5 ms. Remains 139 /139 variables (removed 0) and now considering 163/163 (removed 0) transitions.
// Phase 1: matrix 163 rows 139 cols
[2024-05-22 23:38:10] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:38:10] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-22 23:38:10] [INFO ] Invariant cache hit.
[2024-05-22 23:38:10] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-05-22 23:38:10] [INFO ] Invariant cache hit.
[2024-05-22 23:38:10] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 229 ms. Remains : 139/139 places, 163/163 transitions.
Built C files in :
/tmp/ltsmin11113814490785664135
[2024-05-22 23:38:10] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11113814490785664135
Running compilation step : cd /tmp/ltsmin11113814490785664135;'/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 256 ms.
Running link step : cd /tmp/ltsmin11113814490785664135;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11113814490785664135;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4665144457756926031.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 23:38:25] [INFO ] Flatten gal took : 11 ms
[2024-05-22 23:38:25] [INFO ] Flatten gal took : 8 ms
[2024-05-22 23:38:25] [INFO ] Time to serialize gal into /tmp/LTL10621900116234064068.gal : 4 ms
[2024-05-22 23:38:25] [INFO ] Time to serialize properties into /tmp/LTL54966920518361012.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10621900116234064068.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5754588125868823.hoa' '-atoms' '/tmp/LTL54966920518361012.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...313
Loading property file /tmp/LTL54966920518361012.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5754588125868823.hoa
Detected timeout of ITS tools.
[2024-05-22 23:38:40] [INFO ] Flatten gal took : 9 ms
[2024-05-22 23:38:40] [INFO ] Flatten gal took : 8 ms
[2024-05-22 23:38:40] [INFO ] Time to serialize gal into /tmp/LTL12038471499288727519.gal : 2 ms
[2024-05-22 23:38:40] [INFO ] Time to serialize properties into /tmp/LTL11911972985888464245.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12038471499288727519.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11911972985888464245.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F(X(F("(((p217==0)||(p231==0))||(p192==1))"))))||((X("(p146==1)"))U("(p192==1)")))))
Formula 0 simplified : F(!"(p192==1)" & X(G!"(((p217==0)||(p231==0))||(p192==1))" & (!"(p192==1)" W !"(p146==1)")))
Detected timeout of ITS tools.
[2024-05-22 23:38:55] [INFO ] Flatten gal took : 7 ms
[2024-05-22 23:38:55] [INFO ] Applying decomposition
[2024-05-22 23:38:55] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10719525116147812857.txt' '-o' '/tmp/graph10719525116147812857.bin' '-w' '/tmp/graph10719525116147812857.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10719525116147812857.bin' '-l' '-1' '-v' '-w' '/tmp/graph10719525116147812857.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:38:55] [INFO ] Decomposing Gal with order
[2024-05-22 23:38:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:38:56] [INFO ] Removed a total of 61 redundant transitions.
[2024-05-22 23:38:56] [INFO ] Flatten gal took : 62 ms
[2024-05-22 23:38:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 4 ms.
[2024-05-22 23:38:56] [INFO ] Time to serialize gal into /tmp/LTL2713764127036744042.gal : 4 ms
[2024-05-22 23:38:56] [INFO ] Time to serialize properties into /tmp/LTL17643994557020569683.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2713764127036744042.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17643994557020569683.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((F(X(F("(((i13.u45.p217==0)||(u48.p231==0))||(i12.u41.p192==1))"))))||((X("(i3.u32.p146==1)"))U("(i12.u41.p192==1)")))))
Formula 0 simplified : F(!"(i12.u41.p192==1)" & X(G!"(((i13.u45.p217==0)||(u48.p231==0))||(i12.u41.p192==1))" & (!"(i12.u41.p192==1)" W !"(i3.u32.p146==1)"...158
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7363844397649289342
[2024-05-22 23:39:11] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7363844397649289342
Running compilation step : cd /tmp/ltsmin7363844397649289342;'/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 241 ms.
Running link step : cd /tmp/ltsmin7363844397649289342;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin7363844397649289342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>(X(<>((LTLAPp0==true))))||(X((LTLAPp1==true)) U (LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-07 finished in 94596 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||G(p1)))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 159 transition count 187
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 159 transition count 187
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 152 transition count 178
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 152 transition count 178
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 147 transition count 172
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 147 transition count 172
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 142 transition count 166
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 142 transition count 166
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 139 transition count 162
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 139 transition count 162
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 137 transition count 160
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 137 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 136 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 136 transition count 159
Applied a total of 68 rules in 11 ms. Remains 136 /170 variables (removed 34) and now considering 159/198 (removed 39) transitions.
// Phase 1: matrix 159 rows 136 cols
[2024-05-22 23:39:26] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:39:26] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 23:39:26] [INFO ] Invariant cache hit.
[2024-05-22 23:39:26] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2024-05-22 23:39:26] [INFO ] Invariant cache hit.
[2024-05-22 23:39:26] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/170 places, 159/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 365 ms. Remains : 136/170 places, 159/198 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (EQ s35 1) (EQ s132 1)), p0:(EQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-08 finished in 528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(F(p1))))))'
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 159 transition count 187
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 159 transition count 187
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 152 transition count 178
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 152 transition count 178
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 148 transition count 173
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 148 transition count 173
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 144 transition count 169
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 144 transition count 169
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 142 transition count 166
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 142 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 141 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 141 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 140 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 140 transition count 164
Applied a total of 60 rules in 15 ms. Remains 140 /170 variables (removed 30) and now considering 164/198 (removed 34) transitions.
// Phase 1: matrix 164 rows 140 cols
[2024-05-22 23:39:26] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:39:26] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 23:39:26] [INFO ] Invariant cache hit.
[2024-05-22 23:39:26] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-22 23:39:26] [INFO ] Invariant cache hit.
[2024-05-22 23:39:27] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 140/170 places, 164/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 238 ms. Remains : 140/170 places, 164/198 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s60 1), p1:(EQ s88 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-09 finished in 451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(G(p1))))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 159 transition count 187
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 159 transition count 187
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 153 transition count 179
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 153 transition count 179
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 148 transition count 173
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 148 transition count 173
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 143 transition count 167
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 143 transition count 167
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 140 transition count 163
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 140 transition count 163
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 138 transition count 161
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 138 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 137 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 137 transition count 160
Applied a total of 66 rules in 15 ms. Remains 137 /170 variables (removed 33) and now considering 160/198 (removed 38) transitions.
// Phase 1: matrix 160 rows 137 cols
[2024-05-22 23:39:27] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:39:27] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 23:39:27] [INFO ] Invariant cache hit.
[2024-05-22 23:39:27] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-05-22 23:39:27] [INFO ] Invariant cache hit.
[2024-05-22 23:39:27] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 137/170 places, 160/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 242 ms. Remains : 137/170 places, 160/198 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s126 1), p1:(AND (EQ s74 1) (EQ s136 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1510 reset in 122 ms.
Stack based approach found an accepted trace after 92 steps with 1 reset with depth 48 and stack size 48 in 0 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-10 finished in 475 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 p1)||X(p2)))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 159 transition count 187
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 159 transition count 187
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 153 transition count 179
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 153 transition count 179
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 149 transition count 175
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 149 transition count 175
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 145 transition count 170
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 145 transition count 170
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 143 transition count 167
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 143 transition count 167
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 141 transition count 165
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 141 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 140 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 140 transition count 164
Applied a total of 60 rules in 9 ms. Remains 140 /170 variables (removed 30) and now considering 164/198 (removed 34) transitions.
// Phase 1: matrix 164 rows 140 cols
[2024-05-22 23:39:27] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:39:27] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 23:39:27] [INFO ] Invariant cache hit.
[2024-05-22 23:39:27] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-05-22 23:39:27] [INFO ] Invariant cache hit.
[2024-05-22 23:39:27] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 140/170 places, 164/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 140/170 places, 164/198 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(EQ s100 1), p1:(EQ s46 1), p0:(AND (EQ s85 1) (EQ s139 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-13 finished in 407 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 U (G(p1)||(p1&&(!p0 U (p2||G(!p0)))))))))))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Graph (complete) has 331 edges and 170 vertex of which 167 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 166 transition count 166
Reduce places removed 28 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 138 transition count 164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 136 transition count 164
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 61 place count 136 transition count 142
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 105 place count 114 transition count 142
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 111 place count 108 transition count 135
Iterating global reduction 3 with 6 rules applied. Total rules applied 117 place count 108 transition count 135
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 120 place count 105 transition count 132
Iterating global reduction 3 with 3 rules applied. Total rules applied 123 place count 105 transition count 132
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 125 place count 103 transition count 129
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 103 transition count 129
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 129 place count 101 transition count 126
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 101 transition count 126
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 100 transition count 125
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 100 transition count 125
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 209 place count 62 transition count 87
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 216 place count 55 transition count 74
Iterating global reduction 3 with 7 rules applied. Total rules applied 223 place count 55 transition count 74
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 230 place count 48 transition count 65
Iterating global reduction 3 with 7 rules applied. Total rules applied 237 place count 48 transition count 65
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 244 place count 41 transition count 52
Iterating global reduction 3 with 7 rules applied. Total rules applied 251 place count 41 transition count 52
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 258 place count 34 transition count 44
Iterating global reduction 3 with 7 rules applied. Total rules applied 265 place count 34 transition count 44
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 271 place count 28 transition count 33
Iterating global reduction 3 with 6 rules applied. Total rules applied 277 place count 28 transition count 33
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 282 place count 23 transition count 27
Iterating global reduction 3 with 5 rules applied. Total rules applied 287 place count 23 transition count 27
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 289 place count 21 transition count 24
Iterating global reduction 3 with 2 rules applied. Total rules applied 291 place count 21 transition count 24
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 292 place count 20 transition count 23
Iterating global reduction 3 with 1 rules applied. Total rules applied 293 place count 20 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 294 place count 20 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 296 place count 18 transition count 20
Reduce places removed 1 places and 0 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 3 with 2 rules applied. Total rules applied 298 place count 17 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 299 place count 16 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 299 place count 16 transition count 17
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 303 place count 14 transition count 17
Applied a total of 303 rules in 36 ms. Remains 14 /170 variables (removed 156) and now considering 17/198 (removed 181) transitions.
[2024-05-22 23:39:28] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
// Phase 1: matrix 16 rows 14 cols
[2024-05-22 23:39:28] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:39:28] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-22 23:39:28] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
[2024-05-22 23:39:28] [INFO ] Invariant cache hit.
[2024-05-22 23:39:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 23:39:28] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-22 23:39:28] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:39:28] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
[2024-05-22 23:39:28] [INFO ] Invariant cache hit.
[2024-05-22 23:39:28] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/170 places, 17/198 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 14/170 places, 17/198 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={2} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={2} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={1, 2} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NEQ s11 1) (NOT (AND (EQ s7 1) (EQ s13 1)))), p0:(AND (EQ s7 1) (EQ s13 1)), p1:(EQ s9 1)], nbAcceptance=3, 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 6264 steps with 299 reset in 14 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-14 finished in 262 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(G(p0))))'
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 158 transition count 186
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 158 transition count 186
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 151 transition count 177
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 151 transition count 177
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 146 transition count 171
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 146 transition count 171
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 141 transition count 165
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 141 transition count 165
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 138 transition count 161
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 138 transition count 161
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 136 transition count 159
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 136 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 135 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 135 transition count 158
Applied a total of 70 rules in 13 ms. Remains 135 /170 variables (removed 35) and now considering 158/198 (removed 40) transitions.
// Phase 1: matrix 158 rows 135 cols
[2024-05-22 23:39:28] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:39:28] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 23:39:28] [INFO ] Invariant cache hit.
[2024-05-22 23:39:28] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-22 23:39:28] [INFO ] Invariant cache hit.
[2024-05-22 23:39:28] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/170 places, 158/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 241 ms. Remains : 135/170 places, 158/198 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s65 0) (EQ s131 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 73 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-15 finished in 363 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(X(F(p0)))||(X(p1) U p2))))'
Found a Lengthening insensitive property : DiscoveryGPU-PT-08b-LTLFireability-07
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Graph (complete) has 331 edges and 170 vertex of which 167 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 166 transition count 166
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 138 transition count 166
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 57 place count 138 transition count 143
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 103 place count 115 transition count 143
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 109 place count 109 transition count 136
Iterating global reduction 2 with 6 rules applied. Total rules applied 115 place count 109 transition count 136
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 118 place count 106 transition count 133
Iterating global reduction 2 with 3 rules applied. Total rules applied 121 place count 106 transition count 133
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 123 place count 104 transition count 130
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 104 transition count 130
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 126 place count 103 transition count 129
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 103 transition count 129
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 205 place count 64 transition count 90
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 211 place count 58 transition count 79
Iterating global reduction 2 with 6 rules applied. Total rules applied 217 place count 58 transition count 79
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 223 place count 52 transition count 71
Iterating global reduction 2 with 6 rules applied. Total rules applied 229 place count 52 transition count 71
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 234 place count 47 transition count 62
Iterating global reduction 2 with 5 rules applied. Total rules applied 239 place count 47 transition count 62
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 244 place count 42 transition count 56
Iterating global reduction 2 with 5 rules applied. Total rules applied 249 place count 42 transition count 56
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 253 place count 38 transition count 49
Iterating global reduction 2 with 4 rules applied. Total rules applied 257 place count 38 transition count 49
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 261 place count 34 transition count 44
Iterating global reduction 2 with 4 rules applied. Total rules applied 265 place count 34 transition count 44
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 267 place count 32 transition count 41
Iterating global reduction 2 with 2 rules applied. Total rules applied 269 place count 32 transition count 41
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 270 place count 31 transition count 40
Iterating global reduction 2 with 1 rules applied. Total rules applied 271 place count 31 transition count 40
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 273 place count 31 transition count 40
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 275 place count 29 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 276 place count 28 transition count 38
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 276 place count 28 transition count 36
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 280 place count 26 transition count 36
Performed 3 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 286 place count 23 transition count 32
Applied a total of 286 rules in 30 ms. Remains 23 /170 variables (removed 147) and now considering 32/198 (removed 166) transitions.
[2024-05-22 23:39:28] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
// Phase 1: matrix 27 rows 23 cols
[2024-05-22 23:39:28] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:39:28] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-22 23:39:28] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-05-22 23:39:28] [INFO ] Invariant cache hit.
[2024-05-22 23:39:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 23:39:29] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-22 23:39:29] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-05-22 23:39:29] [INFO ] Invariant cache hit.
[2024-05-22 23:39:29] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 23/170 places, 32/198 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 134 ms. Remains : 23/170 places, 32/198 transitions.
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s15 1), p0:(OR (EQ s18 0) (EQ s22 0) (EQ s15 1)), p1:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33315 reset in 120 ms.
Product exploration explored 100000 steps with 33183 reset in 136 ms.
Computed a total of 21 stabilizing places and 25 stable transitions
Computed a total of 21 stabilizing places and 25 stable transitions
Detected a total of 21/23 stabilizing places and 25/32 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 213 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Incomplete random walk after 10000 steps, including 104 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :3
Finished Best-First random walk after 1046 steps, including 2 resets, run visited all 1 properties in 17 ms. (steps per millisecond=61 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 560 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-22 23:39:30] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-05-22 23:39:30] [INFO ] Invariant cache hit.
[2024-05-22 23:39:30] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-22 23:39:30] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-05-22 23:39:30] [INFO ] Invariant cache hit.
[2024-05-22 23:39:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 23:39:30] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-22 23:39:30] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-05-22 23:39:30] [INFO ] Invariant cache hit.
[2024-05-22 23:39:30] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 23/23 places, 32/32 transitions.
Computed a total of 21 stabilizing places and 25 stable transitions
Computed a total of 21 stabilizing places and 25 stable transitions
Detected a total of 21/23 stabilizing places and 25/32 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 194 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Finished random walk after 1939 steps, including 20 resets, run visited all 4 properties in 5 ms. (steps per millisecond=387 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 486 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Product exploration explored 100000 steps with 33236 reset in 101 ms.
Product exploration explored 100000 steps with 33418 reset in 106 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 32/32 transitions.
Applied a total of 0 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-22 23:39:32] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:39:32] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-05-22 23:39:32] [INFO ] Invariant cache hit.
[2024-05-22 23:39:32] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39 ms. Remains : 23/23 places, 32/32 transitions.
Built C files in :
/tmp/ltsmin1354554894466514772
[2024-05-22 23:39:32] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1354554894466514772
Running compilation step : cd /tmp/ltsmin1354554894466514772;'/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 99 ms.
Running link step : cd /tmp/ltsmin1354554894466514772;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin1354554894466514772;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1633787902690468446.hoa' '--buchi-type=spotba'
LTSmin run took 5141 ms.
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-07 finished in 8806 ms.
Length sensitive decision was in the wrong direction : Lengthening insensitive + true
[2024-05-22 23:39:37] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14012867005478195379
[2024-05-22 23:39:37] [INFO ] Computing symmetric may disable matrix : 198 transitions.
[2024-05-22 23:39:37] [INFO ] Applying decomposition
[2024-05-22 23:39:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:39:37] [INFO ] Computing symmetric may enable matrix : 198 transitions.
[2024-05-22 23:39:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:39:37] [INFO ] Flatten gal took : 7 ms
[2024-05-22 23:39:37] [INFO ] Computing Do-Not-Accords matrix : 198 transitions.
[2024-05-22 23:39:37] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:39:37] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14012867005478195379
Running compilation step : cd /tmp/ltsmin14012867005478195379;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4588085118547339743.txt' '-o' '/tmp/graph4588085118547339743.bin' '-w' '/tmp/graph4588085118547339743.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4588085118547339743.bin' '-l' '-1' '-v' '-w' '/tmp/graph4588085118547339743.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:39:37] [INFO ] Decomposing Gal with order
[2024-05-22 23:39:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:39:37] [INFO ] Removed a total of 71 redundant transitions.
[2024-05-22 23:39:37] [INFO ] Flatten gal took : 31 ms
[2024-05-22 23:39:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 23:39:37] [INFO ] Time to serialize gal into /tmp/LTLFireability822114424919928649.gal : 11 ms
[2024-05-22 23:39:37] [INFO ] Time to serialize properties into /tmp/LTLFireability1681861903797895181.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability822114424919928649.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1681861903797895181.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F(X(F("(((i20.u58.p217==0)||(u61.p231==0))||(i17.u53.p192==1))"))))||((X("(i14.u42.p146==1)"))U("(i17.u53.p192==1)")))))
Formula 0 simplified : F(!"(i17.u53.p192==1)" & X(G!"(((i20.u58.p217==0)||(u61.p231==0))||(i17.u53.p192==1))" & (!"(i17.u53.p192==1)" W !"(i14.u42.p146==1)...159
Compilation finished in 407 ms.
Running link step : cd /tmp/ltsmin14012867005478195379;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin14012867005478195379;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>(X(<>((LTLAPp0==true))))||(X((LTLAPp1==true)) U (LTLAPp2==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t133, t137, t144, t186, t191, u61.t4, u61.t5, i1.i0.u6.t128, i1.i1.u12.t196, i2.u5.t130, i3.u...647
Computing Next relation with stutter on 1 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: LTL layer: formula: []((<>(X(<>((LTLAPp0==true))))||(X((LTLAPp1==true)) U (LTLAPp2==true))))
pins2lts-mc-linux64( 6/ 8), 0.003: "[]((<>(X(<>((LTLAPp0==true))))||(X((LTLAPp1==true)) U (LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.032: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.102: DFS-FIFO for weak LTL, using special progress label 202
pins2lts-mc-linux64( 0/ 8), 0.102: There are 203 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.102: State length is 171, there are 203 groups
pins2lts-mc-linux64( 0/ 8), 0.102: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.102: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.102: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.102: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.143: ~2 levels ~960 states ~2512 transitions
pins2lts-mc-linux64( 1/ 8), 0.371: ~2 levels ~1920 states ~5744 transitions
pins2lts-mc-linux64( 0/ 8), 0.400: ~2 levels ~3840 states ~11472 transitions
pins2lts-mc-linux64( 0/ 8), 0.447: ~2 levels ~7680 states ~24280 transitions
pins2lts-mc-linux64( 0/ 8), 0.545: ~2 levels ~15360 states ~58048 transitions
pins2lts-mc-linux64( 1/ 8), 0.728: ~2 levels ~30720 states ~143816 transitions
pins2lts-mc-linux64( 1/ 8), 1.023: ~2 levels ~61440 states ~291216 transitions
pins2lts-mc-linux64( 7/ 8), 1.645: ~17 levels ~122880 states ~408880 transitions
pins2lts-mc-linux64( 7/ 8), 2.644: ~17 levels ~245760 states ~894432 transitions
pins2lts-mc-linux64( 7/ 8), 4.890: ~18 levels ~491520 states ~1993224 transitions
pins2lts-mc-linux64( 7/ 8), 7.562: ~18 levels ~983040 states ~4216184 transitions
pins2lts-mc-linux64( 7/ 8), 12.484: ~18 levels ~1966080 states ~9268848 transitions
pins2lts-mc-linux64( 7/ 8), 21.908: ~18 levels ~3932160 states ~19679304 transitions
pins2lts-mc-linux64( 7/ 8), 42.409: ~20 levels ~7864320 states ~42206928 transitions
pins2lts-mc-linux64( 4/ 8), 81.790: ~18 levels ~15728640 states ~85381104 transitions
pins2lts-mc-linux64( 4/ 8), 168.993: ~18 levels ~31457280 states ~186891152 transitions
pins2lts-mc-linux64( 4/ 8), 336.668: ~20 levels ~62914560 states ~373386624 transitions
pins2lts-mc-linux64( 0/ 8), 696.200: ~24 levels ~125829120 states ~757827680 transitions
pins2lts-mc-linux64( 6/ 8), 717.703: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 717.727:
pins2lts-mc-linux64( 0/ 8), 717.727: mean standard work distribution: 3.2% (states) 2.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 717.727:
pins2lts-mc-linux64( 0/ 8), 717.727: Explored 123029815 states 789926168 transitions, fanout: 6.421
pins2lts-mc-linux64( 0/ 8), 717.727: Total exploration time 717.610 sec (717.580 sec minimum, 717.592 sec on average)
pins2lts-mc-linux64( 0/ 8), 717.727: States per second: 171444, Transitions per second: 1100774
pins2lts-mc-linux64( 0/ 8), 717.727:
pins2lts-mc-linux64( 0/ 8), 717.727: Progress states detected: 63978096
pins2lts-mc-linux64( 0/ 8), 717.727: Redundant explorations: -8.3348
pins2lts-mc-linux64( 0/ 8), 717.727:
pins2lts-mc-linux64( 0/ 8), 717.727: Queue width: 8B, total height: 21429214, memory: 163.49MB
pins2lts-mc-linux64( 0/ 8), 717.727: Tree memory: 1069.4MB, 8.4 B/state, compr.: 1.2%
pins2lts-mc-linux64( 0/ 8), 717.727: Tree fill ratio (roots/leafs): 99.0%/17.0%
pins2lts-mc-linux64( 0/ 8), 717.727: Stored 198 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 717.727: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 717.727: Est. total memory use: 1232.9MB (~1187.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14012867005478195379;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>(X(<>((LTLAPp0==true))))||(X((LTLAPp1==true)) U (LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14012867005478195379;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>(X(<>((LTLAPp0==true))))||(X((LTLAPp1==true)) U (LTLAPp2==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-23 00:00:15] [INFO ] Applying decomposition
[2024-05-23 00:00:15] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:00:15] [INFO ] Decomposing Gal with order
[2024-05-23 00:00:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:00:15] [INFO ] Removed a total of 71 redundant transitions.
[2024-05-23 00:00:15] [INFO ] Flatten gal took : 11 ms
[2024-05-23 00:00:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 325 labels/synchronizations in 10 ms.
[2024-05-23 00:00:15] [INFO ] Time to serialize gal into /tmp/LTLFireability6500388240737426026.gal : 1 ms
[2024-05-23 00:00:15] [INFO ] Time to serialize properties into /tmp/LTLFireability12843502072237671884.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6500388240737426026.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12843502072237671884.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F(X(F("(((i0.u15.p217==0)||(i1.u17.p231==0))||(i0.i0.u14.p192==1))"))))||((X("(i0.i0.i0.u13.p146==1)"))U("(i0.i0.u14.p192==1)"))...158
Formula 0 simplified : F(!"(i0.i0.u14.p192==1)" & X(G!"(((i0.u15.p217==0)||(i1.u17.p231==0))||(i0.i0.u14.p192==1))" & (!"(i0.i0.u14.p192==1)" W !"(i0.i0.i0...172
Reverse transition relation is NOT exact ! Due to transitions t138, t144, t150, t159, t186, i0.t12, i0.u15.t19, i0.u15.t21, i0.i0.t26, i0.i0.t31, i0.i0.t33...1034
Computing Next relation with stutter on 1 deadlock states
172 unique states visited
0 strongly connected components in search stack
229 transitions explored
88 items max in DFS search stack
8659 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,86.6098,1672204,1,0,1.76628e+06,2.4828e+06,3514,5.14948e+06,1494,1.15141e+07,862910
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 1451231 ms.

BK_STOP 1716422518548

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-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 DiscoveryGPU-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 r153-tall-171631151400253"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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