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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 6.6K Apr 29 12:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 29 12:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 29 12:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 29 12:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:57 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 199K 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-40b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652747269643

Running Version 202205111006
[2022-05-17 00:27:51] [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-17 00:27:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 00:27:52] [INFO ] Load time of PNML (sax parser for PT used): 295 ms
[2022-05-17 00:27:52] [INFO ] Transformed 796 places.
[2022-05-17 00:27:52] [INFO ] Transformed 837 transitions.
[2022-05-17 00:27:52] [INFO ] Found NUPN structural information;
[2022-05-17 00:27:52] [INFO ] Parsed PT model containing 796 places and 837 transitions in 587 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Support contains 36 out of 796 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 796/796 places, 837/837 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 795 transition count 837
Discarding 77 places :
Symmetric choice reduction at 1 with 77 rule applications. Total rules 78 place count 718 transition count 760
Iterating global reduction 1 with 77 rules applied. Total rules applied 155 place count 718 transition count 760
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 192 place count 681 transition count 723
Iterating global reduction 1 with 37 rules applied. Total rules applied 229 place count 681 transition count 723
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 263 place count 681 transition count 689
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 264 place count 680 transition count 688
Iterating global reduction 2 with 1 rules applied. Total rules applied 265 place count 680 transition count 688
Applied a total of 265 rules in 420 ms. Remains 680 /796 variables (removed 116) and now considering 688/837 (removed 149) transitions.
// Phase 1: matrix 688 rows 680 cols
[2022-05-17 00:27:53] [INFO ] Computed 41 place invariants in 54 ms
[2022-05-17 00:27:54] [INFO ] Implicit Places using invariants in 898 ms returned []
// Phase 1: matrix 688 rows 680 cols
[2022-05-17 00:27:54] [INFO ] Computed 41 place invariants in 11 ms
[2022-05-17 00:27:55] [INFO ] Implicit Places using invariants and state equation in 1109 ms returned []
Implicit Place search using SMT with State Equation took 2290 ms to find 0 implicit places.
// Phase 1: matrix 688 rows 680 cols
[2022-05-17 00:27:55] [INFO ] Computed 41 place invariants in 16 ms
[2022-05-17 00:27:56] [INFO ] Dead Transitions using invariants and state equation in 894 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 680/796 places, 688/837 transitions.
Finished structural reductions, in 1 iterations. Remains : 680/796 places, 688/837 transitions.
Support contains 36 out of 680 places after structural reductions.
[2022-05-17 00:27:56] [INFO ] Flatten gal took : 206 ms
[2022-05-17 00:27:56] [INFO ] Flatten gal took : 102 ms
[2022-05-17 00:27:57] [INFO ] Input system was already deterministic with 688 transitions.
Support contains 33 out of 680 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 1071 ms. (steps per millisecond=9 ) properties (out of 33) seen :21
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 688 rows 680 cols
[2022-05-17 00:27:59] [INFO ] Computed 41 place invariants in 5 ms
[2022-05-17 00:27:59] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 68 ms returned sat
[2022-05-17 00:27:59] [INFO ] After 707ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-05-17 00:28:00] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 44 ms returned sat
[2022-05-17 00:28:01] [INFO ] After 795ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :11
[2022-05-17 00:28:02] [INFO ] After 1838ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :11
Attempting to minimize the solution found.
Minimization took 556 ms.
[2022-05-17 00:28:02] [INFO ] After 3209ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :11
Fused 12 Parikh solutions to 9 different solutions.
Finished Parikh walk after 222 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=74 )
Parikh walk visited 11 properties in 98 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
Computed a total of 127 stabilizing places and 127 stable transitions
Graph (complete) has 1057 edges and 680 vertex of which 636 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.85 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 680/680 places, 688/688 transitions.
Graph (trivial) has 563 edges and 680 vertex of which 6 / 680 are part of one of the 1 SCC in 7 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1051 edges and 675 vertex of which 631 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.8 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 338 place count 630 transition count 342
Reduce places removed 336 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 342 rules applied. Total rules applied 680 place count 294 transition count 336
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 680 place count 294 transition count 252
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 848 place count 210 transition count 252
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 887 place count 171 transition count 213
Iterating global reduction 2 with 39 rules applied. Total rules applied 926 place count 171 transition count 213
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 1170 place count 49 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1171 place count 49 transition count 90
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1210 place count 10 transition count 13
Iterating global reduction 3 with 39 rules applied. Total rules applied 1249 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 3 with 2 rules applied. Total rules applied 1251 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1252 place count 8 transition count 11
Applied a total of 1252 rules in 130 ms. Remains 8 /680 variables (removed 672) and now considering 11/688 (removed 677) transitions.
// Phase 1: matrix 11 rows 8 cols
[2022-05-17 00:28:03] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-17 00:28:03] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-17 00:28:03] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:28:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:28:04] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2022-05-17 00:28:04] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-17 00:28:04] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-17 00:28:04] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/680 places, 11/688 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/680 places, 11/688 transitions.
Stuttering acceptance computed with spot in 311 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-00 finished in 698 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0))||p1)))'
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 680/680 places, 688/688 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 670 transition count 678
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 670 transition count 678
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 664 transition count 672
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 664 transition count 672
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 38 place count 664 transition count 666
Applied a total of 38 rules in 201 ms. Remains 664 /680 variables (removed 16) and now considering 666/688 (removed 22) transitions.
// Phase 1: matrix 666 rows 664 cols
[2022-05-17 00:28:04] [INFO ] Computed 41 place invariants in 17 ms
[2022-05-17 00:28:04] [INFO ] Implicit Places using invariants in 361 ms returned []
// Phase 1: matrix 666 rows 664 cols
[2022-05-17 00:28:04] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-17 00:28:05] [INFO ] Implicit Places using invariants and state equation in 857 ms returned []
Implicit Place search using SMT with State Equation took 1225 ms to find 0 implicit places.
// Phase 1: matrix 666 rows 664 cols
[2022-05-17 00:28:05] [INFO ] Computed 41 place invariants in 5 ms
[2022-05-17 00:28:06] [INFO ] Dead Transitions using invariants and state equation in 912 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 664/680 places, 666/688 transitions.
Finished structural reductions, in 1 iterations. Remains : 664/680 places, 666/688 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s651 1), p0:(EQ s651 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 307 steps with 72 reset in 12 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-01 finished in 2535 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(G(F(p0))))&&F(G(p1)))))'
Support contains 2 out of 680 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 680/680 places, 688/688 transitions.
Graph (trivial) has 562 edges and 680 vertex of which 6 / 680 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 1051 edges and 675 vertex of which 631 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.4 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 335 transitions
Trivial Post-agglo rules discarded 335 transitions
Performed 335 trivial Post agglomeration. Transition count delta: 335
Iterating post reduction 0 with 335 rules applied. Total rules applied 337 place count 630 transition count 343
Reduce places removed 335 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 341 rules applied. Total rules applied 678 place count 295 transition count 337
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 679 place count 294 transition count 337
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 679 place count 294 transition count 254
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 845 place count 211 transition count 254
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 884 place count 172 transition count 215
Iterating global reduction 3 with 39 rules applied. Total rules applied 923 place count 172 transition count 215
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 1163 place count 52 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1164 place count 52 transition count 94
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 1203 place count 13 transition count 17
Iterating global reduction 4 with 39 rules applied. Total rules applied 1242 place count 13 transition count 17
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 1246 place count 11 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1247 place count 10 transition count 15
Applied a total of 1247 rules in 56 ms. Remains 10 /680 variables (removed 670) and now considering 15/688 (removed 673) transitions.
[2022-05-17 00:28:07] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 10 cols
[2022-05-17 00:28:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:28:07] [INFO ] Implicit Places using invariants in 43 ms returned []
[2022-05-17 00:28:07] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 10 cols
[2022-05-17 00:28:07] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-17 00:28:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:28:07] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2022-05-17 00:28:07] [INFO ] Redundant transitions in 19 ms returned []
[2022-05-17 00:28:07] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 10 cols
[2022-05-17 00:28:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:28:07] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/680 places, 15/688 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/680 places, 15/688 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-02 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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s3 1), p1:(EQ s6 0)], 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 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-02 finished in 457 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))||X(X(p1)))))'
Support contains 2 out of 680 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 680/680 places, 688/688 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 671 transition count 679
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 671 transition count 679
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 665 transition count 673
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 665 transition count 673
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 665 transition count 667
Applied a total of 36 rules in 249 ms. Remains 665 /680 variables (removed 15) and now considering 667/688 (removed 21) transitions.
// Phase 1: matrix 667 rows 665 cols
[2022-05-17 00:28:07] [INFO ] Computed 41 place invariants in 5 ms
[2022-05-17 00:28:08] [INFO ] Implicit Places using invariants in 407 ms returned []
// Phase 1: matrix 667 rows 665 cols
[2022-05-17 00:28:08] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-17 00:28:09] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1402 ms to find 0 implicit places.
// Phase 1: matrix 667 rows 665 cols
[2022-05-17 00:28:09] [INFO ] Computed 41 place invariants in 8 ms
[2022-05-17 00:28:09] [INFO ] Dead Transitions using invariants and state equation in 668 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 665/680 places, 667/688 transitions.
Finished structural reductions, in 1 iterations. Remains : 665/680 places, 667/688 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s49 1), p1:(EQ s145 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 979 ms.
Product exploration explored 100000 steps with 33333 reset in 1146 ms.
Computed a total of 124 stabilizing places and 124 stable transitions
Graph (complete) has 1036 edges and 665 vertex of which 621 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.17 ms
Computed a total of 124 stabilizing places and 124 stable transitions
Detected a total of 124/665 stabilizing places and 124/667 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-03 finished in 4751 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F((p0 U p1))))&&X(p2)))'
Support contains 3 out of 680 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 680/680 places, 688/688 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 670 transition count 678
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 670 transition count 678
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 664 transition count 672
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 664 transition count 672
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 38 place count 664 transition count 666
Applied a total of 38 rules in 113 ms. Remains 664 /680 variables (removed 16) and now considering 666/688 (removed 22) transitions.
// Phase 1: matrix 666 rows 664 cols
[2022-05-17 00:28:12] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-17 00:28:12] [INFO ] Implicit Places using invariants in 403 ms returned []
// Phase 1: matrix 666 rows 664 cols
[2022-05-17 00:28:12] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-17 00:28:13] [INFO ] Implicit Places using invariants and state equation in 785 ms returned []
Implicit Place search using SMT with State Equation took 1191 ms to find 0 implicit places.
// Phase 1: matrix 666 rows 664 cols
[2022-05-17 00:28:13] [INFO ] Computed 41 place invariants in 6 ms
[2022-05-17 00:28:14] [INFO ] Dead Transitions using invariants and state equation in 888 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 664/680 places, 666/688 transitions.
Finished structural reductions, in 1 iterations. Remains : 664/680 places, 666/688 transitions.
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (NEQ s318 1) (EQ s14 1)), p2:(EQ s123 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1185 ms.
Product exploration explored 100000 steps with 50000 reset in 862 ms.
Computed a total of 123 stabilizing places and 123 stable transitions
Graph (complete) has 1035 edges and 664 vertex of which 620 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.11 ms
Computed a total of 123 stabilizing places and 123 stable transitions
Knowledge obtained : [(AND p1 p2), (X (NOT (AND p2 (NOT p1)))), (X p2), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 5 factoid took 130 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-04 finished in 4655 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X((G(p1)&&p0)))))'
Support contains 4 out of 680 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 680/680 places, 688/688 transitions.
Graph (trivial) has 560 edges and 680 vertex of which 6 / 680 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 1051 edges and 675 vertex of which 631 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.5 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 338 place count 630 transition count 342
Reduce places removed 336 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 343 rules applied. Total rules applied 681 place count 294 transition count 335
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 682 place count 293 transition count 335
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 81 Pre rules applied. Total rules applied 682 place count 293 transition count 254
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 844 place count 212 transition count 254
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 883 place count 173 transition count 215
Iterating global reduction 3 with 39 rules applied. Total rules applied 922 place count 173 transition count 215
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 1166 place count 51 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1167 place count 51 transition count 92
Discarding 38 places :
Symmetric choice reduction at 4 with 38 rule applications. Total rules 1205 place count 13 transition count 17
Iterating global reduction 4 with 38 rules applied. Total rules applied 1243 place count 13 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1245 place count 12 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1246 place count 11 transition count 15
Applied a total of 1246 rules in 66 ms. Remains 11 /680 variables (removed 669) and now considering 15/688 (removed 673) transitions.
// Phase 1: matrix 15 rows 11 cols
[2022-05-17 00:28:16] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-17 00:28:16] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 15 rows 11 cols
[2022-05-17 00:28:16] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-17 00:28:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:28:16] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2022-05-17 00:28:16] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 15 rows 11 cols
[2022-05-17 00:28:16] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-17 00:28:17] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/680 places, 15/688 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/680 places, 15/688 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s8 1) (EQ s10 1)), p1:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-05 finished in 368 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 2 out of 680 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 680/680 places, 688/688 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 670 transition count 678
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 670 transition count 678
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 664 transition count 672
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 664 transition count 672
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 38 place count 664 transition count 666
Applied a total of 38 rules in 114 ms. Remains 664 /680 variables (removed 16) and now considering 666/688 (removed 22) transitions.
// Phase 1: matrix 666 rows 664 cols
[2022-05-17 00:28:17] [INFO ] Computed 41 place invariants in 9 ms
[2022-05-17 00:28:17] [INFO ] Implicit Places using invariants in 389 ms returned []
// Phase 1: matrix 666 rows 664 cols
[2022-05-17 00:28:17] [INFO ] Computed 41 place invariants in 6 ms
[2022-05-17 00:28:18] [INFO ] Implicit Places using invariants and state equation in 1035 ms returned []
Implicit Place search using SMT with State Equation took 1428 ms to find 0 implicit places.
// Phase 1: matrix 666 rows 664 cols
[2022-05-17 00:28:18] [INFO ] Computed 41 place invariants in 5 ms
[2022-05-17 00:28:19] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 664/680 places, 666/688 transitions.
Finished structural reductions, in 1 iterations. Remains : 664/680 places, 666/688 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s141 1), p1:(EQ s98 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-06 finished in 2472 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G((G(p1)||p0))))'
Support contains 3 out of 680 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 680/680 places, 688/688 transitions.
Graph (trivial) has 558 edges and 680 vertex of which 6 / 680 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 1051 edges and 675 vertex of which 631 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.4 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 333 transitions
Trivial Post-agglo rules discarded 333 transitions
Performed 333 trivial Post agglomeration. Transition count delta: 333
Iterating post reduction 0 with 333 rules applied. Total rules applied 335 place count 630 transition count 345
Reduce places removed 333 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 339 rules applied. Total rules applied 674 place count 297 transition count 339
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 675 place count 296 transition count 339
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 675 place count 296 transition count 256
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 841 place count 213 transition count 256
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 880 place count 174 transition count 217
Iterating global reduction 3 with 39 rules applied. Total rules applied 919 place count 174 transition count 217
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 1159 place count 54 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1160 place count 54 transition count 96
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 1197 place count 17 transition count 23
Iterating global reduction 4 with 37 rules applied. Total rules applied 1234 place count 17 transition count 23
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 1238 place count 15 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1239 place count 15 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1240 place count 14 transition count 21
Applied a total of 1240 rules in 68 ms. Remains 14 /680 variables (removed 666) and now considering 21/688 (removed 667) transitions.
[2022-05-17 00:28:19] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
// Phase 1: matrix 19 rows 14 cols
[2022-05-17 00:28:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:28:19] [INFO ] Implicit Places using invariants in 31 ms returned []
[2022-05-17 00:28:19] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
// Phase 1: matrix 19 rows 14 cols
[2022-05-17 00:28:19] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-17 00:28:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:28:19] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2022-05-17 00:28:19] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-17 00:28:19] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
// Phase 1: matrix 19 rows 14 cols
[2022-05-17 00:28:19] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-17 00:28:19] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/680 places, 21/688 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/680 places, 21/688 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(EQ s9 0), p0:(OR (EQ s9 0) (AND (EQ s3 0) (EQ s6 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 162 steps with 10 reset in 3 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-07 finished in 347 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(F(G((G(p0)||p1))))||p1))))'
Support contains 2 out of 680 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 680/680 places, 688/688 transitions.
Graph (trivial) has 561 edges and 680 vertex of which 6 / 680 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 1051 edges and 675 vertex of which 631 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.4 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 334 transitions
Trivial Post-agglo rules discarded 334 transitions
Performed 334 trivial Post agglomeration. Transition count delta: 334
Iterating post reduction 0 with 334 rules applied. Total rules applied 336 place count 630 transition count 344
Reduce places removed 334 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 339 rules applied. Total rules applied 675 place count 296 transition count 339
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 675 place count 296 transition count 255
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 843 place count 212 transition count 255
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 882 place count 173 transition count 216
Iterating global reduction 2 with 39 rules applied. Total rules applied 921 place count 173 transition count 216
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 1163 place count 52 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1164 place count 52 transition count 94
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1203 place count 13 transition count 17
Iterating global reduction 3 with 39 rules applied. Total rules applied 1242 place count 13 transition count 17
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 3 with 4 rules applied. Total rules applied 1246 place count 11 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1247 place count 10 transition count 15
Applied a total of 1247 rules in 56 ms. Remains 10 /680 variables (removed 670) and now considering 15/688 (removed 673) transitions.
[2022-05-17 00:28:20] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 10 cols
[2022-05-17 00:28:20] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-17 00:28:20] [INFO ] Implicit Places using invariants in 29 ms returned []
[2022-05-17 00:28:20] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 10 cols
[2022-05-17 00:28:20] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:28:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:28:20] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2022-05-17 00:28:20] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-17 00:28:20] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 10 cols
[2022-05-17 00:28:20] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-17 00:28:20] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/680 places, 15/688 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/680 places, 15/688 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s4 0), p0:(EQ s3 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 135 steps with 12 reset in 1 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-08 finished in 307 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||F((p1&&(p2 U !p0)))))))'
Support contains 5 out of 680 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 680/680 places, 688/688 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 672 transition count 680
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 672 transition count 680
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 667 transition count 675
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 667 transition count 675
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 31 place count 667 transition count 670
Applied a total of 31 rules in 123 ms. Remains 667 /680 variables (removed 13) and now considering 670/688 (removed 18) transitions.
// Phase 1: matrix 670 rows 667 cols
[2022-05-17 00:28:20] [INFO ] Computed 41 place invariants in 5 ms
[2022-05-17 00:28:20] [INFO ] Implicit Places using invariants in 381 ms returned []
// Phase 1: matrix 670 rows 667 cols
[2022-05-17 00:28:20] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-17 00:28:21] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
// Phase 1: matrix 670 rows 667 cols
[2022-05-17 00:28:21] [INFO ] Computed 41 place invariants in 5 ms
[2022-05-17 00:28:22] [INFO ] Dead Transitions using invariants and state equation in 754 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 667/680 places, 670/688 transitions.
Finished structural reductions, in 1 iterations. Remains : 667/680 places, 670/688 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), p0]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p0 (NOT p2)) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s500 1), p1:(EQ s340 1), p2:(AND (EQ s140 1) (EQ s654 1) (EQ s665 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 609 reset in 391 ms.
Product exploration explored 100000 steps with 603 reset in 607 ms.
Computed a total of 124 stabilizing places and 124 stable transitions
Graph (complete) has 1039 edges and 667 vertex of which 623 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.8 ms
Computed a total of 124 stabilizing places and 124 stable transitions
Detected a total of 124/667 stabilizing places and 124/670 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR (AND p0 (NOT p2)) (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 529 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), p0]
Incomplete random walk after 10000 steps, including 29 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 670 rows 667 cols
[2022-05-17 00:28:24] [INFO ] Computed 41 place invariants in 10 ms
[2022-05-17 00:28:25] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 53 ms returned sat
[2022-05-17 00:28:25] [INFO ] After 813ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 00:28:25] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 47 ms returned sat
[2022-05-17 00:28:26] [INFO ] After 670ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 00:28:26] [INFO ] After 929ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 150 ms.
[2022-05-17 00:28:26] [INFO ] After 1399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 124 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=17 )
Parikh walk visited 3 properties in 7 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR (AND p0 (NOT p2)) (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 p2)), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1 p2)), (F (NOT (OR (AND p0 (NOT p2)) (NOT p1))))]
Knowledge based reduction with 7 factoid took 418 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), p0]
// Phase 1: matrix 670 rows 667 cols
[2022-05-17 00:28:27] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-17 00:28:28] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 40 ms returned sat
[2022-05-17 00:28:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:28:29] [INFO ] [Real]Absence check using state equation in 735 ms returned sat
[2022-05-17 00:28:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:28:29] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 39 ms returned sat
[2022-05-17 00:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:28:30] [INFO ] [Nat]Absence check using state equation in 806 ms returned sat
[2022-05-17 00:28:30] [INFO ] Computed and/alt/rep : 664/872/664 causal constraints (skipped 5 transitions) in 177 ms.
[2022-05-17 00:28:41] [INFO ] Added : 640 causal constraints over 128 iterations in 10587 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 5 out of 667 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 667/667 places, 670/670 transitions.
Applied a total of 0 rules in 23 ms. Remains 667 /667 variables (removed 0) and now considering 670/670 (removed 0) transitions.
// Phase 1: matrix 670 rows 667 cols
[2022-05-17 00:28:41] [INFO ] Computed 41 place invariants in 7 ms
[2022-05-17 00:28:41] [INFO ] Implicit Places using invariants in 338 ms returned []
// Phase 1: matrix 670 rows 667 cols
[2022-05-17 00:28:41] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-17 00:28:42] [INFO ] Implicit Places using invariants and state equation in 774 ms returned []
Implicit Place search using SMT with State Equation took 1116 ms to find 0 implicit places.
// Phase 1: matrix 670 rows 667 cols
[2022-05-17 00:28:42] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-17 00:28:43] [INFO ] Dead Transitions using invariants and state equation in 805 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 667/667 places, 670/670 transitions.
Computed a total of 124 stabilizing places and 124 stable transitions
Graph (complete) has 1039 edges and 667 vertex of which 623 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.5 ms
Computed a total of 124 stabilizing places and 124 stable transitions
Detected a total of 124/667 stabilizing places and 124/670 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p0) (NOT p1))), (X (OR (AND p0 (NOT p2)) (NOT p1))), true, (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND p0 (NOT p2)) (NOT p1)))), (X (X (NOT (AND p0 p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 655 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), p0]
Incomplete random walk after 10000 steps, including 30 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 670 rows 667 cols
[2022-05-17 00:28:44] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-17 00:28:44] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 47 ms returned sat
[2022-05-17 00:28:45] [INFO ] After 884ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 00:28:45] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 50 ms returned sat
[2022-05-17 00:28:46] [INFO ] After 674ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 00:28:46] [INFO ] After 982ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 194 ms.
[2022-05-17 00:28:46] [INFO ] After 1510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 125 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=17 )
Parikh walk visited 3 properties in 7 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p0) (NOT p1))), (X (OR (AND p0 (NOT p2)) (NOT p1))), true, (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND p0 (NOT p2)) (NOT p1)))), (X (X (NOT (AND p0 p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 p2)), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1 p2)), (F (NOT (OR (AND p0 (NOT p2)) (NOT p1))))]
Knowledge based reduction with 11 factoid took 794 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), p0]
// Phase 1: matrix 670 rows 667 cols
[2022-05-17 00:28:48] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-17 00:28:48] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 40 ms returned sat
[2022-05-17 00:28:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:28:49] [INFO ] [Real]Absence check using state equation in 787 ms returned sat
[2022-05-17 00:28:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:28:50] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 37 ms returned sat
[2022-05-17 00:28:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:28:51] [INFO ] [Nat]Absence check using state equation in 712 ms returned sat
[2022-05-17 00:28:51] [INFO ] Computed and/alt/rep : 664/872/664 causal constraints (skipped 5 transitions) in 73 ms.
[2022-05-17 00:29:01] [INFO ] Added : 640 causal constraints over 128 iterations in 10411 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), p0]
Product exploration explored 100000 steps with 605 reset in 288 ms.
Product exploration explored 100000 steps with 604 reset in 311 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), p0]
Support contains 5 out of 667 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 667/667 places, 670/670 transitions.
Graph (trivial) has 539 edges and 667 vertex of which 6 / 667 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 1033 edges and 662 vertex of which 618 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.3 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 320 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 320 rules applied. Total rules applied 322 place count 618 transition count 661
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 43 Pre rules applied. Total rules applied 322 place count 618 transition count 663
Deduced a syphon composed of 363 places in 2 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 365 place count 618 transition count 663
Discarding 237 places :
Symmetric choice reduction at 1 with 237 rule applications. Total rules 602 place count 381 transition count 426
Deduced a syphon composed of 165 places in 1 ms
Iterating global reduction 1 with 237 rules applied. Total rules applied 839 place count 381 transition count 426
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 878 place count 342 transition count 387
Deduced a syphon composed of 126 places in 1 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 917 place count 342 transition count 387
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 248 places in 0 ms
Iterating global reduction 1 with 122 rules applied. Total rules applied 1039 place count 342 transition count 388
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1041 place count 342 transition count 386
Discarding 83 places :
Symmetric choice reduction at 2 with 83 rule applications. Total rules 1124 place count 259 transition count 302
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 2 with 83 rules applied. Total rules applied 1207 place count 259 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1208 place count 259 transition count 302
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1209 place count 258 transition count 301
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1210 place count 258 transition count 301
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -123
Deduced a syphon composed of 206 places in 0 ms
Iterating global reduction 2 with 41 rules applied. Total rules applied 1251 place count 258 transition count 424
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 1328 place count 181 transition count 270
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 1405 place count 181 transition count 270
Discarding 111 places :
Symmetric choice reduction at 2 with 111 rule applications. Total rules 1516 place count 70 transition count 85
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 2 with 111 rules applied. Total rules applied 1627 place count 70 transition count 85
Deduced a syphon composed of 55 places in 0 ms
Applied a total of 1627 rules in 257 ms. Remains 70 /667 variables (removed 597) and now considering 85/670 (removed 585) transitions.
[2022-05-17 00:29:03] [INFO ] Redundant transitions in 33 ms returned []
[2022-05-17 00:29:03] [INFO ] Flow matrix only has 84 transitions (discarded 1 similar events)
// Phase 1: matrix 84 rows 70 cols
[2022-05-17 00:29:03] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-17 00:29:03] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/667 places, 85/670 transitions.
Finished structural reductions, in 1 iterations. Remains : 70/667 places, 85/670 transitions.
Stuttering criterion allowed to conclude after 58 steps with 8 reset in 4 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-09 finished in 43080 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!(p0 U p1) U p2) U X(p0)))'
Support contains 3 out of 680 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 680/680 places, 688/688 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 670 transition count 678
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 670 transition count 678
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 664 transition count 672
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 664 transition count 672
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 38 place count 664 transition count 666
Applied a total of 38 rules in 229 ms. Remains 664 /680 variables (removed 16) and now considering 666/688 (removed 22) transitions.
// Phase 1: matrix 666 rows 664 cols
[2022-05-17 00:29:03] [INFO ] Computed 41 place invariants in 6 ms
[2022-05-17 00:29:04] [INFO ] Implicit Places using invariants in 375 ms returned []
// Phase 1: matrix 666 rows 664 cols
[2022-05-17 00:29:04] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-17 00:29:04] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1243 ms to find 0 implicit places.
// Phase 1: matrix 666 rows 664 cols
[2022-05-17 00:29:04] [INFO ] Computed 41 place invariants in 6 ms
[2022-05-17 00:29:05] [INFO ] Dead Transitions using invariants and state equation in 836 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 664/680 places, 666/688 transitions.
Finished structural reductions, in 1 iterations. Remains : 664/680 places, 666/688 transitions.
Stuttering acceptance computed with spot in 400 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND p2 p1 (NOT p0)), true, (NOT p2), p1]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(OR p2 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=6 dest: 7}], [{ cond=p1, acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(EQ s220 1), p1:(EQ s276 1), p0:(EQ s142 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, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 413 steps with 1 reset in 4 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-10 finished in 2755 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 680/680 places, 688/688 transitions.
Graph (trivial) has 563 edges and 680 vertex of which 6 / 680 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 1051 edges and 675 vertex of which 631 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.2 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 338 place count 630 transition count 342
Reduce places removed 336 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 341 rules applied. Total rules applied 679 place count 294 transition count 337
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 83 Pre rules applied. Total rules applied 679 place count 294 transition count 254
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 845 place count 211 transition count 254
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 884 place count 172 transition count 215
Iterating global reduction 2 with 39 rules applied. Total rules applied 923 place count 172 transition count 215
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 1167 place count 50 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1168 place count 50 transition count 92
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1207 place count 11 transition count 15
Iterating global reduction 3 with 39 rules applied. Total rules applied 1246 place count 11 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1250 place count 9 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1251 place count 8 transition count 13
Applied a total of 1251 rules in 61 ms. Remains 8 /680 variables (removed 672) and now considering 13/688 (removed 675) transitions.
[2022-05-17 00:29:06] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 8 cols
[2022-05-17 00:29:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:29:06] [INFO ] Implicit Places using invariants in 28 ms returned []
[2022-05-17 00:29:06] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 8 cols
[2022-05-17 00:29:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:29:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:29:06] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2022-05-17 00:29:06] [INFO ] Redundant transitions in 17 ms returned []
[2022-05-17 00:29:06] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 8 cols
[2022-05-17 00:29:06] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-17 00:29:06] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/680 places, 13/688 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/680 places, 13/688 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-11 finished in 304 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1 U (false U p2))))'
Support contains 5 out of 680 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 680/680 places, 688/688 transitions.
Graph (trivial) has 558 edges and 680 vertex of which 6 / 680 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 1051 edges and 675 vertex of which 631 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.2 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 334 transitions
Trivial Post-agglo rules discarded 334 transitions
Performed 334 trivial Post agglomeration. Transition count delta: 334
Iterating post reduction 0 with 334 rules applied. Total rules applied 336 place count 630 transition count 344
Reduce places removed 334 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 341 rules applied. Total rules applied 677 place count 296 transition count 337
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 678 place count 295 transition count 337
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 81 Pre rules applied. Total rules applied 678 place count 295 transition count 256
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 840 place count 214 transition count 256
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 878 place count 176 transition count 218
Iterating global reduction 3 with 38 rules applied. Total rules applied 916 place count 176 transition count 218
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 1158 place count 55 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1159 place count 55 transition count 96
Discarding 38 places :
Symmetric choice reduction at 4 with 38 rule applications. Total rules 1197 place count 17 transition count 21
Iterating global reduction 4 with 38 rules applied. Total rules applied 1235 place count 17 transition count 21
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 1239 place count 15 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1240 place count 14 transition count 19
Applied a total of 1240 rules in 58 ms. Remains 14 /680 variables (removed 666) and now considering 19/688 (removed 669) transitions.
[2022-05-17 00:29:06] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
// Phase 1: matrix 18 rows 14 cols
[2022-05-17 00:29:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:29:06] [INFO ] Implicit Places using invariants in 29 ms returned []
[2022-05-17 00:29:06] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
// Phase 1: matrix 18 rows 14 cols
[2022-05-17 00:29:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:29:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:29:06] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2022-05-17 00:29:06] [INFO ] Redundant transitions in 17 ms returned []
[2022-05-17 00:29:06] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
// Phase 1: matrix 18 rows 14 cols
[2022-05-17 00:29:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:29:06] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/680 places, 19/688 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/680 places, 19/688 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), true, (NOT p0), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s6 1), p0:(OR (EQ s8 1) (NOT (AND (EQ s3 1) (EQ s11 1) (EQ s13 1)))), p1:(AND (EQ s3 1) (EQ s11 1) (EQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-12 finished in 376 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(X(G(p0)) U (F(!G(X(p0))) U !p0))))'
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 680/680 places, 688/688 transitions.
Graph (trivial) has 563 edges and 680 vertex of which 6 / 680 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 1051 edges and 675 vertex of which 631 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.2 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 338 place count 630 transition count 342
Reduce places removed 336 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 342 rules applied. Total rules applied 680 place count 294 transition count 336
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 680 place count 294 transition count 252
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 848 place count 210 transition count 252
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 887 place count 171 transition count 213
Iterating global reduction 2 with 39 rules applied. Total rules applied 926 place count 171 transition count 213
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 1170 place count 49 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1171 place count 49 transition count 90
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1210 place count 10 transition count 13
Iterating global reduction 3 with 39 rules applied. Total rules applied 1249 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 3 with 2 rules applied. Total rules applied 1251 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1252 place count 8 transition count 11
Applied a total of 1252 rules in 43 ms. Remains 8 /680 variables (removed 672) and now considering 11/688 (removed 677) transitions.
// Phase 1: matrix 11 rows 8 cols
[2022-05-17 00:29:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:29:06] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-17 00:29:06] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-17 00:29:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:29:06] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2022-05-17 00:29:06] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-17 00:29:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:29:06] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/680 places, 11/688 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/680 places, 11/688 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-13 finished in 245 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0) U F(p1))&&G(p0))))'
Support contains 2 out of 680 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 680/680 places, 688/688 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 671 transition count 679
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 671 transition count 679
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 665 transition count 673
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 665 transition count 673
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 665 transition count 667
Applied a total of 36 rules in 88 ms. Remains 665 /680 variables (removed 15) and now considering 667/688 (removed 21) transitions.
// Phase 1: matrix 667 rows 665 cols
[2022-05-17 00:29:07] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-17 00:29:07] [INFO ] Implicit Places using invariants in 389 ms returned []
// Phase 1: matrix 667 rows 665 cols
[2022-05-17 00:29:07] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-17 00:29:08] [INFO ] Implicit Places using invariants and state equation in 974 ms returned []
Implicit Place search using SMT with State Equation took 1369 ms to find 0 implicit places.
// Phase 1: matrix 667 rows 665 cols
[2022-05-17 00:29:08] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-17 00:29:09] [INFO ] Dead Transitions using invariants and state equation in 913 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 665/680 places, 667/688 transitions.
Finished structural reductions, in 1 iterations. Remains : 665/680 places, 667/688 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s387 1), p1:(EQ s70 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-14 finished in 2548 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 680/680 places, 688/688 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 670 transition count 678
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 670 transition count 678
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 664 transition count 672
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 664 transition count 672
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 38 place count 664 transition count 666
Applied a total of 38 rules in 95 ms. Remains 664 /680 variables (removed 16) and now considering 666/688 (removed 22) transitions.
// Phase 1: matrix 666 rows 664 cols
[2022-05-17 00:29:09] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-17 00:29:10] [INFO ] Implicit Places using invariants in 423 ms returned []
// Phase 1: matrix 666 rows 664 cols
[2022-05-17 00:29:10] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-17 00:29:11] [INFO ] Implicit Places using invariants and state equation in 1078 ms returned []
Implicit Place search using SMT with State Equation took 1505 ms to find 0 implicit places.
// Phase 1: matrix 666 rows 664 cols
[2022-05-17 00:29:11] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-17 00:29:12] [INFO ] Dead Transitions using invariants and state equation in 811 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 664/680 places, 666/688 transitions.
Finished structural reductions, in 1 iterations. Remains : 664/680 places, 666/688 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s392 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-15 finished in 2545 ms.
All properties solved by simple procedures.
Total runtime 80419 ms.

BK_STOP 1652747352341

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

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