Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r133-smll-167819410700308.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is DiscoveryGPU-PT-07b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r133-smll-167819410700308
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 8.0K Feb 25 13:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 25 13:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 13:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 13:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 13:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 13:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 13:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 13:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 54K Mar 5 18:22 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-07b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678418402655

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-07b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-10 03:20:07] [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]
[2023-03-10 03:20:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 03:20:07] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2023-03-10 03:20:07] [INFO ] Transformed 212 places.
[2023-03-10 03:20:07] [INFO ] Transformed 224 transitions.
[2023-03-10 03:20:07] [INFO ] Found NUPN structural information;
[2023-03-10 03:20:07] [INFO ] Parsed PT model containing 212 places and 224 transitions and 582 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 224/224 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 198 transition count 224
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 45 place count 167 transition count 193
Iterating global reduction 1 with 31 rules applied. Total rules applied 76 place count 167 transition count 193
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 162 transition count 188
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 162 transition count 188
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 157 transition count 183
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 157 transition count 183
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 100 place count 153 transition count 179
Iterating global reduction 1 with 4 rules applied. Total rules applied 104 place count 153 transition count 179
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 150 transition count 173
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 150 transition count 173
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 112 place count 148 transition count 171
Iterating global reduction 1 with 2 rules applied. Total rules applied 114 place count 148 transition count 171
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 116 place count 146 transition count 169
Iterating global reduction 1 with 2 rules applied. Total rules applied 118 place count 146 transition count 169
Applied a total of 118 rules in 91 ms. Remains 146 /212 variables (removed 66) and now considering 169/224 (removed 55) transitions.
// Phase 1: matrix 169 rows 146 cols
[2023-03-10 03:20:07] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-10 03:20:08] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-10 03:20:08] [INFO ] Invariant cache hit.
[2023-03-10 03:20:08] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2023-03-10 03:20:08] [INFO ] Invariant cache hit.
[2023-03-10 03:20:08] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 146/212 places, 169/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 801 ms. Remains : 146/212 places, 169/224 transitions.
Support contains 35 out of 146 places after structural reductions.
[2023-03-10 03:20:08] [INFO ] Flatten gal took : 74 ms
[2023-03-10 03:20:08] [INFO ] Flatten gal took : 32 ms
[2023-03-10 03:20:09] [INFO ] Input system was already deterministic with 169 transitions.
Support contains 33 out of 146 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 508 ms. (steps per millisecond=19 ) properties (out of 32) seen :31
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 03:20:09] [INFO ] Invariant cache hit.
[2023-03-10 03:20:09] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 03:20:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 03:20:09] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 28 stabilizing places and 28 stable transitions
Graph (complete) has 282 edges and 146 vertex of which 145 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&(p1 U p2))))'
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 169/169 transitions.
Graph (complete) has 282 edges and 146 vertex of which 145 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 144 transition count 145
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 122 transition count 143
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 120 transition count 143
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 49 place count 120 transition count 120
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 95 place count 97 transition count 120
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 103 place count 89 transition count 111
Iterating global reduction 3 with 8 rules applied. Total rules applied 111 place count 89 transition count 111
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 114 place count 86 transition count 107
Iterating global reduction 3 with 3 rules applied. Total rules applied 117 place count 86 transition count 107
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 84 transition count 104
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 84 transition count 104
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 83 transition count 103
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 83 transition count 103
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 185 place count 52 transition count 72
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 191 place count 46 transition count 60
Iterating global reduction 3 with 6 rules applied. Total rules applied 197 place count 46 transition count 60
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 203 place count 40 transition count 54
Iterating global reduction 3 with 6 rules applied. Total rules applied 209 place count 40 transition count 54
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 213 place count 36 transition count 46
Iterating global reduction 3 with 4 rules applied. Total rules applied 217 place count 36 transition count 46
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 221 place count 32 transition count 42
Iterating global reduction 3 with 4 rules applied. Total rules applied 225 place count 32 transition count 42
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 229 place count 28 transition count 34
Iterating global reduction 3 with 4 rules applied. Total rules applied 233 place count 28 transition count 34
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 237 place count 24 transition count 30
Iterating global reduction 3 with 4 rules applied. Total rules applied 241 place count 24 transition count 30
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 242 place count 24 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 244 place count 22 transition count 27
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 246 place count 21 transition count 26
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 248 place count 20 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 249 place count 19 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 249 place count 19 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 253 place count 17 transition count 23
Applied a total of 253 rules in 78 ms. Remains 17 /146 variables (removed 129) and now considering 23/169 (removed 146) transitions.
[2023-03-10 03:20:10] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
// Phase 1: matrix 21 rows 17 cols
[2023-03-10 03:20:10] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-10 03:20:10] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-10 03:20:10] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
[2023-03-10 03:20:10] [INFO ] Invariant cache hit.
[2023-03-10 03:20:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 03:20:10] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-10 03:20:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 03:20:10] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
[2023-03-10 03:20:10] [INFO ] Invariant cache hit.
[2023-03-10 03:20:10] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/146 places, 23/169 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 252 ms. Remains : 17/146 places, 23/169 transitions.
Stuttering acceptance computed with spot in 422 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s12 0), p2:(OR (AND (EQ s5 1) (EQ s16 1)) (EQ s14 1)), p1:(AND (EQ s5 1) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 84 steps with 0 reset in 8 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-00 finished in 780 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 169/169 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 133 transition count 155
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 133 transition count 155
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 127 transition count 148
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 127 transition count 148
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 124 transition count 145
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 124 transition count 145
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 122 transition count 142
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 122 transition count 142
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 121 transition count 141
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 121 transition count 141
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 120 transition count 140
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 120 transition count 140
Applied a total of 52 rules in 85 ms. Remains 120 /146 variables (removed 26) and now considering 140/169 (removed 29) transitions.
// Phase 1: matrix 140 rows 120 cols
[2023-03-10 03:20:11] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-10 03:20:11] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-10 03:20:11] [INFO ] Invariant cache hit.
[2023-03-10 03:20:11] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
[2023-03-10 03:20:11] [INFO ] Invariant cache hit.
[2023-03-10 03:20:12] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/146 places, 140/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 894 ms. Remains : 120/146 places, 140/169 transitions.
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s31 1), p1:(EQ s87 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 654 steps with 2 reset in 7 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-02 finished in 1259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 169/169 transitions.
Graph (complete) has 282 edges and 146 vertex of which 145 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 144 transition count 142
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 119 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 118 transition count 141
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 53 place count 118 transition count 121
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 93 place count 98 transition count 121
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 101 place count 90 transition count 112
Iterating global reduction 3 with 8 rules applied. Total rules applied 109 place count 90 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 109 place count 90 transition count 111
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 89 transition count 111
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 114 place count 86 transition count 107
Iterating global reduction 3 with 3 rules applied. Total rules applied 117 place count 86 transition count 107
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 84 transition count 104
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 84 transition count 104
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 83 transition count 103
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 83 transition count 103
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 185 place count 52 transition count 72
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 191 place count 46 transition count 60
Iterating global reduction 3 with 6 rules applied. Total rules applied 197 place count 46 transition count 60
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 203 place count 40 transition count 54
Iterating global reduction 3 with 6 rules applied. Total rules applied 209 place count 40 transition count 54
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 214 place count 35 transition count 44
Iterating global reduction 3 with 5 rules applied. Total rules applied 219 place count 35 transition count 44
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 224 place count 30 transition count 39
Iterating global reduction 3 with 5 rules applied. Total rules applied 229 place count 30 transition count 39
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 233 place count 26 transition count 31
Iterating global reduction 3 with 4 rules applied. Total rules applied 237 place count 26 transition count 31
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 241 place count 22 transition count 27
Iterating global reduction 3 with 4 rules applied. Total rules applied 245 place count 22 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 246 place count 22 transition count 26
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 247 place count 22 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 249 place count 20 transition count 24
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 21 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 253 place count 15 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 254 place count 14 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 254 place count 14 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 256 place count 13 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 258 place count 12 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 260 place count 11 transition count 18
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 263 place count 11 transition count 15
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 266 place count 8 transition count 12
Applied a total of 266 rules in 38 ms. Remains 8 /146 variables (removed 138) and now considering 12/169 (removed 157) transitions.
[2023-03-10 03:20:12] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 8 cols
[2023-03-10 03:20:12] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 03:20:12] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-10 03:20:12] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2023-03-10 03:20:12] [INFO ] Invariant cache hit.
[2023-03-10 03:20:12] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-10 03:20:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 03:20:12] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2023-03-10 03:20:12] [INFO ] Invariant cache hit.
[2023-03-10 03:20:12] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/146 places, 12/169 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 8/146 places, 12/169 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s2 1) (NEQ s5 1)), p0:(NEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-04 finished in 285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 169/169 transitions.
Graph (complete) has 282 edges and 146 vertex of which 145 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 144 transition count 143
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 120 transition count 143
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 49 place count 120 transition count 122
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 91 place count 99 transition count 122
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 99 place count 91 transition count 113
Iterating global reduction 2 with 8 rules applied. Total rules applied 107 place count 91 transition count 113
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 110 place count 88 transition count 109
Iterating global reduction 2 with 3 rules applied. Total rules applied 113 place count 88 transition count 109
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 115 place count 86 transition count 106
Iterating global reduction 2 with 2 rules applied. Total rules applied 117 place count 86 transition count 106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 85 transition count 105
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 85 transition count 105
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 185 place count 52 transition count 72
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 190 place count 47 transition count 62
Iterating global reduction 2 with 5 rules applied. Total rules applied 195 place count 47 transition count 62
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 200 place count 42 transition count 57
Iterating global reduction 2 with 5 rules applied. Total rules applied 205 place count 42 transition count 57
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 210 place count 37 transition count 47
Iterating global reduction 2 with 5 rules applied. Total rules applied 215 place count 37 transition count 47
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 220 place count 32 transition count 42
Iterating global reduction 2 with 5 rules applied. Total rules applied 225 place count 32 transition count 42
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 230 place count 27 transition count 32
Iterating global reduction 2 with 5 rules applied. Total rules applied 235 place count 27 transition count 32
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 240 place count 22 transition count 27
Iterating global reduction 2 with 5 rules applied. Total rules applied 245 place count 22 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 246 place count 22 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 248 place count 20 transition count 24
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 250 place count 19 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 251 place count 18 transition count 23
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 251 place count 18 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 257 place count 15 transition count 20
Applied a total of 257 rules in 43 ms. Remains 15 /146 variables (removed 131) and now considering 20/169 (removed 149) transitions.
[2023-03-10 03:20:12] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 15 cols
[2023-03-10 03:20:12] [INFO ] Computed 1 place invariants in 14 ms
[2023-03-10 03:20:12] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-10 03:20:12] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2023-03-10 03:20:12] [INFO ] Invariant cache hit.
[2023-03-10 03:20:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 03:20:12] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2023-03-10 03:20:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 03:20:12] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2023-03-10 03:20:12] [INFO ] Invariant cache hit.
[2023-03-10 03:20:12] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/146 places, 20/169 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 264 ms. Remains : 15/146 places, 20/169 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (NEQ s9 1) (NEQ s14 1)), p0:(AND (EQ s12 1) (EQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1161 reset in 376 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 1 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-05 finished in 759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U (p1 U !p2))&&F(G(p3))))'
Support contains 5 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 169/169 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 134 transition count 156
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 134 transition count 156
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 129 transition count 150
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 129 transition count 150
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 126 transition count 147
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 126 transition count 147
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 124 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 124 transition count 144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 123 transition count 143
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 123 transition count 143
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 122 transition count 142
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 122 transition count 142
Applied a total of 48 rules in 13 ms. Remains 122 /146 variables (removed 24) and now considering 142/169 (removed 27) transitions.
// Phase 1: matrix 142 rows 122 cols
[2023-03-10 03:20:13] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-10 03:20:13] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-10 03:20:13] [INFO ] Invariant cache hit.
[2023-03-10 03:20:13] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2023-03-10 03:20:13] [INFO ] Invariant cache hit.
[2023-03-10 03:20:13] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 122/146 places, 142/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 499 ms. Remains : 122/146 places, 142/169 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p3) p2), (NOT p0), p2, (NOT p3), (AND (NOT p0) p2), true, p2]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(AND p2 p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={0} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 4}], [{ cond=p3, acceptance={} source=3 dest: 3}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s106 1) (EQ s116 1)), p1:(EQ s17 1), p0:(AND (OR (EQ s17 1) (EQ s117 1)) (EQ s17 1)), p3:(AND (EQ s110 1) (EQ s116 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 180 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-07 finished in 811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0)))||F((X(F(p2))&&p1)))))'
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 169/169 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 135 transition count 157
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 135 transition count 157
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 131 transition count 153
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 131 transition count 153
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 129 transition count 151
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 129 transition count 151
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 128 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 128 transition count 149
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 127 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 127 transition count 148
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 126 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 126 transition count 147
Applied a total of 40 rules in 38 ms. Remains 126 /146 variables (removed 20) and now considering 147/169 (removed 22) transitions.
// Phase 1: matrix 147 rows 126 cols
[2023-03-10 03:20:14] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-10 03:20:14] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-10 03:20:14] [INFO ] Invariant cache hit.
[2023-03-10 03:20:14] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2023-03-10 03:20:14] [INFO ] Invariant cache hit.
[2023-03-10 03:20:14] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/146 places, 147/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 480 ms. Remains : 126/146 places, 147/169 transitions.
Stuttering acceptance computed with spot in 409 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 2}, { cond=(NOT p1), acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={} source=7 dest: 3}, { cond=p1, acceptance={} source=7 dest: 4}]], initial=5, aps=[p1:(AND (EQ s59 1) (EQ s125 1)), p2:(OR (EQ s91 0) (EQ s125 0)), p0:(AND (EQ s61 1) (EQ s125 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 246 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-08 finished in 919 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U X((X(X(G(p1)))||(G(p2) U !p1)))))'
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 169/169 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 135 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 135 transition count 158
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 130 transition count 152
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 130 transition count 152
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 128 transition count 150
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 128 transition count 150
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 126 transition count 147
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 126 transition count 147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 125 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 125 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 124 transition count 145
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 124 transition count 145
Applied a total of 44 rules in 12 ms. Remains 124 /146 variables (removed 22) and now considering 145/169 (removed 24) transitions.
// Phase 1: matrix 145 rows 124 cols
[2023-03-10 03:20:15] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-10 03:20:15] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-10 03:20:15] [INFO ] Invariant cache hit.
[2023-03-10 03:20:15] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-10 03:20:15] [INFO ] Invariant cache hit.
[2023-03-10 03:20:15] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/146 places, 145/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 323 ms. Remains : 124/146 places, 145/169 transitions.
Stuttering acceptance computed with spot in 516 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), p0, (AND p0 (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 p2), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1 p2), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=6 dest: 8}], [{ cond=p0, acceptance={0} source=7 dest: 7}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND p0 p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s33 1) (EQ s119 1)), p1:(EQ s120 1), p2:(EQ s73 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 448 ms.
Product exploration explored 100000 steps with 50000 reset in 320 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Graph (complete) has 248 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 24 stabilizing places and 24 stable transitions
Detected a total of 24/124 stabilizing places and 24/145 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 12 factoid took 629 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-07b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-09 finished in 2275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U (p1 U !p0)))'
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 169/169 transitions.
Graph (complete) has 282 edges and 146 vertex of which 145 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 144 transition count 142
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 119 transition count 142
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 51 place count 119 transition count 122
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 91 place count 99 transition count 122
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 98 place count 92 transition count 114
Iterating global reduction 2 with 7 rules applied. Total rules applied 105 place count 92 transition count 114
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 108 place count 89 transition count 110
Iterating global reduction 2 with 3 rules applied. Total rules applied 111 place count 89 transition count 110
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 113 place count 87 transition count 107
Iterating global reduction 2 with 2 rules applied. Total rules applied 115 place count 87 transition count 107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 86 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 86 transition count 106
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 183 place count 53 transition count 73
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 188 place count 48 transition count 63
Iterating global reduction 2 with 5 rules applied. Total rules applied 193 place count 48 transition count 63
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 198 place count 43 transition count 58
Iterating global reduction 2 with 5 rules applied. Total rules applied 203 place count 43 transition count 58
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 208 place count 38 transition count 48
Iterating global reduction 2 with 5 rules applied. Total rules applied 213 place count 38 transition count 48
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 218 place count 33 transition count 43
Iterating global reduction 2 with 5 rules applied. Total rules applied 223 place count 33 transition count 43
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 228 place count 28 transition count 33
Iterating global reduction 2 with 5 rules applied. Total rules applied 233 place count 28 transition count 33
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 238 place count 23 transition count 28
Iterating global reduction 2 with 5 rules applied. Total rules applied 243 place count 23 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 244 place count 23 transition count 27
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 245 place count 23 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 247 place count 21 transition count 25
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 249 place count 20 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 250 place count 19 transition count 24
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 250 place count 19 transition count 21
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 256 place count 16 transition count 21
Applied a total of 256 rules in 53 ms. Remains 16 /146 variables (removed 130) and now considering 21/169 (removed 148) transitions.
[2023-03-10 03:20:17] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
// Phase 1: matrix 19 rows 16 cols
[2023-03-10 03:20:17] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-10 03:20:17] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-10 03:20:17] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
[2023-03-10 03:20:17] [INFO ] Invariant cache hit.
[2023-03-10 03:20:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 03:20:17] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-10 03:20:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 03:20:17] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
[2023-03-10 03:20:17] [INFO ] Invariant cache hit.
[2023-03-10 03:20:17] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/146 places, 21/169 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 190 ms. Remains : 16/146 places, 21/169 transitions.
Stuttering acceptance computed with spot in 193 ms :[p0, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s13 1), p1:(EQ s2 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 36380 reset in 268 ms.
Product exploration explored 100000 steps with 36311 reset in 354 ms.
Computed a total of 12 stabilizing places and 14 stable transitions
Computed a total of 12 stabilizing places and 14 stable transitions
Detected a total of 12/16 stabilizing places and 14/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 254 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[p0, (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 303 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[p0, (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[p0, (NOT p0)]
[2023-03-10 03:20:19] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
[2023-03-10 03:20:19] [INFO ] Invariant cache hit.
[2023-03-10 03:20:19] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-10 03:20:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:20:19] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-10 03:20:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:20:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-10 03:20:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:20:19] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-10 03:20:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 03:20:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-10 03:20:19] [INFO ] Computed and/alt/rep : 19/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-10 03:20:19] [INFO ] Added : 3 causal constraints over 1 iterations in 44 ms. Result :sat
Could not prove EG p0
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-03-10 03:20:19] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
[2023-03-10 03:20:19] [INFO ] Invariant cache hit.
[2023-03-10 03:20:19] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-10 03:20:19] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
[2023-03-10 03:20:19] [INFO ] Invariant cache hit.
[2023-03-10 03:20:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 03:20:19] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2023-03-10 03:20:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 03:20:19] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
[2023-03-10 03:20:19] [INFO ] Invariant cache hit.
[2023-03-10 03:20:19] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 200 ms. Remains : 16/16 places, 21/21 transitions.
Computed a total of 12 stabilizing places and 14 stable transitions
Computed a total of 12 stabilizing places and 14 stable transitions
Detected a total of 12/16 stabilizing places and 14/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p1) p0)), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 341 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[p0, (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p1) p0)), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 448 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[p0, (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[p0, (NOT p0)]
[2023-03-10 03:20:21] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
[2023-03-10 03:20:21] [INFO ] Invariant cache hit.
[2023-03-10 03:20:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-10 03:20:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:20:21] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-10 03:20:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:20:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-10 03:20:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:20:21] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-10 03:20:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 03:20:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-10 03:20:21] [INFO ] Computed and/alt/rep : 19/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 03:20:21] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 99 ms :[p0, (NOT p0)]
Product exploration explored 100000 steps with 36440 reset in 211 ms.
Product exploration explored 100000 steps with 36238 reset in 186 ms.
Built C files in :
/tmp/ltsmin1972465696408852635
[2023-03-10 03:20:21] [INFO ] Computing symmetric may disable matrix : 21 transitions.
[2023-03-10 03:20:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 03:20:21] [INFO ] Computing symmetric may enable matrix : 21 transitions.
[2023-03-10 03:20:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 03:20:21] [INFO ] Computing Do-Not-Accords matrix : 21 transitions.
[2023-03-10 03:20:21] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 03:20:21] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1972465696408852635
Running compilation step : cd /tmp/ltsmin1972465696408852635;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 592 ms.
Running link step : cd /tmp/ltsmin1972465696408852635;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin1972465696408852635;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11133986946499298334.hoa' '--buchi-type=spotba'
LTSmin run took 141 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-10 finished in 5183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X((p1 U p2))))))'
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 169/169 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 135 transition count 157
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 135 transition count 157
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 129 transition count 150
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 129 transition count 150
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 126 transition count 147
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 126 transition count 147
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 124 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 124 transition count 144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 123 transition count 143
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 123 transition count 143
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 122 transition count 142
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 122 transition count 142
Applied a total of 48 rules in 7 ms. Remains 122 /146 variables (removed 24) and now considering 142/169 (removed 27) transitions.
// Phase 1: matrix 142 rows 122 cols
[2023-03-10 03:20:22] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-10 03:20:22] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-10 03:20:22] [INFO ] Invariant cache hit.
[2023-03-10 03:20:22] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2023-03-10 03:20:22] [INFO ] Invariant cache hit.
[2023-03-10 03:20:23] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 122/146 places, 142/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 457 ms. Remains : 122/146 places, 142/169 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s87 1), p2:(AND (NEQ s75 1) (EQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 230 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-12 finished in 624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U !p0))'
Support contains 1 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 169/169 transitions.
Graph (complete) has 282 edges and 146 vertex of which 145 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 144 transition count 140
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 117 transition count 140
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 55 place count 117 transition count 121
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 93 place count 98 transition count 121
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 101 place count 90 transition count 112
Iterating global reduction 2 with 8 rules applied. Total rules applied 109 place count 90 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 109 place count 90 transition count 111
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 89 transition count 111
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 114 place count 86 transition count 107
Iterating global reduction 2 with 3 rules applied. Total rules applied 117 place count 86 transition count 107
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 84 transition count 104
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 84 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 83 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 83 transition count 103
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 187 place count 51 transition count 71
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 193 place count 45 transition count 59
Iterating global reduction 2 with 6 rules applied. Total rules applied 199 place count 45 transition count 59
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 205 place count 39 transition count 53
Iterating global reduction 2 with 6 rules applied. Total rules applied 211 place count 39 transition count 53
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 217 place count 33 transition count 41
Iterating global reduction 2 with 6 rules applied. Total rules applied 223 place count 33 transition count 41
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 229 place count 27 transition count 35
Iterating global reduction 2 with 6 rules applied. Total rules applied 235 place count 27 transition count 35
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 241 place count 21 transition count 23
Iterating global reduction 2 with 6 rules applied. Total rules applied 247 place count 21 transition count 23
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 253 place count 15 transition count 17
Iterating global reduction 2 with 6 rules applied. Total rules applied 259 place count 15 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 260 place count 15 transition count 16
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 262 place count 13 transition count 14
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 13 edges and 11 vertex of which 8 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 267 place count 8 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 269 place count 6 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 271 place count 5 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 273 place count 4 transition count 7
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 274 place count 4 transition count 6
Applied a total of 274 rules in 45 ms. Remains 4 /146 variables (removed 142) and now considering 6/169 (removed 163) transitions.
[2023-03-10 03:20:23] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2023-03-10 03:20:23] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 03:20:23] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-10 03:20:23] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2023-03-10 03:20:23] [INFO ] Invariant cache hit.
[2023-03-10 03:20:23] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-10 03:20:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 03:20:23] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2023-03-10 03:20:23] [INFO ] Invariant cache hit.
[2023-03-10 03:20:23] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/146 places, 6/169 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 167 ms. Remains : 4/146 places, 6/169 transitions.
Stuttering acceptance computed with spot in 160 ms :[p0, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-13 finished in 342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(p1))&&G(p2))))'
Support contains 5 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 169/169 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 134 transition count 156
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 134 transition count 156
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 129 transition count 150
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 129 transition count 150
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 127 transition count 148
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 127 transition count 148
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 126 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 126 transition count 147
Applied a total of 40 rules in 8 ms. Remains 126 /146 variables (removed 20) and now considering 147/169 (removed 22) transitions.
// Phase 1: matrix 147 rows 126 cols
[2023-03-10 03:20:23] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-10 03:20:23] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-10 03:20:23] [INFO ] Invariant cache hit.
[2023-03-10 03:20:24] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
[2023-03-10 03:20:24] [INFO ] Invariant cache hit.
[2023-03-10 03:20:24] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/146 places, 147/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 858 ms. Remains : 126/146 places, 147/169 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 3}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 3}, { cond=(OR (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p0:(AND (EQ s33 1) (EQ s122 1) (EQ s102 1) (EQ s122 1)), p2:(AND (EQ s42 1) (EQ s82 1) (EQ s122 1)), p1:(AND (EQ s82 1) (EQ s122 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, 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-07b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-14 finished in 1172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p1)))'
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 169/169 transitions.
Graph (complete) has 282 edges and 146 vertex of which 145 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 144 transition count 140
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 117 transition count 140
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 55 place count 117 transition count 120
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 95 place count 97 transition count 120
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 102 place count 90 transition count 113
Iterating global reduction 2 with 7 rules applied. Total rules applied 109 place count 90 transition count 113
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 109 place count 90 transition count 112
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 89 transition count 112
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 113 place count 87 transition count 109
Iterating global reduction 2 with 2 rules applied. Total rules applied 115 place count 87 transition count 109
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 117 place count 85 transition count 106
Iterating global reduction 2 with 2 rules applied. Total rules applied 119 place count 85 transition count 106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 84 transition count 105
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 84 transition count 105
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 185 place count 52 transition count 73
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 190 place count 47 transition count 63
Iterating global reduction 2 with 5 rules applied. Total rules applied 195 place count 47 transition count 63
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 200 place count 42 transition count 58
Iterating global reduction 2 with 5 rules applied. Total rules applied 205 place count 42 transition count 58
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 210 place count 37 transition count 48
Iterating global reduction 2 with 5 rules applied. Total rules applied 215 place count 37 transition count 48
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 220 place count 32 transition count 43
Iterating global reduction 2 with 5 rules applied. Total rules applied 225 place count 32 transition count 43
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 230 place count 27 transition count 33
Iterating global reduction 2 with 5 rules applied. Total rules applied 235 place count 27 transition count 33
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 239 place count 23 transition count 29
Iterating global reduction 2 with 4 rules applied. Total rules applied 243 place count 23 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 244 place count 23 transition count 28
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 246 place count 21 transition count 26
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 23 edges and 19 vertex of which 16 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 253 place count 16 transition count 19
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 258 place count 12 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 262 place count 10 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 263 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 265 place count 8 transition count 13
Applied a total of 265 rules in 46 ms. Remains 8 /146 variables (removed 138) and now considering 13/169 (removed 156) transitions.
[2023-03-10 03:20:24] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 8 cols
[2023-03-10 03:20:24] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 03:20:24] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-10 03:20:24] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2023-03-10 03:20:24] [INFO ] Invariant cache hit.
[2023-03-10 03:20:24] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2023-03-10 03:20:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 03:20:24] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2023-03-10 03:20:24] [INFO ] Invariant cache hit.
[2023-03-10 03:20:25] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/146 places, 13/169 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 307 ms. Remains : 8/146 places, 13/169 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s3 1), p0:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-15 finished in 529 ms.
All properties solved by simple procedures.
Total runtime 18005 ms.

BK_STOP 1678418426360

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-07b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-5348"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-07b, 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 r133-smll-167819410700308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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