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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.3K Feb 25 14:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 14:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 14:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 14:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 14:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 14:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 14:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 14:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:11 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 65K 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 GPUForwardProgress-PT-12b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678465772138

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=GPUForwardProgress-PT-12b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 16:29:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 16:29:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 16:29:36] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2023-03-10 16:29:36] [INFO ] Transformed 264 places.
[2023-03-10 16:29:36] [INFO ] Transformed 277 transitions.
[2023-03-10 16:29:36] [INFO ] Found NUPN structural information;
[2023-03-10 16:29:36] [INFO ] Parsed PT model containing 264 places and 277 transitions and 677 arcs in 323 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 277/277 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 263 transition count 277
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 238 transition count 252
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 238 transition count 252
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 60 place count 229 transition count 243
Iterating global reduction 1 with 9 rules applied. Total rules applied 69 place count 229 transition count 243
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 76 place count 229 transition count 236
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 228 transition count 235
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 228 transition count 235
Applied a total of 78 rules in 142 ms. Remains 228 /264 variables (removed 36) and now considering 235/277 (removed 42) transitions.
// Phase 1: matrix 235 rows 228 cols
[2023-03-10 16:29:36] [INFO ] Computed 13 place invariants in 24 ms
[2023-03-10 16:29:37] [INFO ] Implicit Places using invariants in 484 ms returned []
[2023-03-10 16:29:37] [INFO ] Invariant cache hit.
[2023-03-10 16:29:37] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 988 ms to find 0 implicit places.
[2023-03-10 16:29:37] [INFO ] Invariant cache hit.
[2023-03-10 16:29:38] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/264 places, 235/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1558 ms. Remains : 228/264 places, 235/277 transitions.
Support contains 21 out of 228 places after structural reductions.
[2023-03-10 16:29:38] [INFO ] Flatten gal took : 97 ms
[2023-03-10 16:29:38] [INFO ] Flatten gal took : 37 ms
[2023-03-10 16:29:38] [INFO ] Input system was already deterministic with 235 transitions.
Support contains 20 out of 228 places (down from 21) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 86 resets, run finished after 682 ms. (steps per millisecond=14 ) properties (out of 20) seen :19
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 16:29:39] [INFO ] Invariant cache hit.
[2023-03-10 16:29:39] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 16:29:39] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 14 ms returned sat
[2023-03-10 16:29:39] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 16:29:39] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-10 16:29:39] [INFO ] After 343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 54 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=27 )
Parikh walk visited 1 properties in 4 ms.
Computed a total of 40 stabilizing places and 40 stable transitions
Graph (complete) has 352 edges and 228 vertex of which 212 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.10 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(p0)||F(p1))))'
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 235/235 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 221 transition count 228
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 221 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 221 transition count 226
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 218 transition count 223
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 218 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 218 transition count 221
Applied a total of 24 rules in 34 ms. Remains 218 /228 variables (removed 10) and now considering 221/235 (removed 14) transitions.
// Phase 1: matrix 221 rows 218 cols
[2023-03-10 16:29:40] [INFO ] Computed 13 place invariants in 6 ms
[2023-03-10 16:29:40] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-10 16:29:40] [INFO ] Invariant cache hit.
[2023-03-10 16:29:40] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
[2023-03-10 16:29:40] [INFO ] Invariant cache hit.
[2023-03-10 16:29:41] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 218/228 places, 221/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 817 ms. Remains : 218/228 places, 221/235 transitions.
Stuttering acceptance computed with spot in 375 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s104 0), p0:(OR (EQ s109 1) (EQ s205 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 896 reset in 566 ms.
Product exploration explored 100000 steps with 887 reset in 407 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 338 edges and 218 vertex of which 202 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.9 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 212 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 6420 steps, including 57 resets, run visited all 2 properties in 243 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 270 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 221/221 transitions.
Applied a total of 0 rules in 7 ms. Remains 218 /218 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2023-03-10 16:29:43] [INFO ] Invariant cache hit.
[2023-03-10 16:29:44] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-10 16:29:44] [INFO ] Invariant cache hit.
[2023-03-10 16:29:44] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2023-03-10 16:29:44] [INFO ] Invariant cache hit.
[2023-03-10 16:29:44] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 736 ms. Remains : 218/218 places, 221/221 transitions.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 338 edges and 218 vertex of which 202 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.5 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 89 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Finished Best-First random walk after 6065 steps, including 4 resets, run visited all 2 properties in 23 ms. (steps per millisecond=263 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 245 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 903 reset in 242 ms.
Product exploration explored 100000 steps with 899 reset in 525 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 218/218 places, 221/221 transitions.
Graph (trivial) has 176 edges and 218 vertex of which 6 / 218 are part of one of the 1 SCC in 7 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 332 edges and 213 vertex of which 197 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.3 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 97 rules applied. Total rules applied 99 place count 197 transition count 212
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 99 place count 197 transition count 214
Deduced a syphon composed of 111 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 113 place count 197 transition count 214
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 184 place count 126 transition count 143
Deduced a syphon composed of 51 places in 1 ms
Iterating global reduction 1 with 71 rules applied. Total rules applied 255 place count 126 transition count 143
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 265 place count 116 transition count 133
Deduced a syphon composed of 41 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 275 place count 116 transition count 133
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 81 places in 1 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 315 place count 116 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 317 place count 116 transition count 132
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 346 place count 87 transition count 102
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 2 with 29 rules applied. Total rules applied 375 place count 87 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 376 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 377 place count 86 transition count 101
Deduced a syphon composed of 52 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 378 place count 86 transition count 101
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 390 place count 86 transition count 136
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 411 place count 65 transition count 94
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 432 place count 65 transition count 94
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 462 place count 35 transition count 44
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 492 place count 35 transition count 44
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 492 rules in 123 ms. Remains 35 /218 variables (removed 183) and now considering 44/221 (removed 177) transitions.
[2023-03-10 16:29:47] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 44 rows 35 cols
[2023-03-10 16:29:47] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 16:29:47] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/218 places, 44/221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 212 ms. Remains : 35/218 places, 44/221 transitions.
Support contains 3 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 221/221 transitions.
Applied a total of 0 rules in 9 ms. Remains 218 /218 variables (removed 0) and now considering 221/221 (removed 0) transitions.
// Phase 1: matrix 221 rows 218 cols
[2023-03-10 16:29:47] [INFO ] Computed 13 place invariants in 6 ms
[2023-03-10 16:29:47] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-10 16:29:47] [INFO ] Invariant cache hit.
[2023-03-10 16:29:47] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2023-03-10 16:29:47] [INFO ] Invariant cache hit.
[2023-03-10 16:29:47] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 537 ms. Remains : 218/218 places, 221/221 transitions.
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-02 finished in 7563 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)&&F(G((p1||X(p2)))))))'
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 235/235 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 220 transition count 227
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 220 transition count 227
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 220 transition count 225
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 216 transition count 221
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 216 transition count 221
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 29 place count 216 transition count 218
Applied a total of 29 rules in 20 ms. Remains 216 /228 variables (removed 12) and now considering 218/235 (removed 17) transitions.
// Phase 1: matrix 218 rows 216 cols
[2023-03-10 16:29:47] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 16:29:48] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-10 16:29:48] [INFO ] Invariant cache hit.
[2023-03-10 16:29:48] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2023-03-10 16:29:48] [INFO ] Invariant cache hit.
[2023-03-10 16:29:48] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 216/228 places, 218/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 606 ms. Remains : 216/228 places, 218/235 transitions.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-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 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s25 0), p1:(EQ s50 1), p2:(EQ s50 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33195 reset in 318 ms.
Product exploration explored 100000 steps with 33330 reset in 367 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 335 edges and 216 vertex of which 200 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.4 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p2), (X (X (NOT (AND (NOT p1) (NOT p2))))), true, (X (X p0)), (X (X p2)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 577 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 87 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 16:29:50] [INFO ] Invariant cache hit.
[2023-03-10 16:29:50] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 16:29:50] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 14 ms returned sat
[2023-03-10 16:29:50] [INFO ] After 247ms 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 p0 (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p2), (X (X (NOT (AND (NOT p1) (NOT p2))))), true, (X (X p0)), (X (X p2)), (X (X (NOT p1))), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F p1)]
Knowledge based reduction with 10 factoid took 764 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 218/218 transitions.
Applied a total of 0 rules in 6 ms. Remains 216 /216 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2023-03-10 16:29:52] [INFO ] Invariant cache hit.
[2023-03-10 16:29:52] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-10 16:29:52] [INFO ] Invariant cache hit.
[2023-03-10 16:29:52] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2023-03-10 16:29:52] [INFO ] Invariant cache hit.
[2023-03-10 16:29:52] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 725 ms. Remains : 216/216 places, 218/218 transitions.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 335 edges and 216 vertex of which 200 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.4 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X p2), true, (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 385 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 90 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 16:29:53] [INFO ] Invariant cache hit.
[2023-03-10 16:29:53] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 15 ms returned sat
[2023-03-10 16:29:54] [INFO ] After 333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 16:29:54] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 12 ms returned sat
[2023-03-10 16:29:54] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 16:29:54] [INFO ] After 249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-10 16:29:54] [INFO ] After 408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 218/218 transitions.
Graph (trivial) has 176 edges and 216 vertex of which 6 / 216 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 328 edges and 211 vertex of which 195 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 195 transition count 109
Reduce places removed 97 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 98 rules applied. Total rules applied 199 place count 98 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 200 place count 97 transition count 108
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 200 place count 97 transition count 81
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 254 place count 70 transition count 81
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 267 place count 57 transition count 68
Iterating global reduction 3 with 13 rules applied. Total rules applied 280 place count 57 transition count 68
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 280 place count 57 transition count 67
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 282 place count 56 transition count 67
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 356 place count 19 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 48 edges and 19 vertex of which 18 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 358 place count 18 transition count 29
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 359 place count 18 transition count 28
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 369 place count 8 transition count 8
Iterating global reduction 5 with 10 rules applied. Total rules applied 379 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 382 place count 6 transition count 7
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 7 edges and 6 vertex of which 5 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 2 rules applied. Total rules applied 384 place count 5 transition count 6
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 385 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 386 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 387 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 387 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 389 place count 2 transition count 3
Applied a total of 389 rules in 59 ms. Remains 2 /216 variables (removed 214) and now considering 3/218 (removed 215) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 2/216 places, 3/218 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X p2), true, (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F p1)]
Knowledge based reduction with 6 factoid took 330 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 33261 reset in 350 ms.
Product exploration explored 100000 steps with 33460 reset in 361 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 216 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 216/216 places, 218/218 transitions.
Graph (trivial) has 174 edges and 216 vertex of which 6 / 216 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 329 edges and 211 vertex of which 195 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 95 rules applied. Total rules applied 97 place count 195 transition count 209
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 97 place count 195 transition count 211
Deduced a syphon composed of 110 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 112 place count 195 transition count 211
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 180 place count 127 transition count 143
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 68 rules applied. Total rules applied 248 place count 127 transition count 143
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 259 place count 116 transition count 132
Deduced a syphon composed of 42 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 270 place count 116 transition count 132
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 311 place count 116 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 313 place count 116 transition count 131
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 343 place count 86 transition count 100
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 373 place count 86 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 374 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 375 place count 85 transition count 99
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 376 place count 85 transition count 99
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 387 place count 85 transition count 131
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 407 place count 65 transition count 91
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 427 place count 65 transition count 91
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 454 place count 38 transition count 46
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 2 with 27 rules applied. Total rules applied 481 place count 38 transition count 46
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 481 rules in 76 ms. Remains 38 /216 variables (removed 178) and now considering 46/218 (removed 172) transitions.
[2023-03-10 16:29:56] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 46 rows 38 cols
[2023-03-10 16:29:56] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 16:29:56] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/216 places, 46/218 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 172 ms. Remains : 38/216 places, 46/218 transitions.
Support contains 2 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 218/218 transitions.
Applied a total of 0 rules in 5 ms. Remains 216 /216 variables (removed 0) and now considering 218/218 (removed 0) transitions.
// Phase 1: matrix 218 rows 216 cols
[2023-03-10 16:29:56] [INFO ] Computed 13 place invariants in 4 ms
[2023-03-10 16:29:56] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-10 16:29:57] [INFO ] Invariant cache hit.
[2023-03-10 16:29:57] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2023-03-10 16:29:57] [INFO ] Invariant cache hit.
[2023-03-10 16:29:57] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 675 ms. Remains : 216/216 places, 218/218 transitions.
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-03 finished in 9719 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&&X(p1))||G(p1)))))))'
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 235/235 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 220 transition count 227
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 220 transition count 227
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 220 transition count 225
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 216 transition count 221
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 216 transition count 221
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 29 place count 216 transition count 218
Applied a total of 29 rules in 17 ms. Remains 216 /228 variables (removed 12) and now considering 218/235 (removed 17) transitions.
[2023-03-10 16:29:57] [INFO ] Invariant cache hit.
[2023-03-10 16:29:57] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-10 16:29:57] [INFO ] Invariant cache hit.
[2023-03-10 16:29:58] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2023-03-10 16:29:58] [INFO ] Invariant cache hit.
[2023-03-10 16:29:58] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 216/228 places, 218/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 650 ms. Remains : 216/228 places, 218/235 transitions.
Stuttering acceptance computed with spot in 268 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(NEQ s72 1), p1:(NEQ s156 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 282 ms.
Product exploration explored 100000 steps with 20000 reset in 275 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 335 edges and 216 vertex of which 200 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.4 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Detected a total of 39/216 stabilizing places and 39/218 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 204 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 91 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 16:29:59] [INFO ] Invariant cache hit.
[2023-03-10 16:29:59] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 13 ms returned sat
[2023-03-10 16:29:59] [INFO ] After 166ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-10 16:29:59] [INFO ] After 199ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-10 16:29:59] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 16:30:00] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 12 ms returned sat
[2023-03-10 16:30:00] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 16:30:00] [INFO ] After 195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-10 16:30:00] [INFO ] After 304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 60 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (NOT (AND p1 p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 308 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 218/218 transitions.
Applied a total of 0 rules in 4 ms. Remains 216 /216 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2023-03-10 16:30:01] [INFO ] Invariant cache hit.
[2023-03-10 16:30:01] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-10 16:30:01] [INFO ] Invariant cache hit.
[2023-03-10 16:30:01] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2023-03-10 16:30:01] [INFO ] Invariant cache hit.
[2023-03-10 16:30:01] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 749 ms. Remains : 216/216 places, 218/218 transitions.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 335 edges and 216 vertex of which 200 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.3 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Detected a total of 39/216 stabilizing places and 39/218 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 285 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 86 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :3
Finished Best-First random walk after 6122 steps, including 7 resets, run visited all 1 properties in 7 ms. (steps per millisecond=874 )
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (NOT (AND p1 p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 309 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 266 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 20000 reset in 257 ms.
Product exploration explored 100000 steps with 20000 reset in 280 ms.
Support contains 2 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 218/218 transitions.
Applied a total of 0 rules in 4 ms. Remains 216 /216 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2023-03-10 16:30:04] [INFO ] Invariant cache hit.
[2023-03-10 16:30:04] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-10 16:30:04] [INFO ] Invariant cache hit.
[2023-03-10 16:30:04] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2023-03-10 16:30:04] [INFO ] Invariant cache hit.
[2023-03-10 16:30:04] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 738 ms. Remains : 216/216 places, 218/218 transitions.
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-04 finished in 7418 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(p0) U (p1&&G(p2)))))'
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 235/235 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 221 transition count 228
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 221 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 221 transition count 226
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 218 transition count 223
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 218 transition count 223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 25 place count 218 transition count 220
Applied a total of 25 rules in 14 ms. Remains 218 /228 variables (removed 10) and now considering 220/235 (removed 15) transitions.
// Phase 1: matrix 220 rows 218 cols
[2023-03-10 16:30:05] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 16:30:05] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-10 16:30:05] [INFO ] Invariant cache hit.
[2023-03-10 16:30:05] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2023-03-10 16:30:05] [INFO ] Invariant cache hit.
[2023-03-10 16:30:05] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 218/228 places, 220/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 771 ms. Remains : 218/228 places, 220/235 transitions.
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p2), true, (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(NEQ s198 1), p2:(EQ s99 1), p0:(EQ s102 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-05 finished in 1136 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 235/235 transitions.
Graph (trivial) has 194 edges and 228 vertex of which 7 / 228 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 345 edges and 222 vertex of which 206 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 106 place count 205 transition count 120
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 110 rules applied. Total rules applied 216 place count 101 transition count 114
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 219 place count 99 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 98 transition count 113
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 220 place count 98 transition count 86
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 274 place count 71 transition count 86
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 285 place count 60 transition count 75
Iterating global reduction 4 with 11 rules applied. Total rules applied 296 place count 60 transition count 75
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 372 place count 22 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 373 place count 22 transition count 36
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 384 place count 11 transition count 15
Iterating global reduction 5 with 11 rules applied. Total rules applied 395 place count 11 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 399 place count 9 transition count 14
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 401 place count 9 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 402 place count 8 transition count 13
Applied a total of 402 rules in 33 ms. Remains 8 /228 variables (removed 220) and now considering 13/235 (removed 222) transitions.
[2023-03-10 16:30:06] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 8 cols
[2023-03-10 16:30:06] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 16:30:06] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-10 16:30:06] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-10 16:30:06] [INFO ] Invariant cache hit.
[2023-03-10 16:30:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 16:30:06] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-10 16:30:06] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-10 16:30:06] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-10 16:30:06] [INFO ] Invariant cache hit.
[2023-03-10 16:30:06] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/228 places, 13/235 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 8/228 places, 13/235 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-08 finished in 240 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(F(p0))))'
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 235/235 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 221 transition count 228
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 221 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 221 transition count 226
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 217 transition count 222
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 217 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 217 transition count 219
Applied a total of 27 rules in 15 ms. Remains 217 /228 variables (removed 11) and now considering 219/235 (removed 16) transitions.
// Phase 1: matrix 219 rows 217 cols
[2023-03-10 16:30:06] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 16:30:06] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-10 16:30:06] [INFO ] Invariant cache hit.
[2023-03-10 16:30:06] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2023-03-10 16:30:06] [INFO ] Invariant cache hit.
[2023-03-10 16:30:07] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 217/228 places, 219/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 769 ms. Remains : 217/228 places, 219/235 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-09 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: 1}]], initial=2, aps=[p0:(NEQ s197 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 360 ms.
Product exploration explored 100000 steps with 33333 reset in 316 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 336 edges and 217 vertex of which 201 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.4 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-12b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-09 finished in 1730 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)&&(G(p1)||G(p2))))'
Support contains 4 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 235/235 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 222 transition count 229
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 222 transition count 229
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 222 transition count 227
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 219 transition count 224
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 219 transition count 224
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 219 transition count 222
Applied a total of 22 rules in 15 ms. Remains 219 /228 variables (removed 9) and now considering 222/235 (removed 13) transitions.
// Phase 1: matrix 222 rows 219 cols
[2023-03-10 16:30:08] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 16:30:08] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-10 16:30:08] [INFO ] Invariant cache hit.
[2023-03-10 16:30:08] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2023-03-10 16:30:08] [INFO ] Invariant cache hit.
[2023-03-10 16:30:08] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 219/228 places, 222/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 644 ms. Remains : 219/228 places, 222/235 transitions.
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p2), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}, { cond=(AND p1 p2), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s149 0) (EQ s72 0)), p2:(EQ s164 1), p0:(EQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-12 finished in 971 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&&X(p1)))&&F(p2))))'
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 235/235 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 222 transition count 229
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 222 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 222 transition count 228
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 219 transition count 225
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 219 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 219 transition count 223
Applied a total of 21 rules in 22 ms. Remains 219 /228 variables (removed 9) and now considering 223/235 (removed 12) transitions.
// Phase 1: matrix 223 rows 219 cols
[2023-03-10 16:30:09] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-10 16:30:09] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-10 16:30:09] [INFO ] Invariant cache hit.
[2023-03-10 16:30:09] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
[2023-03-10 16:30:09] [INFO ] Invariant cache hit.
[2023-03-10 16:30:09] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 219/228 places, 223/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 722 ms. Remains : 219/228 places, 223/235 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s75 0), p2:(EQ s142 1), p1:(EQ s65 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 105 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-13 finished in 983 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 235/235 transitions.
Graph (trivial) has 191 edges and 228 vertex of which 7 / 228 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 345 edges and 222 vertex of which 206 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 205 transition count 122
Reduce places removed 102 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 109 rules applied. Total rules applied 213 place count 103 transition count 115
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 217 place count 101 transition count 113
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 219 place count 99 transition count 113
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 219 place count 99 transition count 86
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 273 place count 72 transition count 86
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 284 place count 61 transition count 75
Iterating global reduction 4 with 11 rules applied. Total rules applied 295 place count 61 transition count 75
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 371 place count 23 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 372 place count 23 transition count 36
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 382 place count 13 transition count 17
Iterating global reduction 5 with 10 rules applied. Total rules applied 392 place count 13 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 394 place count 12 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 395 place count 11 transition count 15
Applied a total of 395 rules in 39 ms. Remains 11 /228 variables (removed 217) and now considering 15/235 (removed 220) transitions.
// Phase 1: matrix 15 rows 11 cols
[2023-03-10 16:30:10] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 16:30:10] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-10 16:30:10] [INFO ] Invariant cache hit.
[2023-03-10 16:30:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 16:30:10] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-10 16:30:10] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-10 16:30:10] [INFO ] Invariant cache hit.
[2023-03-10 16:30:10] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/228 places, 15/235 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 184 ms. Remains : 11/228 places, 15/235 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s6 1), p0:(NEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-14 finished in 306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 235/235 transitions.
Graph (trivial) has 194 edges and 228 vertex of which 7 / 228 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 345 edges and 222 vertex of which 206 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 106 place count 205 transition count 120
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 110 rules applied. Total rules applied 216 place count 101 transition count 114
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 220 place count 99 transition count 112
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 223 place count 97 transition count 111
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 223 place count 97 transition count 84
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 277 place count 70 transition count 84
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 288 place count 59 transition count 73
Iterating global reduction 4 with 11 rules applied. Total rules applied 299 place count 59 transition count 73
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 377 place count 20 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 378 place count 20 transition count 33
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 389 place count 9 transition count 12
Iterating global reduction 5 with 11 rules applied. Total rules applied 400 place count 9 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 402 place count 8 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 403 place count 7 transition count 10
Applied a total of 403 rules in 26 ms. Remains 7 /228 variables (removed 221) and now considering 10/235 (removed 225) transitions.
// Phase 1: matrix 10 rows 7 cols
[2023-03-10 16:30:10] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-10 16:30:10] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-10 16:30:10] [INFO ] Invariant cache hit.
[2023-03-10 16:30:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 16:30:10] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-10 16:30:10] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-10 16:30:10] [INFO ] Invariant cache hit.
[2023-03-10 16:30:10] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/228 places, 10/235 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 148 ms. Remains : 7/228 places, 10/235 transitions.
Stuttering acceptance computed with spot in 50 ms :[p0]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-15 finished in 218 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(p0)||F(p1))))'
Found a Lengthening insensitive property : GPUForwardProgress-PT-12b-LTLFireability-02
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 228/228 places, 235/235 transitions.
Graph (trivial) has 190 edges and 228 vertex of which 7 / 228 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 345 edges and 222 vertex of which 206 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 105 place count 205 transition count 121
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 109 rules applied. Total rules applied 214 place count 102 transition count 115
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 216 place count 100 transition count 115
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 216 place count 100 transition count 89
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 268 place count 74 transition count 89
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 279 place count 63 transition count 78
Iterating global reduction 3 with 11 rules applied. Total rules applied 290 place count 63 transition count 78
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 368 place count 24 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 369 place count 24 transition count 38
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 380 place count 13 transition count 17
Iterating global reduction 4 with 11 rules applied. Total rules applied 391 place count 13 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 393 place count 12 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 394 place count 11 transition count 15
Applied a total of 394 rules in 20 ms. Remains 11 /228 variables (removed 217) and now considering 15/235 (removed 220) transitions.
// Phase 1: matrix 15 rows 11 cols
[2023-03-10 16:30:10] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 16:30:10] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-10 16:30:10] [INFO ] Invariant cache hit.
[2023-03-10 16:30:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 16:30:11] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-10 16:30:11] [INFO ] Invariant cache hit.
[2023-03-10 16:30:11] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 11/228 places, 15/235 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 129 ms. Remains : 11/228 places, 15/235 transitions.
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s2 0), p0:(OR (EQ s5 1) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 70 steps with 7 reset in 5 ms.
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-02 finished in 454 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-02 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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)&&F(G((p1||X(p2)))))))'
Found a Lengthening insensitive property : GPUForwardProgress-PT-12b-LTLFireability-03
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 228/228 places, 235/235 transitions.
Graph (trivial) has 191 edges and 228 vertex of which 7 / 228 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 345 edges and 222 vertex of which 206 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 103 place count 205 transition count 123
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 108 rules applied. Total rules applied 211 place count 104 transition count 116
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 215 place count 102 transition count 114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 217 place count 100 transition count 114
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 217 place count 100 transition count 86
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 273 place count 72 transition count 86
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 284 place count 61 transition count 75
Iterating global reduction 4 with 11 rules applied. Total rules applied 295 place count 61 transition count 75
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 371 place count 23 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 372 place count 23 transition count 36
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 382 place count 13 transition count 17
Iterating global reduction 5 with 10 rules applied. Total rules applied 392 place count 13 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 394 place count 12 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 395 place count 11 transition count 15
Applied a total of 395 rules in 22 ms. Remains 11 /228 variables (removed 217) and now considering 15/235 (removed 220) transitions.
// Phase 1: matrix 15 rows 11 cols
[2023-03-10 16:30:11] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 16:30:11] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-10 16:30:11] [INFO ] Invariant cache hit.
[2023-03-10 16:30:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 16:30:11] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-10 16:30:11] [INFO ] Invariant cache hit.
[2023-03-10 16:30:11] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 11/228 places, 15/235 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 135 ms. Remains : 11/228 places, 15/235 transitions.
Running random walk in product with property : GPUForwardProgress-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 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s3 0), p1:(EQ s6 1), p2:(EQ s6 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 112 steps with 38 reset in 1 ms.
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-03 finished in 520 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-03 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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&&X(p1))||G(p1)))))))'
Found a Shortening insensitive property : GPUForwardProgress-PT-12b-LTLFireability-04
Stuttering acceptance computed with spot in 261 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 228/228 places, 235/235 transitions.
Graph (trivial) has 192 edges and 228 vertex of which 7 / 228 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 345 edges and 222 vertex of which 206 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 105 place count 205 transition count 121
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 109 rules applied. Total rules applied 214 place count 102 transition count 115
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 218 place count 100 transition count 113
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 221 place count 98 transition count 112
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 221 place count 98 transition count 85
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 275 place count 71 transition count 85
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 286 place count 60 transition count 74
Iterating global reduction 4 with 11 rules applied. Total rules applied 297 place count 60 transition count 74
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 373 place count 22 transition count 36
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 374 place count 22 transition count 35
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 385 place count 11 transition count 14
Iterating global reduction 5 with 11 rules applied. Total rules applied 396 place count 11 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 398 place count 10 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 399 place count 9 transition count 12
Applied a total of 399 rules in 30 ms. Remains 9 /228 variables (removed 219) and now considering 12/235 (removed 223) transitions.
// Phase 1: matrix 12 rows 9 cols
[2023-03-10 16:30:12] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 16:30:12] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-10 16:30:12] [INFO ] Invariant cache hit.
[2023-03-10 16:30:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 16:30:12] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-10 16:30:12] [INFO ] Invariant cache hit.
[2023-03-10 16:30:12] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 9/228 places, 12/235 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 157 ms. Remains : 9/228 places, 12/235 transitions.
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(NEQ s3 1), p1:(NEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-04 finished in 577 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-10 16:30:12] [INFO ] Flatten gal took : 30 ms
[2023-03-10 16:30:12] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-10 16:30:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 228 places, 235 transitions and 591 arcs took 5 ms.
Total runtime 36211 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT GPUForwardProgress-PT-12b
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability

FORMULA GPUForwardProgress-PT-12b-LTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPUForwardProgress-PT-12b-LTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPUForwardProgress-PT-12b-LTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678465815464

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:373
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 6 (type EXCL) for 3 GPUForwardProgress-PT-12b-LTLFireability-03
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 6 (type EXCL) for GPUForwardProgress-PT-12b-LTLFireability-03
lola: result : false
lola: markings : 7
lola: fired transitions : 9
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 GPUForwardProgress-PT-12b-LTLFireability-02
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for GPUForwardProgress-PT-12b-LTLFireability-02
lola: result : false
lola: markings : 150047
lola: fired transitions : 694324
lola: time used : 2.000000
lola: memory pages used : 2
lola: LAUNCH task # 11 (type EXCL) for 10 GPUForwardProgress-PT-12b-LTLFireability-04
lola: time limit : 3598 sec
lola: memory limit: 32 pages
lola: FINISHED task # 11 (type EXCL) for GPUForwardProgress-PT-12b-LTLFireability-04
lola: result : true
lola: markings : 16
lola: fired transitions : 20
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
GPUForwardProgress-PT-12b-LTLFireability-02: LTL false LTL model checker
GPUForwardProgress-PT-12b-LTLFireability-03: CONJ false LTL model checker
GPUForwardProgress-PT-12b-LTLFireability-04: LTL true LTL model checker


Time elapsed: 2 secs. Pages in use: 2

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="GPUForwardProgress-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 GPUForwardProgress-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 r199-smll-167840345400044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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