Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260109700028.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................
=====================================================================
Generated by BenchKit 2-4028
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 r078-tall-165260109700028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 6.9K Apr 30 07:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 30 07:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 07:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 30 07:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 54K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1652628878783

Running Version 202205111006
[2022-05-15 15:34:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 15:34:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 15:34:40] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2022-05-15 15:34:40] [INFO ] Transformed 212 places.
[2022-05-15 15:34:40] [INFO ] Transformed 224 transitions.
[2022-05-15 15:34:40] [INFO ] Found NUPN structural information;
[2022-05-15 15:34:40] [INFO ] Parsed PT model containing 212 places and 224 transitions in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 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 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 46 place count 166 transition count 192
Iterating global reduction 1 with 32 rules applied. Total rules applied 78 place count 166 transition count 192
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 85 place count 159 transition count 185
Iterating global reduction 1 with 7 rules applied. Total rules applied 92 place count 159 transition count 185
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 97 place count 154 transition count 180
Iterating global reduction 1 with 5 rules applied. Total rules applied 102 place count 154 transition count 180
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 106 place count 150 transition count 176
Iterating global reduction 1 with 4 rules applied. Total rules applied 110 place count 150 transition count 176
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 113 place count 147 transition count 170
Iterating global reduction 1 with 3 rules applied. Total rules applied 116 place count 147 transition count 170
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 119 place count 144 transition count 167
Iterating global reduction 1 with 3 rules applied. Total rules applied 122 place count 144 transition count 167
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 125 place count 141 transition count 164
Iterating global reduction 1 with 3 rules applied. Total rules applied 128 place count 141 transition count 164
Applied a total of 128 rules in 70 ms. Remains 141 /212 variables (removed 71) and now considering 164/224 (removed 60) transitions.
// Phase 1: matrix 164 rows 141 cols
[2022-05-15 15:34:40] [INFO ] Computed 2 place invariants in 11 ms
[2022-05-15 15:34:40] [INFO ] Implicit Places using invariants in 176 ms returned []
// Phase 1: matrix 164 rows 141 cols
[2022-05-15 15:34:40] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-15 15:34:40] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
// Phase 1: matrix 164 rows 141 cols
[2022-05-15 15:34:40] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-15 15:34:40] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/212 places, 164/224 transitions.
Finished structural reductions, in 1 iterations. Remains : 141/212 places, 164/224 transitions.
Support contains 22 out of 141 places after structural reductions.
[2022-05-15 15:34:40] [INFO ] Flatten gal took : 51 ms
[2022-05-15 15:34:41] [INFO ] Flatten gal took : 16 ms
[2022-05-15 15:34:41] [INFO ] Input system was already deterministic with 164 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 19) seen :18
Finished Best-First random walk after 8615 steps, including 7 resets, run visited all 1 properties in 15 ms. (steps per millisecond=574 )
FORMULA DiscoveryGPU-PT-07b-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 25 stabilizing places and 25 stable transitions
Graph (complete) has 277 edges and 141 vertex of which 140 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p0)&&p1))&&X((X(p2)||X(p1)))))'
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 164/164 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 134 transition count 157
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 134 transition count 157
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 132 transition count 154
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 132 transition count 154
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 130 transition count 152
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 130 transition count 152
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 128 transition count 149
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 128 transition count 149
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 127 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 127 transition count 148
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 126 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 126 transition count 147
Applied a total of 30 rules in 23 ms. Remains 126 /141 variables (removed 15) and now considering 147/164 (removed 17) transitions.
// Phase 1: matrix 147 rows 126 cols
[2022-05-15 15:34:41] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:34:41] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 147 rows 126 cols
[2022-05-15 15:34:41] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:41] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
// Phase 1: matrix 147 rows 126 cols
[2022-05-15 15:34:41] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:41] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/141 places, 147/164 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/141 places, 147/164 transitions.
Stuttering acceptance computed with spot in 375 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s13 1), p0:(EQ s88 1), p2:(OR (EQ s55 0) (EQ s122 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 176 steps with 0 reset in 8 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-01 finished in 685 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(F(p0))&&F(p0)))))'
Support contains 1 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 164/164 transitions.
Graph (complete) has 277 edges and 141 vertex of which 140 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 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 139 transition count 139
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 116 transition count 139
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 47 place count 116 transition count 119
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 87 place count 96 transition count 119
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 90 place count 93 transition count 116
Iterating global reduction 2 with 3 rules applied. Total rules applied 93 place count 93 transition count 116
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 92 transition count 115
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 92 transition count 115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 91 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 91 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 90 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 90 transition count 112
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 173 place count 53 transition count 75
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 179 place count 47 transition count 64
Iterating global reduction 2 with 6 rules applied. Total rules applied 185 place count 47 transition count 64
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 190 place count 42 transition count 57
Iterating global reduction 2 with 5 rules applied. Total rules applied 195 place count 42 transition count 57
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 200 place count 37 transition count 48
Iterating global reduction 2 with 5 rules applied. Total rules applied 205 place count 37 transition count 48
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 210 place count 32 transition count 42
Iterating global reduction 2 with 5 rules applied. Total rules applied 215 place count 32 transition count 42
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 220 place count 27 transition count 33
Iterating global reduction 2 with 5 rules applied. Total rules applied 225 place count 27 transition count 33
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 230 place count 22 transition count 27
Iterating global reduction 2 with 5 rules applied. Total rules applied 235 place count 22 transition count 27
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 237 place count 20 transition count 24
Iterating global reduction 2 with 2 rules applied. Total rules applied 239 place count 20 transition count 24
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 240 place count 19 transition count 23
Iterating global reduction 2 with 1 rules applied. Total rules applied 241 place count 19 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 242 place count 19 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 244 place count 17 transition count 20
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 17 edges and 15 vertex of which 12 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 250 place count 12 transition count 14
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 253 place count 9 transition count 14
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 257 place count 7 transition count 12
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 258 place count 7 transition count 11
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 260 place count 5 transition count 9
Applied a total of 260 rules in 40 ms. Remains 5 /141 variables (removed 136) and now considering 9/164 (removed 155) transitions.
[2022-05-15 15:34:42] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2022-05-15 15:34:42] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:34:42] [INFO ] Implicit Places using invariants in 14 ms returned []
[2022-05-15 15:34:42] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2022-05-15 15:34:42] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:34:42] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2022-05-15 15:34:42] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:34:42] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2022-05-15 15:34:42] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 15:34:42] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/141 places, 9/164 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/141 places, 9/164 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s3 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-02 finished in 287 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(X(X(p0))) U X(X(p1))))))'
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 164/164 transitions.
Graph (complete) has 277 edges and 141 vertex of which 140 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 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 139 transition count 140
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 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 45 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 85 place count 97 transition count 120
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 94 transition count 117
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 94 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 93 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 93 transition count 116
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 92 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 92 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 91 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 91 transition count 113
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 167 place count 56 transition count 78
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 173 place count 50 transition count 67
Iterating global reduction 2 with 6 rules applied. Total rules applied 179 place count 50 transition count 67
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 185 place count 44 transition count 59
Iterating global reduction 2 with 6 rules applied. Total rules applied 191 place count 44 transition count 59
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 197 place count 38 transition count 48
Iterating global reduction 2 with 6 rules applied. Total rules applied 203 place count 38 transition count 48
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 209 place count 32 transition count 41
Iterating global reduction 2 with 6 rules applied. Total rules applied 215 place count 32 transition count 41
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 220 place count 27 transition count 32
Iterating global reduction 2 with 5 rules applied. Total rules applied 225 place count 27 transition count 32
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 230 place count 22 transition count 26
Iterating global reduction 2 with 5 rules applied. Total rules applied 235 place count 22 transition count 26
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 237 place count 20 transition count 23
Iterating global reduction 2 with 2 rules applied. Total rules applied 239 place count 20 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 240 place count 19 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 241 place count 19 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 242 place count 19 transition count 21
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 243 place count 19 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 245 place count 17 transition count 19
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 18 edges and 15 vertex of which 12 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 2 with 4 rules applied. Total rules applied 249 place count 12 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 250 place count 11 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 250 place count 11 transition count 14
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 252 place count 10 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 256 place count 8 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 258 place count 8 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 259 place count 7 transition count 10
Applied a total of 259 rules in 25 ms. Remains 7 /141 variables (removed 134) and now considering 10/164 (removed 154) transitions.
[2022-05-15 15:34:42] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 7 cols
[2022-05-15 15:34:42] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:34:42] [INFO ] Implicit Places using invariants in 13 ms returned []
[2022-05-15 15:34:42] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 7 cols
[2022-05-15 15:34:42] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 15:34:42] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2022-05-15 15:34:42] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:34:42] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 7 cols
[2022-05-15 15:34:42] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:34:42] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/141 places, 10/164 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/141 places, 10/164 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s1 1), p0:(EQ s5 1)], nbAcceptance=2, 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 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-03 finished in 232 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&F(X(p0)))))'
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 164/164 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 133 transition count 156
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 133 transition count 156
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 131 transition count 153
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 131 transition count 153
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 129 transition count 150
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 129 transition count 150
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 127 transition count 148
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 127 transition count 148
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 126 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 126 transition count 147
Applied a total of 30 rules in 18 ms. Remains 126 /141 variables (removed 15) and now considering 147/164 (removed 17) transitions.
// Phase 1: matrix 147 rows 126 cols
[2022-05-15 15:34:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:42] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 147 rows 126 cols
[2022-05-15 15:34:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:42] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
// Phase 1: matrix 147 rows 126 cols
[2022-05-15 15:34:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:42] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/141 places, 147/164 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/141 places, 147/164 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s60 1) (EQ s122 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 215 steps with 0 reset in 4 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-05 finished in 312 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((p0 U G((X(p1)||F(p2)))))))'
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 164/164 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 132 transition count 155
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 132 transition count 155
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 129 transition count 151
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 129 transition count 151
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 126 transition count 147
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 126 transition count 147
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 123 transition count 143
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 123 transition count 143
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 121 transition count 141
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 121 transition count 141
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 120 transition count 140
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 120 transition count 140
Applied a total of 42 rules in 14 ms. Remains 120 /141 variables (removed 21) and now considering 140/164 (removed 24) transitions.
// Phase 1: matrix 140 rows 120 cols
[2022-05-15 15:34:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:43] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 140 rows 120 cols
[2022-05-15 15:34:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:43] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
// Phase 1: matrix 140 rows 120 cols
[2022-05-15 15:34:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:43] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/141 places, 140/164 transitions.
Finished structural reductions, in 1 iterations. Remains : 120/141 places, 140/164 transitions.
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), false]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 3}, { cond=(NOT p2), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s84 1), p2:(EQ s87 1), p1:(EQ s42 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 451 steps with 1 reset in 3 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-08 finished in 567 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U X(p1)))'
Support contains 5 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 164/164 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 132 transition count 155
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 132 transition count 155
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 129 transition count 151
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 129 transition count 151
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 127 transition count 148
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 127 transition count 148
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 125 transition count 145
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 125 transition count 145
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 123 transition count 143
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 123 transition count 143
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 122 transition count 142
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 122 transition count 142
Applied a total of 38 rules in 11 ms. Remains 122 /141 variables (removed 19) and now considering 142/164 (removed 22) transitions.
// Phase 1: matrix 142 rows 122 cols
[2022-05-15 15:34:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:43] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 142 rows 122 cols
[2022-05-15 15:34:43] [INFO ] Computed 2 place invariants in 6 ms
[2022-05-15 15:34:43] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
// Phase 1: matrix 142 rows 122 cols
[2022-05-15 15:34:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:43] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 122/141 places, 142/164 transitions.
Finished structural reductions, in 1 iterations. Remains : 122/141 places, 142/164 transitions.
Stuttering acceptance computed with spot in 90 ms :[p1, p1, true]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s97 1) (EQ s113 1) (EQ s118 1)), p1:(AND (EQ s45 1) (EQ s121 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 243 ms.
Product exploration explored 100000 steps with 50000 reset in 185 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Graph (complete) has 244 edges and 122 vertex of which 121 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 6 factoid took 112 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-11 finished in 861 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(X(G(p0))))))'
Support contains 1 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 164/164 transitions.
Graph (complete) has 277 edges and 141 vertex of which 140 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 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 139 transition count 139
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 116 transition count 139
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 47 place count 116 transition count 119
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 87 place count 96 transition count 119
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 94 transition count 117
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 94 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 93 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 93 transition count 116
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 92 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 92 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 91 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 91 transition count 113
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 173 place count 53 transition count 75
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 179 place count 47 transition count 64
Iterating global reduction 2 with 6 rules applied. Total rules applied 185 place count 47 transition count 64
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 191 place count 41 transition count 56
Iterating global reduction 2 with 6 rules applied. Total rules applied 197 place count 41 transition count 56
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 203 place count 35 transition count 45
Iterating global reduction 2 with 6 rules applied. Total rules applied 209 place count 35 transition count 45
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 215 place count 29 transition count 38
Iterating global reduction 2 with 6 rules applied. Total rules applied 221 place count 29 transition count 38
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 227 place count 23 transition count 27
Iterating global reduction 2 with 6 rules applied. Total rules applied 233 place count 23 transition count 27
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 239 place count 17 transition count 20
Iterating global reduction 2 with 6 rules applied. Total rules applied 245 place count 17 transition count 20
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 247 place count 15 transition count 17
Iterating global reduction 2 with 2 rules applied. Total rules applied 249 place count 15 transition count 17
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 250 place count 14 transition count 16
Iterating global reduction 2 with 1 rules applied. Total rules applied 251 place count 14 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 252 place count 14 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 254 place count 12 transition count 13
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 256 place count 11 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 257 place count 10 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 257 place count 10 transition count 10
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 261 place count 8 transition count 10
Applied a total of 261 rules in 20 ms. Remains 8 /141 variables (removed 133) and now considering 10/164 (removed 154) transitions.
[2022-05-15 15:34:44] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
// Phase 1: matrix 9 rows 8 cols
[2022-05-15 15:34:44] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:34:44] [INFO ] Implicit Places using invariants in 19 ms returned []
[2022-05-15 15:34:44] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
// Phase 1: matrix 9 rows 8 cols
[2022-05-15 15:34:44] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:34:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 15:34:44] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2022-05-15 15:34:44] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:34:44] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
// Phase 1: matrix 9 rows 8 cols
[2022-05-15 15:34:44] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:34:44] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/141 places, 10/164 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/141 places, 10/164 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-12 finished in 155 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(G((G(p1)&&p2))&&G(p1)))))'
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 164/164 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 134 transition count 157
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 134 transition count 157
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 132 transition count 155
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 132 transition count 155
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 130 transition count 152
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 130 transition count 152
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 128 transition count 149
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 128 transition count 149
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 126 transition count 147
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 126 transition count 147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 125 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 125 transition count 146
Applied a total of 32 rules in 11 ms. Remains 125 /141 variables (removed 16) and now considering 146/164 (removed 18) transitions.
// Phase 1: matrix 146 rows 125 cols
[2022-05-15 15:34:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:44] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 146 rows 125 cols
[2022-05-15 15:34:44] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-15 15:34:44] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
// Phase 1: matrix 146 rows 125 cols
[2022-05-15 15:34:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:44] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/141 places, 146/164 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/141 places, 146/164 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s58 1), p0:(EQ s9 0), p2:(EQ s46 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Product exploration explored 100000 steps with 50000 reset in 223 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Graph (complete) has 249 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (NOT (AND p1 p2 (NOT p0)))), true, (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 p2 (NOT p0))))
Knowledge based reduction with 6 factoid took 113 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-13 finished in 865 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0) U p0)))'
Support contains 1 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 164/164 transitions.
Graph (complete) has 277 edges and 141 vertex of which 140 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 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 139 transition count 140
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 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 45 place count 117 transition count 120
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 85 place count 97 transition count 120
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 94 transition count 117
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 94 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 93 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 93 transition count 116
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 92 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 92 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 91 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 91 transition count 113
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 171 place count 54 transition count 76
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 177 place count 48 transition count 65
Iterating global reduction 2 with 6 rules applied. Total rules applied 183 place count 48 transition count 65
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 189 place count 42 transition count 57
Iterating global reduction 2 with 6 rules applied. Total rules applied 195 place count 42 transition count 57
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 201 place count 36 transition count 46
Iterating global reduction 2 with 6 rules applied. Total rules applied 207 place count 36 transition count 46
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 213 place count 30 transition count 39
Iterating global reduction 2 with 6 rules applied. Total rules applied 219 place count 30 transition count 39
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 225 place count 24 transition count 28
Iterating global reduction 2 with 6 rules applied. Total rules applied 231 place count 24 transition count 28
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 236 place count 19 transition count 23
Iterating global reduction 2 with 5 rules applied. Total rules applied 241 place count 19 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 242 place count 18 transition count 21
Iterating global reduction 2 with 1 rules applied. Total rules applied 243 place count 18 transition count 21
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 244 place count 17 transition count 20
Iterating global reduction 2 with 1 rules applied. Total rules applied 245 place count 17 transition count 20
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 17 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 247 place count 17 transition count 19
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 249 place count 15 transition count 17
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 15 edges and 13 vertex of which 10 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 2 with 4 rules applied. Total rules applied 253 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 254 place count 9 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 254 place count 9 transition count 12
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 256 place count 8 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 260 place count 6 transition count 13
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 263 place count 6 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 264 place count 5 transition count 9
Applied a total of 264 rules in 27 ms. Remains 5 /141 variables (removed 136) and now considering 9/164 (removed 155) transitions.
[2022-05-15 15:34:45] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 5 cols
[2022-05-15 15:34:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:34:45] [INFO ] Implicit Places using invariants in 14 ms returned []
[2022-05-15 15:34:45] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 5 cols
[2022-05-15 15:34:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:34:45] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2022-05-15 15:34:45] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:34:45] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 5 cols
[2022-05-15 15:34:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:34:45] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/141 places, 9/164 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/141 places, 9/164 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-15 finished in 145 ms.
All properties solved by simple procedures.
Total runtime 5730 ms.

BK_STOP 1652628885759

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-4028"
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 r078-tall-165260109700028"
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 ;