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.r135-smll-167819414000292.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 lolaxred
Input is DiscoveryGPU-PT-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819414000292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.3K Feb 25 13:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 13:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 13:22 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 26K 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 16K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 13:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 13:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 13:23 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 46K 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-06b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678314649811

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-06b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 22:30:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 22:30:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 22:30:53] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2023-03-08 22:30:53] [INFO ] Transformed 184 places.
[2023-03-08 22:30:53] [INFO ] Transformed 194 transitions.
[2023-03-08 22:30:53] [INFO ] Found NUPN structural information;
[2023-03-08 22:30:53] [INFO ] Parsed PT model containing 184 places and 194 transitions and 503 arcs in 275 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 7 formulas.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 172 transition count 194
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 40 place count 144 transition count 166
Iterating global reduction 1 with 28 rules applied. Total rules applied 68 place count 144 transition count 166
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 75 place count 137 transition count 159
Iterating global reduction 1 with 7 rules applied. Total rules applied 82 place count 137 transition count 159
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 85 place count 134 transition count 156
Iterating global reduction 1 with 3 rules applied. Total rules applied 88 place count 134 transition count 156
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 91 place count 131 transition count 153
Iterating global reduction 1 with 3 rules applied. Total rules applied 94 place count 131 transition count 153
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 130 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 130 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 129 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 129 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 128 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 128 transition count 149
Applied a total of 100 rules in 150 ms. Remains 128 /184 variables (removed 56) and now considering 149/194 (removed 45) transitions.
// Phase 1: matrix 149 rows 128 cols
[2023-03-08 22:30:54] [INFO ] Computed 2 place invariants in 20 ms
[2023-03-08 22:30:54] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-03-08 22:30:54] [INFO ] Invariant cache hit.
[2023-03-08 22:30:55] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
[2023-03-08 22:30:55] [INFO ] Invariant cache hit.
[2023-03-08 22:30:55] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/184 places, 149/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1113 ms. Remains : 128/184 places, 149/194 transitions.
Support contains 21 out of 128 places after structural reductions.
[2023-03-08 22:30:55] [INFO ] Flatten gal took : 80 ms
[2023-03-08 22:30:55] [INFO ] Flatten gal took : 33 ms
[2023-03-08 22:30:55] [INFO ] Input system was already deterministic with 149 transitions.
Support contains 20 out of 128 places (down from 21) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 17) seen :16
Finished Best-First random walk after 1786 steps, including 1 resets, run visited all 1 properties in 10 ms. (steps per millisecond=178 )
Computed a total of 20 stabilizing places and 20 stable transitions
Graph (complete) has 249 edges and 128 vertex of which 125 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 149/149 transitions.
Graph (complete) has 249 edges and 128 vertex of which 125 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 124 transition count 126
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 105 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 104 transition count 125
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 41 place count 104 transition count 105
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 81 place count 84 transition count 105
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 84 place count 81 transition count 101
Iterating global reduction 3 with 3 rules applied. Total rules applied 87 place count 81 transition count 101
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 79 transition count 99
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 79 transition count 99
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 78 transition count 97
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 78 transition count 97
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 94 place count 77 transition count 96
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 77 transition count 96
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 155 place count 47 transition count 66
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 160 place count 42 transition count 57
Iterating global reduction 3 with 5 rules applied. Total rules applied 165 place count 42 transition count 57
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 170 place count 37 transition count 50
Iterating global reduction 3 with 5 rules applied. Total rules applied 175 place count 37 transition count 50
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 179 place count 33 transition count 43
Iterating global reduction 3 with 4 rules applied. Total rules applied 183 place count 33 transition count 43
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 187 place count 29 transition count 38
Iterating global reduction 3 with 4 rules applied. Total rules applied 191 place count 29 transition count 38
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 195 place count 25 transition count 31
Iterating global reduction 3 with 4 rules applied. Total rules applied 199 place count 25 transition count 31
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 203 place count 21 transition count 26
Iterating global reduction 3 with 4 rules applied. Total rules applied 207 place count 21 transition count 26
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 208 place count 20 transition count 25
Iterating global reduction 3 with 1 rules applied. Total rules applied 209 place count 20 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 210 place count 20 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 212 place count 18 transition count 22
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 19 edges and 16 vertex of which 13 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 3 with 7 rules applied. Total rules applied 219 place count 13 transition count 15
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 223 place count 9 transition count 15
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 5 with 4 rules applied. Total rules applied 227 place count 7 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 228 place count 7 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 230 place count 5 transition count 10
Applied a total of 230 rules in 110 ms. Remains 5 /128 variables (removed 123) and now considering 10/149 (removed 139) transitions.
[2023-03-08 22:30:56] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2023-03-08 22:30:56] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-08 22:30:56] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-08 22:30:56] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2023-03-08 22:30:56] [INFO ] Invariant cache hit.
[2023-03-08 22:30:56] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-08 22:30:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 22:30:56] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2023-03-08 22:30:56] [INFO ] Invariant cache hit.
[2023-03-08 22:30:56] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/128 places, 10/149 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 223 ms. Remains : 5/128 places, 10/149 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s4 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 2 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-01 finished in 583 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)&&F(p1)))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 149/149 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 122 transition count 143
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 122 transition count 143
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 119 transition count 139
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 119 transition count 139
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 117 transition count 137
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 117 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 115 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 115 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 114 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 114 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 113 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 113 transition count 132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 112 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 112 transition count 131
Applied a total of 32 rules in 31 ms. Remains 112 /128 variables (removed 16) and now considering 131/149 (removed 18) transitions.
// Phase 1: matrix 131 rows 112 cols
[2023-03-08 22:30:57] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-08 22:30:57] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-08 22:30:57] [INFO ] Invariant cache hit.
[2023-03-08 22:30:57] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2023-03-08 22:30:57] [INFO ] Invariant cache hit.
[2023-03-08 22:30:57] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/128 places, 131/149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 455 ms. Remains : 112/128 places, 131/149 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s58 1), p0:(EQ s90 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-03 finished in 630 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&&X(p1))))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 149/149 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 120 transition count 140
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 120 transition count 140
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 116 transition count 135
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 116 transition count 135
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 112 transition count 130
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 112 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 109 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 109 transition count 127
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 107 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 107 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 106 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 106 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 105 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 105 transition count 122
Applied a total of 46 rules in 17 ms. Remains 105 /128 variables (removed 23) and now considering 122/149 (removed 27) transitions.
// Phase 1: matrix 122 rows 105 cols
[2023-03-08 22:30:57] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 22:30:57] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-08 22:30:57] [INFO ] Invariant cache hit.
[2023-03-08 22:30:57] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-08 22:30:57] [INFO ] Invariant cache hit.
[2023-03-08 22:30:58] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/128 places, 122/149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 388 ms. Remains : 105/128 places, 122/149 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s98 0), p1:(EQ s44 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 182 steps with 0 reset in 6 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-04 finished in 614 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((G(p1)&&p0))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 149/149 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 122 transition count 142
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 122 transition count 142
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 118 transition count 137
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 118 transition count 137
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 114 transition count 132
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 114 transition count 132
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 111 transition count 129
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 111 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 109 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 109 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 108 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 108 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 107 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 107 transition count 124
Applied a total of 42 rules in 23 ms. Remains 107 /128 variables (removed 21) and now considering 124/149 (removed 25) transitions.
// Phase 1: matrix 124 rows 107 cols
[2023-03-08 22:30:58] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 22:30:58] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-08 22:30:58] [INFO ] Invariant cache hit.
[2023-03-08 22:30:58] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2023-03-08 22:30:58] [INFO ] Invariant cache hit.
[2023-03-08 22:30:58] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 107/128 places, 124/149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 421 ms. Remains : 107/128 places, 124/149 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s49 0) (EQ s29 1) (EQ s68 0)), p1:(EQ s49 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 198 steps with 0 reset in 4 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-06 finished in 593 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 U p1))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 149/149 transitions.
Graph (complete) has 249 edges and 128 vertex of which 125 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 124 transition count 125
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 104 transition count 125
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 41 place count 104 transition count 107
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 77 place count 86 transition count 107
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 79 place count 84 transition count 104
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 84 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 83 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 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 147 place count 51 transition count 71
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 151 place count 47 transition count 64
Iterating global reduction 2 with 4 rules applied. Total rules applied 155 place count 47 transition count 64
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 159 place count 43 transition count 58
Iterating global reduction 2 with 4 rules applied. Total rules applied 163 place count 43 transition count 58
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 167 place count 39 transition count 51
Iterating global reduction 2 with 4 rules applied. Total rules applied 171 place count 39 transition count 51
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 175 place count 35 transition count 46
Iterating global reduction 2 with 4 rules applied. Total rules applied 179 place count 35 transition count 46
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 183 place count 31 transition count 39
Iterating global reduction 2 with 4 rules applied. Total rules applied 187 place count 31 transition count 39
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 191 place count 27 transition count 34
Iterating global reduction 2 with 4 rules applied. Total rules applied 195 place count 27 transition count 34
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 197 place count 25 transition count 31
Iterating global reduction 2 with 2 rules applied. Total rules applied 199 place count 25 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 200 place count 24 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 201 place count 24 transition count 30
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 202 place count 24 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 204 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 2 with 2 rules applied. Total rules applied 206 place count 21 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 207 place count 20 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 207 place count 20 transition count 24
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 211 place count 18 transition count 24
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 215 place count 16 transition count 22
Applied a total of 215 rules in 29 ms. Remains 16 /128 variables (removed 112) and now considering 22/149 (removed 127) transitions.
[2023-03-08 22:30:58] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
// Phase 1: matrix 20 rows 16 cols
[2023-03-08 22:30:58] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-08 22:30:59] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-08 22:30:59] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
[2023-03-08 22:30:59] [INFO ] Invariant cache hit.
[2023-03-08 22:30:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 22:30:59] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-08 22:30:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 22:30:59] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
[2023-03-08 22:30:59] [INFO ] Invariant cache hit.
[2023-03-08 22:30:59] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/128 places, 22/149 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137 ms. Remains : 16/128 places, 22/149 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s9 1), p0:(AND (EQ s13 1) (EQ s15 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 72 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-08 finished in 232 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' '!(!(p0 U !F((G(p2)&&p1))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 149/149 transitions.
Graph (complete) has 249 edges and 128 vertex of which 125 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 124 transition count 127
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 106 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 105 transition count 126
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 39 place count 105 transition count 107
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 77 place count 86 transition count 107
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 80 place count 83 transition count 103
Iterating global reduction 3 with 3 rules applied. Total rules applied 83 place count 83 transition count 103
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 81 transition count 101
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 81 transition count 101
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 80 transition count 99
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 80 transition count 99
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 79 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 79 transition count 98
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 149 place count 50 transition count 69
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 154 place count 45 transition count 60
Iterating global reduction 3 with 5 rules applied. Total rules applied 159 place count 45 transition count 60
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 164 place count 40 transition count 53
Iterating global reduction 3 with 5 rules applied. Total rules applied 169 place count 40 transition count 53
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 172 place count 37 transition count 48
Iterating global reduction 3 with 3 rules applied. Total rules applied 175 place count 37 transition count 48
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 178 place count 34 transition count 44
Iterating global reduction 3 with 3 rules applied. Total rules applied 181 place count 34 transition count 44
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 184 place count 31 transition count 39
Iterating global reduction 3 with 3 rules applied. Total rules applied 187 place count 31 transition count 39
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 190 place count 28 transition count 35
Iterating global reduction 3 with 3 rules applied. Total rules applied 193 place count 28 transition count 35
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 194 place count 27 transition count 34
Iterating global reduction 3 with 1 rules applied. Total rules applied 195 place count 27 transition count 34
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 27 transition count 33
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 197 place count 27 transition count 33
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 199 place count 25 transition count 31
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 201 place count 24 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 202 place count 23 transition count 30
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 202 place count 23 transition count 27
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 208 place count 20 transition count 27
Applied a total of 208 rules in 41 ms. Remains 20 /128 variables (removed 108) and now considering 27/149 (removed 122) transitions.
[2023-03-08 22:30:59] [INFO ] Flow matrix only has 24 transitions (discarded 3 similar events)
// Phase 1: matrix 24 rows 20 cols
[2023-03-08 22:30:59] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-08 22:30:59] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-08 22:30:59] [INFO ] Flow matrix only has 24 transitions (discarded 3 similar events)
[2023-03-08 22:30:59] [INFO ] Invariant cache hit.
[2023-03-08 22:30:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 22:30:59] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-08 22:30:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 22:30:59] [INFO ] Flow matrix only has 24 transitions (discarded 3 similar events)
[2023-03-08 22:30:59] [INFO ] Invariant cache hit.
[2023-03-08 22:30:59] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/128 places, 27/149 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152 ms. Remains : 20/128 places, 27/149 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s19 1)), p1:(AND (EQ s9 1) (EQ s17 1)), p2:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 57 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-10 finished in 296 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)))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 149/149 transitions.
Graph (complete) has 249 edges and 128 vertex of which 125 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 124 transition count 127
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 106 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 105 transition count 126
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 39 place count 105 transition count 106
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 79 place count 85 transition count 106
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 82 place count 82 transition count 102
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 82 transition count 102
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 87 place count 80 transition count 100
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 80 transition count 100
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 149 place count 50 transition count 70
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 153 place count 46 transition count 63
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 46 transition count 63
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 161 place count 42 transition count 57
Iterating global reduction 3 with 4 rules applied. Total rules applied 165 place count 42 transition count 57
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 169 place count 38 transition count 50
Iterating global reduction 3 with 4 rules applied. Total rules applied 173 place count 38 transition count 50
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 177 place count 34 transition count 45
Iterating global reduction 3 with 4 rules applied. Total rules applied 181 place count 34 transition count 45
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 184 place count 31 transition count 40
Iterating global reduction 3 with 3 rules applied. Total rules applied 187 place count 31 transition count 40
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 190 place count 28 transition count 36
Iterating global reduction 3 with 3 rules applied. Total rules applied 193 place count 28 transition count 36
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 195 place count 26 transition count 33
Iterating global reduction 3 with 2 rules applied. Total rules applied 197 place count 26 transition count 33
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 198 place count 25 transition count 32
Iterating global reduction 3 with 1 rules applied. Total rules applied 199 place count 25 transition count 32
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 200 place count 25 transition count 31
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 201 place count 25 transition count 31
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 203 place count 23 transition count 29
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 26 edges and 21 vertex of which 18 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 3 with 6 rules applied. Total rules applied 209 place count 18 transition count 23
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 212 place count 15 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 212 place count 15 transition count 22
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 214 place count 14 transition count 22
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 5 with 4 rules applied. Total rules applied 218 place count 12 transition count 20
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 220 place count 11 transition count 20
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 223 place count 11 transition count 17
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 226 place count 8 transition count 14
Applied a total of 226 rules in 46 ms. Remains 8 /128 variables (removed 120) and now considering 14/149 (removed 135) transitions.
[2023-03-08 22:30:59] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
// Phase 1: matrix 11 rows 8 cols
[2023-03-08 22:30:59] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-08 22:30:59] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-08 22:30:59] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2023-03-08 22:30:59] [INFO ] Invariant cache hit.
[2023-03-08 22:30:59] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-08 22:30:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 22:30:59] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2023-03-08 22:30:59] [INFO ] Invariant cache hit.
[2023-03-08 22:30:59] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/128 places, 14/149 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 8/128 places, 14/149 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-11 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:(OR (EQ s6 1) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-11 finished in 197 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))&&F(p1)))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 149/149 transitions.
Graph (complete) has 249 edges and 128 vertex of which 125 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 124 transition count 126
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 105 transition count 126
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 39 place count 105 transition count 107
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 77 place count 86 transition count 107
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 79 place count 84 transition count 104
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 84 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 83 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 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 147 place count 51 transition count 71
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 151 place count 47 transition count 64
Iterating global reduction 2 with 4 rules applied. Total rules applied 155 place count 47 transition count 64
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 158 place count 44 transition count 59
Iterating global reduction 2 with 3 rules applied. Total rules applied 161 place count 44 transition count 59
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 164 place count 41 transition count 54
Iterating global reduction 2 with 3 rules applied. Total rules applied 167 place count 41 transition count 54
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 170 place count 38 transition count 50
Iterating global reduction 2 with 3 rules applied. Total rules applied 173 place count 38 transition count 50
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 176 place count 35 transition count 45
Iterating global reduction 2 with 3 rules applied. Total rules applied 179 place count 35 transition count 45
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 182 place count 32 transition count 41
Iterating global reduction 2 with 3 rules applied. Total rules applied 185 place count 32 transition count 41
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 187 place count 30 transition count 38
Iterating global reduction 2 with 2 rules applied. Total rules applied 189 place count 30 transition count 38
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 190 place count 29 transition count 37
Iterating global reduction 2 with 1 rules applied. Total rules applied 191 place count 29 transition count 37
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 192 place count 29 transition count 36
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 194 place count 27 transition count 34
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 196 place count 26 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 197 place count 25 transition count 33
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 197 place count 25 transition count 30
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 203 place count 22 transition count 30
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 207 place count 20 transition count 28
Applied a total of 207 rules in 25 ms. Remains 20 /128 variables (removed 108) and now considering 28/149 (removed 121) transitions.
[2023-03-08 22:30:59] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
// Phase 1: matrix 24 rows 20 cols
[2023-03-08 22:30:59] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-08 22:30:59] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-08 22:30:59] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
[2023-03-08 22:30:59] [INFO ] Invariant cache hit.
[2023-03-08 22:30:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 22:30:59] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-08 22:30:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 22:30:59] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
[2023-03-08 22:30:59] [INFO ] Invariant cache hit.
[2023-03-08 22:30:59] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/128 places, 28/149 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 20/128 places, 28/149 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s8 1) (EQ s19 1)), p0:(EQ s14 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 79 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-12 finished in 287 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((p0&&(p1 U (p2||X((G(p3) U p1))))))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 149/149 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 122 transition count 142
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 122 transition count 142
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 119 transition count 138
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 119 transition count 138
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 116 transition count 134
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 116 transition count 134
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 114 transition count 132
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 114 transition count 132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 113 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 113 transition count 131
Applied a total of 30 rules in 14 ms. Remains 113 /128 variables (removed 15) and now considering 131/149 (removed 18) transitions.
// Phase 1: matrix 131 rows 113 cols
[2023-03-08 22:30:59] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 22:31:00] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-08 22:31:00] [INFO ] Invariant cache hit.
[2023-03-08 22:31:00] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2023-03-08 22:31:00] [INFO ] Invariant cache hit.
[2023-03-08 22:31:00] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/128 places, 131/149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 439 ms. Remains : 113/128 places, 131/149 transitions.
Stuttering acceptance computed with spot in 405 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p3)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p3), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}], [{ cond=(NOT p3), acceptance={} source=6 dest: 3}, { cond=p3, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s102 0), p2:(EQ s98 1), p1:(EQ s46 1), p3:(EQ s8 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]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-13 finished in 876 ms.
All properties solved by simple procedures.
Total runtime 7193 ms.
ITS solved all properties within timeout

BK_STOP 1678314662521

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-06b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is DiscoveryGPU-PT-06b, 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 r135-smll-167819414000292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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