Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 6.6K Apr 29 12:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 29 12:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 12:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 29 12:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 9 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 160K May 10 09:34 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-32b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652736617740

Running Version 202205111006
[2022-05-16 21:30:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 21:30:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 21:30:20] [INFO ] Load time of PNML (sax parser for PT used): 273 ms
[2022-05-16 21:30:20] [INFO ] Transformed 644 places.
[2022-05-16 21:30:20] [INFO ] Transformed 677 transitions.
[2022-05-16 21:30:20] [INFO ] Found NUPN structural information;
[2022-05-16 21:30:20] [INFO ] Parsed PT model containing 644 places and 677 transitions in 545 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 131 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 644 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 644/644 places, 677/677 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 643 transition count 677
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 68 place count 576 transition count 610
Iterating global reduction 1 with 67 rules applied. Total rules applied 135 place count 576 transition count 610
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 165 place count 546 transition count 580
Iterating global reduction 1 with 30 rules applied. Total rules applied 195 place count 546 transition count 580
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 222 place count 546 transition count 553
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 223 place count 545 transition count 552
Iterating global reduction 2 with 1 rules applied. Total rules applied 224 place count 545 transition count 552
Applied a total of 224 rules in 327 ms. Remains 545 /644 variables (removed 99) and now considering 552/677 (removed 125) transitions.
// Phase 1: matrix 552 rows 545 cols
[2022-05-16 21:30:21] [INFO ] Computed 33 place invariants in 54 ms
[2022-05-16 21:30:22] [INFO ] Implicit Places using invariants in 620 ms returned []
// Phase 1: matrix 552 rows 545 cols
[2022-05-16 21:30:22] [INFO ] Computed 33 place invariants in 9 ms
[2022-05-16 21:30:23] [INFO ] Implicit Places using invariants and state equation in 921 ms returned []
Implicit Place search using SMT with State Equation took 1616 ms to find 0 implicit places.
// Phase 1: matrix 552 rows 545 cols
[2022-05-16 21:30:23] [INFO ] Computed 33 place invariants in 11 ms
[2022-05-16 21:30:23] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 545/644 places, 552/677 transitions.
Finished structural reductions, in 1 iterations. Remains : 545/644 places, 552/677 transitions.
Support contains 28 out of 545 places after structural reductions.
[2022-05-16 21:30:24] [INFO ] Flatten gal took : 160 ms
[2022-05-16 21:30:24] [INFO ] Flatten gal took : 85 ms
[2022-05-16 21:30:24] [INFO ] Input system was already deterministic with 552 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 799 ms. (steps per millisecond=12 ) properties (out of 28) seen :20
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 552 rows 545 cols
[2022-05-16 21:30:25] [INFO ] Computed 33 place invariants in 4 ms
[2022-05-16 21:30:26] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 37 ms returned sat
[2022-05-16 21:30:26] [INFO ] After 423ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2022-05-16 21:30:26] [INFO ] After 517ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:7
Attempting to minimize the solution found.
Minimization took 56 ms.
[2022-05-16 21:30:26] [INFO ] After 1006ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:7
[2022-05-16 21:30:27] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 32 ms returned sat
[2022-05-16 21:30:27] [INFO ] After 721ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-16 21:30:28] [INFO ] After 1306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 328 ms.
[2022-05-16 21:30:28] [INFO ] After 2151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 4 properties in 56 ms.
Support contains 3 out of 545 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 545/545 places, 552/552 transitions.
Graph (trivial) has 447 edges and 545 vertex of which 6 / 545 are part of one of the 1 SCC in 8 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 842 edges and 540 vertex of which 504 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.25 ms
Discarding 36 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 260 transitions
Trivial Post-agglo rules discarded 260 transitions
Performed 260 trivial Post agglomeration. Transition count delta: 260
Iterating post reduction 0 with 262 rules applied. Total rules applied 264 place count 504 transition count 280
Reduce places removed 260 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 268 rules applied. Total rules applied 532 place count 244 transition count 272
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 536 place count 240 transition count 272
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 536 place count 240 transition count 206
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 668 place count 174 transition count 206
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 701 place count 141 transition count 173
Iterating global reduction 3 with 33 rules applied. Total rules applied 734 place count 141 transition count 173
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 734 place count 141 transition count 172
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 736 place count 140 transition count 172
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 928 place count 44 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 122 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 930 place count 43 transition count 75
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 933 place count 43 transition count 72
Discarding 28 places :
Symmetric choice reduction at 5 with 28 rule applications. Total rules 961 place count 15 transition count 16
Iterating global reduction 5 with 28 rules applied. Total rules applied 989 place count 15 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 994 place count 12 transition count 14
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 17 edges and 12 vertex of which 11 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 3 rules applied. Total rules applied 997 place count 11 transition count 12
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 998 place count 11 transition count 11
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 999 place count 11 transition count 11
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1000 place count 11 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1001 place count 10 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1002 place count 9 transition count 9
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 1002 place count 9 transition count 6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 1008 place count 6 transition count 6
Applied a total of 1008 rules in 142 ms. Remains 6 /545 variables (removed 539) and now considering 6/552 (removed 546) transitions.
Finished structural reductions, in 1 iterations. Remains : 6/545 places, 6/552 transitions.
Finished random walk after 8 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=4 )
Computed a total of 102 stabilizing places and 102 stable transitions
Graph (complete) has 849 edges and 545 vertex of which 509 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.32 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(X(X(X(F(p0))))))))'
Support contains 1 out of 545 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 545/545 places, 552/552 transitions.
Graph (trivial) has 451 edges and 545 vertex of which 6 / 545 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 843 edges and 540 vertex of which 504 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.5 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 260 transitions
Trivial Post-agglo rules discarded 260 transitions
Performed 260 trivial Post agglomeration. Transition count delta: 260
Iterating post reduction 0 with 260 rules applied. Total rules applied 262 place count 503 transition count 282
Reduce places removed 260 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 269 rules applied. Total rules applied 531 place count 243 transition count 273
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 536 place count 239 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 537 place count 238 transition count 272
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 68 Pre rules applied. Total rules applied 537 place count 238 transition count 204
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 673 place count 170 transition count 204
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 704 place count 139 transition count 173
Iterating global reduction 4 with 31 rules applied. Total rules applied 735 place count 139 transition count 173
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 931 place count 41 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 932 place count 41 transition count 74
Discarding 31 places :
Symmetric choice reduction at 5 with 31 rule applications. Total rules 963 place count 10 transition count 13
Iterating global reduction 5 with 31 rules applied. Total rules applied 994 place count 10 transition count 13
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 996 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 997 place count 8 transition count 11
Applied a total of 997 rules in 86 ms. Remains 8 /545 variables (removed 537) and now considering 11/552 (removed 541) transitions.
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 21:30:29] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 21:30:29] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 21:30:29] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 21:30:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 21:30:29] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2022-05-16 21:30:29] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 21:30:29] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 21:30:29] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/545 places, 11/552 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/545 places, 11/552 transitions.
Stuttering acceptance computed with spot in 286 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s3 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-00 finished in 579 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(X(p0))&&F(G(X(p1))))))'
Support contains 4 out of 545 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 552/552 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 537 transition count 544
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 537 transition count 544
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 537 transition count 540
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 536 transition count 539
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 536 transition count 539
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 536 transition count 538
Applied a total of 23 rules in 118 ms. Remains 536 /545 variables (removed 9) and now considering 538/552 (removed 14) transitions.
// Phase 1: matrix 538 rows 536 cols
[2022-05-16 21:30:30] [INFO ] Computed 33 place invariants in 4 ms
[2022-05-16 21:30:30] [INFO ] Implicit Places using invariants in 202 ms returned []
// Phase 1: matrix 538 rows 536 cols
[2022-05-16 21:30:30] [INFO ] Computed 33 place invariants in 3 ms
[2022-05-16 21:30:31] [INFO ] Implicit Places using invariants and state equation in 587 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
// Phase 1: matrix 538 rows 536 cols
[2022-05-16 21:30:31] [INFO ] Computed 33 place invariants in 4 ms
[2022-05-16 21:30:31] [INFO ] Dead Transitions using invariants and state equation in 710 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 536/545 places, 538/552 transitions.
Finished structural reductions, in 1 iterations. Remains : 536/545 places, 538/552 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s494 1), p1:(AND (EQ s327 1) (EQ s523 1) (EQ s534 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 517 steps with 1 reset in 21 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-01 finished in 1949 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U p1))'
Support contains 2 out of 545 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 545/545 places, 552/552 transitions.
Graph (trivial) has 449 edges and 545 vertex of which 6 / 545 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 843 edges and 540 vertex of which 504 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.4 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 261 transitions
Trivial Post-agglo rules discarded 261 transitions
Performed 261 trivial Post agglomeration. Transition count delta: 261
Iterating post reduction 0 with 261 rules applied. Total rules applied 263 place count 503 transition count 281
Reduce places removed 261 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 268 rules applied. Total rules applied 531 place count 242 transition count 274
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 534 place count 239 transition count 274
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 534 place count 239 transition count 206
Deduced a syphon composed of 68 places in 2 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 670 place count 171 transition count 206
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 701 place count 140 transition count 175
Iterating global reduction 3 with 31 rules applied. Total rules applied 732 place count 140 transition count 175
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 924 place count 44 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 925 place count 44 transition count 78
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 955 place count 14 transition count 19
Iterating global reduction 4 with 30 rules applied. Total rules applied 985 place count 14 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 989 place count 12 transition count 18
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 992 place count 12 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 993 place count 11 transition count 17
Applied a total of 993 rules in 75 ms. Remains 11 /545 variables (removed 534) and now considering 17/552 (removed 535) transitions.
[2022-05-16 21:30:32] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
// Phase 1: matrix 15 rows 11 cols
[2022-05-16 21:30:32] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 21:30:32] [INFO ] Implicit Places using invariants in 37 ms returned []
[2022-05-16 21:30:32] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
// Phase 1: matrix 15 rows 11 cols
[2022-05-16 21:30:32] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 21:30:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 21:30:32] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2022-05-16 21:30:32] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-16 21:30:32] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
// Phase 1: matrix 15 rows 11 cols
[2022-05-16 21:30:32] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 21:30:32] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/545 places, 17/552 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/545 places, 17/552 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} 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 s5 1), p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-02 finished in 328 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G((F(p0)&&F(p1)))))'
Support contains 2 out of 545 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 545/545 places, 552/552 transitions.
Graph (trivial) has 449 edges and 545 vertex of which 6 / 545 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 843 edges and 540 vertex of which 504 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.4 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 259 transitions
Trivial Post-agglo rules discarded 259 transitions
Performed 259 trivial Post agglomeration. Transition count delta: 259
Iterating post reduction 0 with 259 rules applied. Total rules applied 261 place count 503 transition count 283
Reduce places removed 259 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 266 rules applied. Total rules applied 527 place count 244 transition count 276
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 531 place count 241 transition count 275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 532 place count 240 transition count 275
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 68 Pre rules applied. Total rules applied 532 place count 240 transition count 207
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 668 place count 172 transition count 207
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 699 place count 141 transition count 176
Iterating global reduction 4 with 31 rules applied. Total rules applied 730 place count 141 transition count 176
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 924 place count 44 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 925 place count 44 transition count 78
Discarding 30 places :
Symmetric choice reduction at 5 with 30 rule applications. Total rules 955 place count 14 transition count 19
Iterating global reduction 5 with 30 rules applied. Total rules applied 985 place count 14 transition count 19
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 989 place count 12 transition count 18
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 991 place count 12 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 992 place count 11 transition count 17
Applied a total of 992 rules in 90 ms. Remains 11 /545 variables (removed 534) and now considering 17/552 (removed 535) transitions.
[2022-05-16 21:30:32] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
// Phase 1: matrix 16 rows 11 cols
[2022-05-16 21:30:32] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 21:30:32] [INFO ] Implicit Places using invariants in 33 ms returned []
[2022-05-16 21:30:32] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
// Phase 1: matrix 16 rows 11 cols
[2022-05-16 21:30:32] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 21:30:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 21:30:32] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2022-05-16 21:30:32] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-16 21:30:32] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
// Phase 1: matrix 16 rows 11 cols
[2022-05-16 21:30:32] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 21:30:32] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/545 places, 17/552 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/545 places, 17/552 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-32b-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: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s4 0), p1:(EQ s5 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 1 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-03 finished in 383 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(G(F((G(p0)||p1))))||F(G(p2))))))'
Support contains 5 out of 545 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 545/545 places, 552/552 transitions.
Graph (trivial) has 445 edges and 545 vertex of which 6 / 545 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 843 edges and 540 vertex of which 504 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 258 transitions
Trivial Post-agglo rules discarded 258 transitions
Performed 258 trivial Post agglomeration. Transition count delta: 258
Iterating post reduction 0 with 258 rules applied. Total rules applied 260 place count 503 transition count 284
Reduce places removed 258 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 267 rules applied. Total rules applied 527 place count 245 transition count 275
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 531 place count 241 transition count 275
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 531 place count 241 transition count 208
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 665 place count 174 transition count 208
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 695 place count 144 transition count 178
Iterating global reduction 3 with 30 rules applied. Total rules applied 725 place count 144 transition count 178
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 917 place count 48 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 918 place count 48 transition count 81
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 948 place count 18 transition count 22
Iterating global reduction 4 with 30 rules applied. Total rules applied 978 place count 18 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 982 place count 16 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 983 place count 15 transition count 20
Applied a total of 983 rules in 46 ms. Remains 15 /545 variables (removed 530) and now considering 20/552 (removed 532) transitions.
[2022-05-16 21:30:32] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 15 cols
[2022-05-16 21:30:32] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 21:30:32] [INFO ] Implicit Places using invariants in 25 ms returned []
[2022-05-16 21:30:32] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 15 cols
[2022-05-16 21:30:32] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 21:30:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 21:30:32] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-16 21:30:33] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-16 21:30:33] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 15 cols
[2022-05-16 21:30:33] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 21:30:33] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/545 places, 20/552 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/545 places, 20/552 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p1) (NOT p0))), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(EQ s6 0), p1:(AND (EQ s3 1) (EQ s12 1) (EQ s14 1)), p0:(EQ s9 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 56 steps with 3 reset in 1 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-04 finished in 232 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G(X(G((G(p0)&&p1)))))))'
Support contains 4 out of 545 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 552/552 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 537 transition count 544
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 537 transition count 544
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 537 transition count 540
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 536 transition count 539
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 536 transition count 539
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 536 transition count 538
Applied a total of 23 rules in 47 ms. Remains 536 /545 variables (removed 9) and now considering 538/552 (removed 14) transitions.
// Phase 1: matrix 538 rows 536 cols
[2022-05-16 21:30:33] [INFO ] Computed 33 place invariants in 4 ms
[2022-05-16 21:30:33] [INFO ] Implicit Places using invariants in 218 ms returned []
// Phase 1: matrix 538 rows 536 cols
[2022-05-16 21:30:33] [INFO ] Computed 33 place invariants in 5 ms
[2022-05-16 21:30:34] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 966 ms to find 0 implicit places.
// Phase 1: matrix 538 rows 536 cols
[2022-05-16 21:30:34] [INFO ] Computed 33 place invariants in 7 ms
[2022-05-16 21:30:34] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 536/545 places, 538/552 transitions.
Finished structural reductions, in 1 iterations. Remains : 536/545 places, 538/552 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s507 1) (EQ s523 1) (EQ s534 1)), p1:(EQ s370 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-06 finished in 1853 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0 U p1))&&((p2 U !p0) U X(p0)))))'
Support contains 3 out of 545 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 552/552 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 538 transition count 545
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 538 transition count 545
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 538 transition count 542
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 537 transition count 541
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 537 transition count 541
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 537 transition count 540
Applied a total of 20 rules in 78 ms. Remains 537 /545 variables (removed 8) and now considering 540/552 (removed 12) transitions.
// Phase 1: matrix 540 rows 537 cols
[2022-05-16 21:30:35] [INFO ] Computed 33 place invariants in 3 ms
[2022-05-16 21:30:35] [INFO ] Implicit Places using invariants in 316 ms returned []
// Phase 1: matrix 540 rows 537 cols
[2022-05-16 21:30:35] [INFO ] Computed 33 place invariants in 3 ms
[2022-05-16 21:30:36] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
// Phase 1: matrix 540 rows 537 cols
[2022-05-16 21:30:36] [INFO ] Computed 33 place invariants in 3 ms
[2022-05-16 21:30:36] [INFO ] Dead Transitions using invariants and state equation in 749 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 537/545 places, 540/552 transitions.
Finished structural reductions, in 1 iterations. Remains : 537/545 places, 540/552 transitions.
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(OR (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s421 1), p2:(EQ s221 1), p1:(EQ s284 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 876 reset in 658 ms.
Product exploration explored 100000 steps with 893 reset in 437 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 837 edges and 537 vertex of which 501 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.6 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p1)), (X (OR (NOT p0) p2)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 261 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Finished random walk after 150 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p1)), (X (OR (NOT p0) p2)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 6 factoid took 361 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
// Phase 1: matrix 540 rows 537 cols
[2022-05-16 21:30:39] [INFO ] Computed 33 place invariants in 4 ms
[2022-05-16 21:30:40] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 24 ms returned sat
[2022-05-16 21:30:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 21:30:40] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2022-05-16 21:30:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 21:30:41] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 23 ms returned sat
[2022-05-16 21:30:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 21:30:41] [INFO ] [Nat]Absence check using state equation in 517 ms returned sat
[2022-05-16 21:30:41] [INFO ] Computed and/alt/rep : 534/701/534 causal constraints (skipped 5 transitions) in 71 ms.
[2022-05-16 21:30:48] [INFO ] Added : 520 causal constraints over 104 iterations in 7011 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 540 rows 537 cols
[2022-05-16 21:30:48] [INFO ] Computed 33 place invariants in 4 ms
[2022-05-16 21:30:49] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 29 ms returned sat
[2022-05-16 21:30:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 21:30:49] [INFO ] [Real]Absence check using state equation in 545 ms returned sat
[2022-05-16 21:30:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 21:30:50] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 19 ms returned sat
[2022-05-16 21:30:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 21:30:50] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2022-05-16 21:30:50] [INFO ] Computed and/alt/rep : 534/701/534 causal constraints (skipped 5 transitions) in 49 ms.
[2022-05-16 21:30:57] [INFO ] Added : 522 causal constraints over 105 iterations in 7036 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 537 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 540/540 transitions.
Applied a total of 0 rules in 26 ms. Remains 537 /537 variables (removed 0) and now considering 540/540 (removed 0) transitions.
// Phase 1: matrix 540 rows 537 cols
[2022-05-16 21:30:57] [INFO ] Computed 33 place invariants in 3 ms
[2022-05-16 21:30:57] [INFO ] Implicit Places using invariants in 325 ms returned []
// Phase 1: matrix 540 rows 537 cols
[2022-05-16 21:30:58] [INFO ] Computed 33 place invariants in 3 ms
[2022-05-16 21:30:58] [INFO ] Implicit Places using invariants and state equation in 792 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
// Phase 1: matrix 540 rows 537 cols
[2022-05-16 21:30:58] [INFO ] Computed 33 place invariants in 4 ms
[2022-05-16 21:30:59] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 537/537 places, 540/540 transitions.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 837 edges and 537 vertex of which 501 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.6 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Finished random walk after 181 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=60 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 3 factoid took 219 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
// Phase 1: matrix 540 rows 537 cols
[2022-05-16 21:31:00] [INFO ] Computed 33 place invariants in 3 ms
[2022-05-16 21:31:01] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 30 ms returned sat
[2022-05-16 21:31:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 21:31:01] [INFO ] [Real]Absence check using state equation in 583 ms returned sat
[2022-05-16 21:31:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 21:31:02] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 30 ms returned sat
[2022-05-16 21:31:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 21:31:02] [INFO ] [Nat]Absence check using state equation in 539 ms returned sat
[2022-05-16 21:31:02] [INFO ] Computed and/alt/rep : 534/701/534 causal constraints (skipped 5 transitions) in 37 ms.
[2022-05-16 21:31:09] [INFO ] Added : 520 causal constraints over 104 iterations in 6272 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 540 rows 537 cols
[2022-05-16 21:31:09] [INFO ] Computed 33 place invariants in 3 ms
[2022-05-16 21:31:09] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 28 ms returned sat
[2022-05-16 21:31:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 21:31:10] [INFO ] [Real]Absence check using state equation in 561 ms returned sat
[2022-05-16 21:31:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 21:31:10] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 28 ms returned sat
[2022-05-16 21:31:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 21:31:11] [INFO ] [Nat]Absence check using state equation in 516 ms returned sat
[2022-05-16 21:31:11] [INFO ] Computed and/alt/rep : 534/701/534 causal constraints (skipped 5 transitions) in 51 ms.
[2022-05-16 21:31:17] [INFO ] Added : 522 causal constraints over 105 iterations in 6735 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 864 reset in 273 ms.
Product exploration explored 100000 steps with 870 reset in 474 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 2 out of 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 540/540 transitions.
Graph (trivial) has 437 edges and 537 vertex of which 6 / 537 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 831 edges and 532 vertex of which 496 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 254 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 254 rules applied. Total rules applied 256 place count 496 transition count 531
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 257 place count 496 transition count 530
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 257 place count 496 transition count 532
Deduced a syphon composed of 289 places in 1 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 292 place count 496 transition count 532
Discarding 187 places :
Symmetric choice reduction at 2 with 187 rule applications. Total rules 479 place count 309 transition count 345
Deduced a syphon composed of 133 places in 5 ms
Iterating global reduction 2 with 187 rules applied. Total rules applied 666 place count 309 transition count 345
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 697 place count 278 transition count 314
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 728 place count 278 transition count 314
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 204 places in 0 ms
Iterating global reduction 2 with 102 rules applied. Total rules applied 830 place count 278 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 832 place count 278 transition count 313
Discarding 71 places :
Symmetric choice reduction at 3 with 71 rule applications. Total rules 903 place count 207 transition count 241
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 3 with 71 rules applied. Total rules applied 974 place count 207 transition count 241
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 134 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 975 place count 207 transition count 241
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 976 place count 206 transition count 240
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 977 place count 206 transition count 240
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -94
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 3 with 32 rules applied. Total rules applied 1009 place count 206 transition count 334
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1070 place count 145 transition count 212
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 3 with 61 rules applied. Total rules applied 1131 place count 145 transition count 212
Discarding 87 places :
Symmetric choice reduction at 3 with 87 rule applications. Total rules 1218 place count 58 transition count 67
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 3 with 87 rules applied. Total rules applied 1305 place count 58 transition count 67
Deduced a syphon composed of 46 places in 0 ms
Applied a total of 1305 rules in 135 ms. Remains 58 /537 variables (removed 479) and now considering 67/540 (removed 473) transitions.
[2022-05-16 21:31:19] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 67 rows 58 cols
[2022-05-16 21:31:19] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-16 21:31:19] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/537 places, 67/540 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/537 places, 67/540 transitions.
Stuttering criterion allowed to conclude after 41 steps with 5 reset in 2 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-08 finished in 44534 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(X(p0)))))'
Support contains 1 out of 545 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 552/552 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 537 transition count 544
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 537 transition count 544
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 537 transition count 540
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 536 transition count 539
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 536 transition count 539
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 536 transition count 538
Applied a total of 23 rules in 91 ms. Remains 536 /545 variables (removed 9) and now considering 538/552 (removed 14) transitions.
// Phase 1: matrix 538 rows 536 cols
[2022-05-16 21:31:19] [INFO ] Computed 33 place invariants in 2 ms
[2022-05-16 21:31:19] [INFO ] Implicit Places using invariants in 184 ms returned []
// Phase 1: matrix 538 rows 536 cols
[2022-05-16 21:31:19] [INFO ] Computed 33 place invariants in 3 ms
[2022-05-16 21:31:20] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
// Phase 1: matrix 538 rows 536 cols
[2022-05-16 21:31:20] [INFO ] Computed 33 place invariants in 3 ms
[2022-05-16 21:31:20] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 536/545 places, 538/552 transitions.
Finished structural reductions, in 1 iterations. Remains : 536/545 places, 538/552 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s174 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 265 steps with 0 reset in 3 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-09 finished in 1647 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 545 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 552/552 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 537 transition count 544
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 537 transition count 544
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 537 transition count 540
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 536 transition count 539
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 536 transition count 539
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 536 transition count 538
Applied a total of 23 rules in 66 ms. Remains 536 /545 variables (removed 9) and now considering 538/552 (removed 14) transitions.
// Phase 1: matrix 538 rows 536 cols
[2022-05-16 21:31:21] [INFO ] Computed 33 place invariants in 4 ms
[2022-05-16 21:31:21] [INFO ] Implicit Places using invariants in 288 ms returned []
// Phase 1: matrix 538 rows 536 cols
[2022-05-16 21:31:21] [INFO ] Computed 33 place invariants in 3 ms
[2022-05-16 21:31:22] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 889 ms to find 0 implicit places.
// Phase 1: matrix 538 rows 536 cols
[2022-05-16 21:31:22] [INFO ] Computed 33 place invariants in 6 ms
[2022-05-16 21:31:22] [INFO ] Dead Transitions using invariants and state equation in 450 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 536/545 places, 538/552 transitions.
Finished structural reductions, in 1 iterations. Remains : 536/545 places, 538/552 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s106 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-10 finished in 1539 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!G(F(X(F(p0)))) U F(!p0))))'
Support contains 1 out of 545 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 545/545 places, 552/552 transitions.
Graph (trivial) has 451 edges and 545 vertex of which 6 / 545 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 843 edges and 540 vertex of which 504 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 260 transitions
Trivial Post-agglo rules discarded 260 transitions
Performed 260 trivial Post agglomeration. Transition count delta: 260
Iterating post reduction 0 with 260 rules applied. Total rules applied 262 place count 503 transition count 282
Reduce places removed 260 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 269 rules applied. Total rules applied 531 place count 243 transition count 273
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 536 place count 239 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 537 place count 238 transition count 272
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 68 Pre rules applied. Total rules applied 537 place count 238 transition count 204
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 673 place count 170 transition count 204
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 704 place count 139 transition count 173
Iterating global reduction 4 with 31 rules applied. Total rules applied 735 place count 139 transition count 173
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 931 place count 41 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 932 place count 41 transition count 74
Discarding 31 places :
Symmetric choice reduction at 5 with 31 rule applications. Total rules 963 place count 10 transition count 13
Iterating global reduction 5 with 31 rules applied. Total rules applied 994 place count 10 transition count 13
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 996 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 997 place count 8 transition count 11
Applied a total of 997 rules in 46 ms. Remains 8 /545 variables (removed 537) and now considering 11/552 (removed 541) transitions.
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 21:31:22] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 21:31:22] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 21:31:22] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 21:31:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 21:31:22] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2022-05-16 21:31:22] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 21:31:22] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 21:31:22] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/545 places, 11/552 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/545 places, 11/552 transitions.
Stuttering acceptance computed with spot in 37 ms :[p0]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-11 finished in 260 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((G(p0)&&!(p0 U p1)))&&F(p2))))'
Support contains 2 out of 545 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 545/545 places, 552/552 transitions.
Graph (trivial) has 448 edges and 545 vertex of which 6 / 545 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 843 edges and 540 vertex of which 504 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 258 transitions
Trivial Post-agglo rules discarded 258 transitions
Performed 258 trivial Post agglomeration. Transition count delta: 258
Iterating post reduction 0 with 258 rules applied. Total rules applied 260 place count 503 transition count 284
Reduce places removed 258 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 267 rules applied. Total rules applied 527 place count 245 transition count 275
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 533 place count 241 transition count 273
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 535 place count 239 transition count 273
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 68 Pre rules applied. Total rules applied 535 place count 239 transition count 205
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 671 place count 171 transition count 205
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 702 place count 140 transition count 174
Iterating global reduction 4 with 31 rules applied. Total rules applied 733 place count 140 transition count 174
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 927 place count 43 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 928 place count 43 transition count 76
Discarding 30 places :
Symmetric choice reduction at 5 with 30 rule applications. Total rules 958 place count 13 transition count 17
Iterating global reduction 5 with 30 rules applied. Total rules applied 988 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 990 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 991 place count 11 transition count 15
Applied a total of 991 rules in 37 ms. Remains 11 /545 variables (removed 534) and now considering 15/552 (removed 537) transitions.
// Phase 1: matrix 15 rows 11 cols
[2022-05-16 21:31:22] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 21:31:23] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 15 rows 11 cols
[2022-05-16 21:31:23] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 21:31:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 21:31:23] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2022-05-16 21:31:23] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 15 rows 11 cols
[2022-05-16 21:31:23] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 21:31:23] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/545 places, 15/552 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/545 places, 15/552 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (NOT p2) p1), p1, (NOT p0), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p1), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s2 1), p1:(EQ s7 1), p2:(EQ s7 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-12 finished in 380 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(G(F((F(!((p0 U p1) U p1))&&p2)))))))'
Support contains 2 out of 545 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 545/545 places, 552/552 transitions.
Graph (trivial) has 449 edges and 545 vertex of which 6 / 545 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 843 edges and 540 vertex of which 504 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 260 transitions
Trivial Post-agglo rules discarded 260 transitions
Performed 260 trivial Post agglomeration. Transition count delta: 260
Iterating post reduction 0 with 260 rules applied. Total rules applied 262 place count 503 transition count 282
Reduce places removed 260 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 266 rules applied. Total rules applied 528 place count 243 transition count 276
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 531 place count 240 transition count 276
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 531 place count 240 transition count 209
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 665 place count 173 transition count 209
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 696 place count 142 transition count 178
Iterating global reduction 3 with 31 rules applied. Total rules applied 727 place count 142 transition count 178
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 921 place count 45 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 922 place count 45 transition count 80
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 952 place count 15 transition count 21
Iterating global reduction 4 with 30 rules applied. Total rules applied 982 place count 15 transition count 21
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 988 place count 12 transition count 20
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 990 place count 12 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 991 place count 11 transition count 19
Applied a total of 991 rules in 35 ms. Remains 11 /545 variables (removed 534) and now considering 19/552 (removed 533) transitions.
[2022-05-16 21:31:23] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
// Phase 1: matrix 17 rows 11 cols
[2022-05-16 21:31:23] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 21:31:23] [INFO ] Implicit Places using invariants in 19 ms returned []
[2022-05-16 21:31:23] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
// Phase 1: matrix 17 rows 11 cols
[2022-05-16 21:31:23] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 21:31:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 21:31:23] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2022-05-16 21:31:23] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-16 21:31:23] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
// Phase 1: matrix 17 rows 11 cols
[2022-05-16 21:31:23] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 21:31:23] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/545 places, 19/552 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/545 places, 19/552 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p2) p1), p1, (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s0 1), p2:(EQ s0 0), p0:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 38 steps with 4 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-13 finished in 260 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 545 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 552/552 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 537 transition count 544
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 537 transition count 544
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 537 transition count 540
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 536 transition count 539
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 536 transition count 539
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 536 transition count 538
Applied a total of 23 rules in 44 ms. Remains 536 /545 variables (removed 9) and now considering 538/552 (removed 14) transitions.
// Phase 1: matrix 538 rows 536 cols
[2022-05-16 21:31:23] [INFO ] Computed 33 place invariants in 1 ms
[2022-05-16 21:31:24] [INFO ] Implicit Places using invariants in 384 ms returned []
// Phase 1: matrix 538 rows 536 cols
[2022-05-16 21:31:24] [INFO ] Computed 33 place invariants in 3 ms
[2022-05-16 21:31:24] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 1007 ms to find 0 implicit places.
// Phase 1: matrix 538 rows 536 cols
[2022-05-16 21:31:24] [INFO ] Computed 33 place invariants in 3 ms
[2022-05-16 21:31:25] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 536/545 places, 538/552 transitions.
Finished structural reductions, in 1 iterations. Remains : 536/545 places, 538/552 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s325 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 265 steps with 0 reset in 4 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-14 finished in 1675 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!F(p0) U (!X(p1)&&!p1)))'
Support contains 2 out of 545 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 552/552 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 538 transition count 545
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 538 transition count 545
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 538 transition count 541
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 537 transition count 540
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 537 transition count 540
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 537 transition count 539
Applied a total of 21 rules in 43 ms. Remains 537 /545 variables (removed 8) and now considering 539/552 (removed 13) transitions.
// Phase 1: matrix 539 rows 537 cols
[2022-05-16 21:31:25] [INFO ] Computed 33 place invariants in 3 ms
[2022-05-16 21:31:25] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 539 rows 537 cols
[2022-05-16 21:31:25] [INFO ] Computed 33 place invariants in 9 ms
[2022-05-16 21:31:26] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 964 ms to find 0 implicit places.
// Phase 1: matrix 539 rows 537 cols
[2022-05-16 21:31:26] [INFO ] Computed 33 place invariants in 3 ms
[2022-05-16 21:31:26] [INFO ] Dead Transitions using invariants and state equation in 550 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 537/545 places, 539/552 transitions.
Finished structural reductions, in 1 iterations. Remains : 537/545 places, 539/552 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s111 1), p0:(EQ s393 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-15 finished in 1759 ms.
All properties solved by simple procedures.
Total runtime 66838 ms.

BK_STOP 1652736687130

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-32b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-32b, 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 r096-smll-165260576200420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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