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-167819414200388.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-12b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819414200388
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.0K Feb 25 13:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 13:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 13:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 13:32 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.8K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 13:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 13:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 13:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 13:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:00 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 89K 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-12b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678324932953

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-12b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 01:22:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 01:22:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 01:22:15] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2023-03-09 01:22:15] [INFO ] Transformed 352 places.
[2023-03-09 01:22:15] [INFO ] Transformed 374 transitions.
[2023-03-09 01:22:15] [INFO ] Found NUPN structural information;
[2023-03-09 01:22:15] [INFO ] Parsed PT model containing 352 places and 374 transitions and 977 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 374/374 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 328 transition count 374
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 79 place count 273 transition count 319
Iterating global reduction 1 with 55 rules applied. Total rules applied 134 place count 273 transition count 319
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 146 place count 261 transition count 307
Iterating global reduction 1 with 12 rules applied. Total rules applied 158 place count 261 transition count 307
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 167 place count 252 transition count 298
Iterating global reduction 1 with 9 rules applied. Total rules applied 176 place count 252 transition count 298
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 185 place count 243 transition count 289
Iterating global reduction 1 with 9 rules applied. Total rules applied 194 place count 243 transition count 289
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 202 place count 235 transition count 273
Iterating global reduction 1 with 8 rules applied. Total rules applied 210 place count 235 transition count 273
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 217 place count 228 transition count 266
Iterating global reduction 1 with 7 rules applied. Total rules applied 224 place count 228 transition count 266
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 230 place count 222 transition count 260
Iterating global reduction 1 with 6 rules applied. Total rules applied 236 place count 222 transition count 260
Applied a total of 236 rules in 151 ms. Remains 222 /352 variables (removed 130) and now considering 260/374 (removed 114) transitions.
// Phase 1: matrix 260 rows 222 cols
[2023-03-09 01:22:16] [INFO ] Computed 2 place invariants in 25 ms
[2023-03-09 01:22:16] [INFO ] Implicit Places using invariants in 451 ms returned []
[2023-03-09 01:22:16] [INFO ] Invariant cache hit.
[2023-03-09 01:22:16] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
[2023-03-09 01:22:16] [INFO ] Invariant cache hit.
[2023-03-09 01:22:17] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 222/352 places, 260/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1148 ms. Remains : 222/352 places, 260/374 transitions.
Support contains 28 out of 222 places after structural reductions.
[2023-03-09 01:22:17] [INFO ] Flatten gal took : 65 ms
[2023-03-09 01:22:17] [INFO ] Flatten gal took : 26 ms
[2023-03-09 01:22:17] [INFO ] Input system was already deterministic with 260 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 28) seen :26
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 01:22:18] [INFO ] Invariant cache hit.
[2023-03-09 01:22:18] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 01:22:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-09 01:22:18] [INFO ] After 217ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 40 stable transitions
Graph (complete) has 437 edges and 222 vertex of which 217 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.9 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(G(p0)))'
Support contains 2 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 260/260 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 211 transition count 249
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 211 transition count 249
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 207 transition count 244
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 207 transition count 244
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 204 transition count 241
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 204 transition count 241
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 201 transition count 238
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 201 transition count 238
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 199 transition count 234
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 199 transition count 234
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 197 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 197 transition count 232
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 195 transition count 230
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 195 transition count 230
Applied a total of 54 rules in 35 ms. Remains 195 /222 variables (removed 27) and now considering 230/260 (removed 30) transitions.
// Phase 1: matrix 230 rows 195 cols
[2023-03-09 01:22:18] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-09 01:22:18] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-09 01:22:18] [INFO ] Invariant cache hit.
[2023-03-09 01:22:19] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-09 01:22:19] [INFO ] Invariant cache hit.
[2023-03-09 01:22:19] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 195/222 places, 230/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 529 ms. Remains : 195/222 places, 230/260 transitions.
Stuttering acceptance computed with spot in 245 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s154 0) (EQ s194 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 193 steps with 0 reset in 7 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-01 finished in 850 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 260/260 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 211 transition count 249
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 211 transition count 249
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 207 transition count 244
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 207 transition count 244
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 204 transition count 241
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 204 transition count 241
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 201 transition count 238
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 201 transition count 238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 200 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 200 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 199 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 199 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 198 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 198 transition count 234
Applied a total of 48 rules in 37 ms. Remains 198 /222 variables (removed 24) and now considering 234/260 (removed 26) transitions.
// Phase 1: matrix 234 rows 198 cols
[2023-03-09 01:22:19] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-09 01:22:19] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-09 01:22:19] [INFO ] Invariant cache hit.
[2023-03-09 01:22:19] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2023-03-09 01:22:19] [INFO ] Invariant cache hit.
[2023-03-09 01:22:20] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 198/222 places, 234/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 496 ms. Remains : 198/222 places, 234/260 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 300 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-02 finished in 656 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 1 out of 222 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 222/222 places, 260/260 transitions.
Graph (complete) has 437 edges and 222 vertex of which 217 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 216 transition count 221
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 183 transition count 221
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 67 place count 183 transition count 185
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 139 place count 147 transition count 185
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 142 place count 144 transition count 182
Iterating global reduction 2 with 3 rules applied. Total rules applied 145 place count 144 transition count 182
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 143 transition count 181
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 143 transition count 181
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 148 place count 142 transition count 180
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 142 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 150 place count 141 transition count 178
Iterating global reduction 2 with 1 rules applied. Total rules applied 151 place count 141 transition count 178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 152 place count 140 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 140 transition count 177
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 265 place count 84 transition count 121
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 275 place count 74 transition count 102
Iterating global reduction 2 with 10 rules applied. Total rules applied 285 place count 74 transition count 102
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 295 place count 64 transition count 90
Iterating global reduction 2 with 10 rules applied. Total rules applied 305 place count 64 transition count 90
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 315 place count 54 transition count 71
Iterating global reduction 2 with 10 rules applied. Total rules applied 325 place count 54 transition count 71
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 335 place count 44 transition count 60
Iterating global reduction 2 with 10 rules applied. Total rules applied 345 place count 44 transition count 60
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 355 place count 34 transition count 41
Iterating global reduction 2 with 10 rules applied. Total rules applied 365 place count 34 transition count 41
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 375 place count 24 transition count 30
Iterating global reduction 2 with 10 rules applied. Total rules applied 385 place count 24 transition count 30
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 387 place count 22 transition count 27
Iterating global reduction 2 with 2 rules applied. Total rules applied 389 place count 22 transition count 27
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 390 place count 21 transition count 26
Iterating global reduction 2 with 1 rules applied. Total rules applied 391 place count 21 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 392 place count 21 transition count 25
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 393 place count 21 transition count 25
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 395 place count 19 transition count 23
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 20 edges and 17 vertex of which 14 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 402 place count 14 transition count 16
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 406 place count 10 transition count 16
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 410 place count 8 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 411 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 413 place count 6 transition count 11
Applied a total of 413 rules in 102 ms. Remains 6 /222 variables (removed 216) and now considering 11/260 (removed 249) transitions.
[2023-03-09 01:22:20] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2023-03-09 01:22:20] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 01:22:20] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-09 01:22:20] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2023-03-09 01:22:20] [INFO ] Invariant cache hit.
[2023-03-09 01:22:20] [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-09 01:22:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 01:22:20] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2023-03-09 01:22:20] [INFO ] Invariant cache hit.
[2023-03-09 01:22:20] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/222 places, 11/260 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 6/222 places, 11/260 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-03 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 11 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-03 finished in 261 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(G(p0))&&F(p1))))'
Support contains 2 out of 222 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 222/222 places, 260/260 transitions.
Graph (complete) has 437 edges and 222 vertex of which 219 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 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 218 transition count 222
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 184 transition count 222
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 69 place count 184 transition count 186
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 141 place count 148 transition count 186
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 143 place count 146 transition count 184
Iterating global reduction 2 with 2 rules applied. Total rules applied 145 place count 146 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 145 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 145 transition count 183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 148 place count 144 transition count 182
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 144 transition count 182
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 150 place count 143 transition count 180
Iterating global reduction 2 with 1 rules applied. Total rules applied 151 place count 143 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 152 place count 142 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 142 transition count 179
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 265 place count 86 transition count 123
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 275 place count 76 transition count 103
Iterating global reduction 2 with 10 rules applied. Total rules applied 285 place count 76 transition count 103
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 295 place count 66 transition count 92
Iterating global reduction 2 with 10 rules applied. Total rules applied 305 place count 66 transition count 92
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 314 place count 57 transition count 75
Iterating global reduction 2 with 9 rules applied. Total rules applied 323 place count 57 transition count 75
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 332 place count 48 transition count 65
Iterating global reduction 2 with 9 rules applied. Total rules applied 341 place count 48 transition count 65
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 350 place count 39 transition count 48
Iterating global reduction 2 with 9 rules applied. Total rules applied 359 place count 39 transition count 48
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 368 place count 30 transition count 38
Iterating global reduction 2 with 9 rules applied. Total rules applied 377 place count 30 transition count 38
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 378 place count 29 transition count 37
Iterating global reduction 2 with 1 rules applied. Total rules applied 379 place count 29 transition count 37
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 381 place count 29 transition count 35
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 382 place count 29 transition count 35
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 384 place count 27 transition count 33
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 28 edges and 25 vertex of which 22 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 9 rules applied. Total rules applied 393 place count 22 transition count 24
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 399 place count 16 transition count 24
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 407 place count 12 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 408 place count 12 transition count 19
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 411 place count 9 transition count 16
Applied a total of 411 rules in 131 ms. Remains 9 /222 variables (removed 213) and now considering 16/260 (removed 244) transitions.
[2023-03-09 01:22:20] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
// Phase 1: matrix 12 rows 9 cols
[2023-03-09 01:22:20] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 01:22:20] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-09 01:22:20] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2023-03-09 01:22:20] [INFO ] Invariant cache hit.
[2023-03-09 01:22:20] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-09 01:22:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 01:22:20] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2023-03-09 01:22:20] [INFO ] Invariant cache hit.
[2023-03-09 01:22:20] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/222 places, 16/260 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 204 ms. Remains : 9/222 places, 16/260 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 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=[p0:(EQ s6 1), p1:(EQ s5 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 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-04 finished in 388 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((G(p0)||(p1&&F(p2))))))'
Support contains 3 out of 222 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 222/222 places, 260/260 transitions.
Graph (complete) has 437 edges and 222 vertex of which 217 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 216 transition count 221
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 183 transition count 221
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 67 place count 183 transition count 187
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 135 place count 149 transition count 187
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 138 place count 146 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 141 place count 146 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 142 place count 145 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 143 place count 145 transition count 183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 144 place count 144 transition count 182
Iterating global reduction 2 with 1 rules applied. Total rules applied 145 place count 144 transition count 182
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 143 transition count 180
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 143 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 148 place count 142 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 142 transition count 179
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 261 place count 86 transition count 123
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 272 place count 75 transition count 102
Iterating global reduction 2 with 11 rules applied. Total rules applied 283 place count 75 transition count 102
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 294 place count 64 transition count 89
Iterating global reduction 2 with 11 rules applied. Total rules applied 305 place count 64 transition count 89
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 316 place count 53 transition count 68
Iterating global reduction 2 with 11 rules applied. Total rules applied 327 place count 53 transition count 68
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 338 place count 42 transition count 56
Iterating global reduction 2 with 11 rules applied. Total rules applied 349 place count 42 transition count 56
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 359 place count 32 transition count 37
Iterating global reduction 2 with 10 rules applied. Total rules applied 369 place count 32 transition count 37
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 379 place count 22 transition count 26
Iterating global reduction 2 with 10 rules applied. Total rules applied 389 place count 22 transition count 26
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 391 place count 20 transition count 23
Iterating global reduction 2 with 2 rules applied. Total rules applied 393 place count 20 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 394 place count 19 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 395 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 396 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 397 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 399 place count 17 transition count 19
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 401 place count 16 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 402 place count 15 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 402 place count 15 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 406 place count 13 transition count 16
Applied a total of 406 rules in 66 ms. Remains 13 /222 variables (removed 209) and now considering 16/260 (removed 244) transitions.
[2023-03-09 01:22:20] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 13 cols
[2023-03-09 01:22:20] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 01:22:20] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-09 01:22:20] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-09 01:22:20] [INFO ] Invariant cache hit.
[2023-03-09 01:22:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 01:22:21] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-09 01:22:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 01:22:21] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-09 01:22:21] [INFO ] Invariant cache hit.
[2023-03-09 01:22:21] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/222 places, 16/260 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152 ms. Remains : 13/222 places, 16/260 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s10 1) (EQ s12 1)), p2:(EQ s8 0), p1:(OR (EQ s10 0) (EQ s12 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1618 reset in 466 ms.
Stack based approach found an accepted trace after 237 steps with 5 reset with depth 10 and stack size 10 in 4 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-06 finished in 757 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)))||G(p2)||G(p3)))'
Support contains 4 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 260/260 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 212 transition count 250
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 212 transition count 250
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 208 transition count 245
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 208 transition count 245
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 205 transition count 242
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 205 transition count 242
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 202 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 202 transition count 239
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 200 transition count 235
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 200 transition count 235
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 198 transition count 233
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 198 transition count 233
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 196 transition count 231
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 196 transition count 231
Applied a total of 52 rules in 27 ms. Remains 196 /222 variables (removed 26) and now considering 231/260 (removed 29) transitions.
// Phase 1: matrix 231 rows 196 cols
[2023-03-09 01:22:21] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-09 01:22:21] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-09 01:22:21] [INFO ] Invariant cache hit.
[2023-03-09 01:22:22] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2023-03-09 01:22:22] [INFO ] Invariant cache hit.
[2023-03-09 01:22:22] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 196/222 places, 231/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 629 ms. Remains : 196/222 places, 231/260 transitions.
Stuttering acceptance computed with spot in 564 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND p2 p3), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p3 (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND p3 p0 (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 9}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p2) p3 p0 (NOT p1)), acceptance={} source=6 dest: 8}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=6 dest: 9}, { cond=(AND p2 (NOT p3) p0 (NOT p1)), acceptance={} source=6 dest: 10}, { cond=(AND p2 p3 (NOT p0)), acceptance={} source=6 dest: 11}, { cond=(AND p2 p3 p0 (NOT p1)), acceptance={} source=6 dest: 12}], [{ cond=(NOT p3), acceptance={} source=7 dest: 0}, { cond=p3, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=8 dest: 1}, { cond=(AND p3 (NOT p1)), acceptance={} source=8 dest: 8}], [{ cond=(NOT p2), acceptance={} source=9 dest: 0}, { cond=p2, acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=10 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=11 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=11 dest: 7}, { cond=(AND p2 (NOT p3)), acceptance={} source=11 dest: 9}, { cond=(AND p2 p3), acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=12 dest: 1}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=12 dest: 8}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=12 dest: 10}, { cond=(AND p2 p3 (NOT p1)), acceptance={} source=12 dest: 12}]], initial=3, aps=[p1:(AND (EQ s69 1) (EQ s192 1)), p0:(EQ s88 0), p2:(OR (EQ s69 0) (EQ s192 0)), p3:(AND (EQ s73 1) (EQ s192 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 530 reset in 290 ms.
Product exploration explored 100000 steps with 530 reset in 350 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 397 edges and 196 vertex of which 195 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Detected a total of 39/196 stabilizing places and 39/231 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 p2 (NOT p3)), (X (NOT (AND p2 p3 p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (NOT (AND p2 p3 (NOT p0)))), (X (AND (NOT p3) p0 (NOT p1))), (X (NOT (AND p3 p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (AND p0 (NOT p1))), (X (AND p2 (NOT p3) p0 (NOT p1))), (X (AND p2 p0 (NOT p1))), (X (NOT (AND (NOT p2) p3 p0 (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (AND p2 (NOT p3) (NOT p1)))), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (X (X p2)), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), true, (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 p3 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 36 factoid took 1511 ms. Reduced automaton from 13 states, 40 edges and 4 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 25 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 01:22:25] [INFO ] Invariant cache hit.
[2023-03-09 01:22:25] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 01:22:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 01:22:25] [INFO ] After 223ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 p2 (NOT p3)), (X (NOT (AND p2 p3 p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (NOT (AND p2 p3 (NOT p0)))), (X (AND (NOT p3) p0 (NOT p1))), (X (NOT (AND p3 p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (AND p0 (NOT p1))), (X (AND p2 (NOT p3) p0 (NOT p1))), (X (AND p2 p0 (NOT p1))), (X (NOT (AND (NOT p2) p3 p0 (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (AND p2 (NOT p3) (NOT p1)))), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (X (X p2)), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), true, (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 p3 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p2)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p1) (NOT p2))))
Knowledge based reduction with 37 factoid took 1305 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-12b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-07 finished in 5487 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(X((X(X(F(p0)))&&(X(p1) U p2)))))'
Support contains 3 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 260/260 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 213 transition count 251
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 213 transition count 251
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 209 transition count 246
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 209 transition count 246
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 206 transition count 243
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 206 transition count 243
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 203 transition count 240
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 203 transition count 240
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 201 transition count 236
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 201 transition count 236
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 199 transition count 234
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 199 transition count 234
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 197 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 197 transition count 232
Applied a total of 50 rules in 52 ms. Remains 197 /222 variables (removed 25) and now considering 232/260 (removed 28) transitions.
// Phase 1: matrix 232 rows 197 cols
[2023-03-09 01:22:27] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-09 01:22:27] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-09 01:22:27] [INFO ] Invariant cache hit.
[2023-03-09 01:22:27] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2023-03-09 01:22:27] [INFO ] Invariant cache hit.
[2023-03-09 01:22:27] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 197/222 places, 232/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 800 ms. Remains : 197/222 places, 232/260 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), true]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s110 0), p2:(EQ s173 1), p1:(EQ s78 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-08 finished in 1001 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(G((p1||X(p2))))||p0)))'
Support contains 4 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 260/260 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 212 transition count 250
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 212 transition count 250
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 209 transition count 246
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 209 transition count 246
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 206 transition count 243
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 206 transition count 243
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 203 transition count 240
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 203 transition count 240
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 201 transition count 236
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 201 transition count 236
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 199 transition count 234
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 199 transition count 234
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 197 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 197 transition count 232
Applied a total of 50 rules in 23 ms. Remains 197 /222 variables (removed 25) and now considering 232/260 (removed 28) transitions.
// Phase 1: matrix 232 rows 197 cols
[2023-03-09 01:22:28] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 01:22:28] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-09 01:22:28] [INFO ] Invariant cache hit.
[2023-03-09 01:22:28] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2023-03-09 01:22:28] [INFO ] Invariant cache hit.
[2023-03-09 01:22:28] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 197/222 places, 232/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 672 ms. Remains : 197/222 places, 232/260 transitions.
Stuttering acceptance computed with spot in 236 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(OR (EQ s36 0) (EQ s196 0)), p2:(EQ s80 1), p1:(AND (EQ s182 1) (EQ s36 1) (EQ s196 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 459 ms.
Product exploration explored 100000 steps with 50000 reset in 425 ms.
Computed a total of 38 stabilizing places and 38 stable transitions
Graph (complete) has 399 edges and 197 vertex of which 196 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 38 stabilizing places and 38 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-12b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-09 finished in 1886 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(p0) U X(X(G(p1)))))'
Support contains 2 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 260/260 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 212 transition count 250
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 212 transition count 250
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 208 transition count 245
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 208 transition count 245
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 205 transition count 242
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 205 transition count 242
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 202 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 202 transition count 239
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 200 transition count 235
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 200 transition count 235
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 198 transition count 233
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 198 transition count 233
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 196 transition count 231
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 196 transition count 231
Applied a total of 52 rules in 34 ms. Remains 196 /222 variables (removed 26) and now considering 231/260 (removed 29) transitions.
// Phase 1: matrix 231 rows 196 cols
[2023-03-09 01:22:30] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-09 01:22:30] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-09 01:22:30] [INFO ] Invariant cache hit.
[2023-03-09 01:22:30] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
[2023-03-09 01:22:30] [INFO ] Invariant cache hit.
[2023-03-09 01:22:30] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 196/222 places, 231/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 886 ms. Remains : 196/222 places, 231/260 transitions.
Stuttering acceptance computed with spot in 335 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 3}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}]], initial=5, aps=[p0:(NEQ s66 1), p1:(NEQ s118 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 83746 steps with 20850 reset in 200 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-10 finished in 1457 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)&&(G(p0)||G(p1))))'
Support contains 2 out of 222 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 222/222 places, 260/260 transitions.
Graph (complete) has 437 edges and 222 vertex of which 217 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 216 transition count 221
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 183 transition count 221
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 67 place count 183 transition count 185
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 139 place count 147 transition count 185
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 142 place count 144 transition count 182
Iterating global reduction 2 with 3 rules applied. Total rules applied 145 place count 144 transition count 182
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 143 transition count 181
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 143 transition count 181
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 148 place count 142 transition count 180
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 142 transition count 180
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 261 place count 86 transition count 124
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 271 place count 76 transition count 105
Iterating global reduction 2 with 10 rules applied. Total rules applied 281 place count 76 transition count 105
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 291 place count 66 transition count 93
Iterating global reduction 2 with 10 rules applied. Total rules applied 301 place count 66 transition count 93
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 311 place count 56 transition count 74
Iterating global reduction 2 with 10 rules applied. Total rules applied 321 place count 56 transition count 74
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 331 place count 46 transition count 63
Iterating global reduction 2 with 10 rules applied. Total rules applied 341 place count 46 transition count 63
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 351 place count 36 transition count 44
Iterating global reduction 2 with 10 rules applied. Total rules applied 361 place count 36 transition count 44
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 370 place count 27 transition count 34
Iterating global reduction 2 with 9 rules applied. Total rules applied 379 place count 27 transition count 34
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 381 place count 25 transition count 31
Iterating global reduction 2 with 2 rules applied. Total rules applied 383 place count 25 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 384 place count 24 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 385 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 386 place count 24 transition count 29
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 387 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 389 place count 22 transition count 27
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 24 edges and 20 vertex of which 17 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 396 place count 17 transition count 20
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 400 place count 13 transition count 20
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 406 place count 10 transition count 17
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 408 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 410 place count 8 transition count 13
Applied a total of 410 rules in 61 ms. Remains 8 /222 variables (removed 214) and now considering 13/260 (removed 247) transitions.
[2023-03-09 01:22:31] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 8 cols
[2023-03-09 01:22:31] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-09 01:22:31] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-09 01:22:31] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2023-03-09 01:22:31] [INFO ] Invariant cache hit.
[2023-03-09 01:22:31] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-09 01:22:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 01:22:31] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2023-03-09 01:22:31] [INFO ] Invariant cache hit.
[2023-03-09 01:22:31] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/222 places, 13/260 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 201 ms. Remains : 8/222 places, 13/260 transitions.
Stuttering acceptance computed with spot in 463 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(EQ s2 0), p1:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-11 finished in 685 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||(p1 U p2))))'
Support contains 5 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 260/260 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 212 transition count 250
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 212 transition count 250
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 209 transition count 246
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 209 transition count 246
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 207 transition count 244
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 207 transition count 244
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 205 transition count 242
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 205 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 204 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 204 transition count 240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 203 transition count 239
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 203 transition count 239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 202 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 202 transition count 238
Applied a total of 40 rules in 33 ms. Remains 202 /222 variables (removed 20) and now considering 238/260 (removed 22) transitions.
// Phase 1: matrix 238 rows 202 cols
[2023-03-09 01:22:32] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-09 01:22:32] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-09 01:22:32] [INFO ] Invariant cache hit.
[2023-03-09 01:22:32] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
[2023-03-09 01:22:32] [INFO ] Invariant cache hit.
[2023-03-09 01:22:33] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/222 places, 238/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1036 ms. Remains : 202/222 places, 238/260 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(EQ s34 1), p1:(OR (NEQ s85 1) (EQ s16 1)), p0:(AND (EQ s114 1) (EQ s198 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2355 reset in 320 ms.
Stack based approach found an accepted trace after 400 steps with 9 reset with depth 20 and stack size 20 in 3 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-12 finished in 1563 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((G(p0) U p1)))'
Support contains 2 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 260/260 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 211 transition count 249
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 211 transition count 249
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 207 transition count 244
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 207 transition count 244
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 204 transition count 241
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 204 transition count 241
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 201 transition count 238
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 201 transition count 238
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 199 transition count 234
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 199 transition count 234
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 197 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 197 transition count 232
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 195 transition count 230
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 195 transition count 230
Applied a total of 54 rules in 28 ms. Remains 195 /222 variables (removed 27) and now considering 230/260 (removed 30) transitions.
// Phase 1: matrix 230 rows 195 cols
[2023-03-09 01:22:33] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-09 01:22:33] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-09 01:22:33] [INFO ] Invariant cache hit.
[2023-03-09 01:22:34] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
[2023-03-09 01:22:34] [INFO ] Invariant cache hit.
[2023-03-09 01:22:34] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 195/222 places, 230/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 813 ms. Remains : 195/222 places, 230/260 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s114 1), p0:(EQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-15 finished in 1014 ms.
All properties solved by simple procedures.
Total runtime 19214 ms.
ITS solved all properties within timeout

BK_STOP 1678324956389

--------------------
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-12b"
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-12b, 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-167819414200388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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