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.r078-tall-165260109800100.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 DiscoveryGPU-PT-12a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260109800100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 6.9K Apr 30 07:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 30 07:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 07:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 30 07:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 43K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652632944711

Running Version 202205111006
[2022-05-15 16:42:25] [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-15 16:42:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:42:26] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2022-05-15 16:42:26] [INFO ] Transformed 123 places.
[2022-05-15 16:42:26] [INFO ] Transformed 169 transitions.
[2022-05-15 16:42:26] [INFO ] Found NUPN structural information;
[2022-05-15 16:42:26] [INFO ] Parsed PT model containing 123 places and 169 transitions in 174 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 169/169 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 115 transition count 161
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 115 transition count 161
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 108 transition count 154
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 108 transition count 154
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 104 transition count 146
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 104 transition count 146
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 104 transition count 138
Applied a total of 46 rules in 41 ms. Remains 104 /123 variables (removed 19) and now considering 138/169 (removed 31) transitions.
// Phase 1: matrix 138 rows 104 cols
[2022-05-15 16:42:26] [INFO ] Computed 2 place invariants in 15 ms
[2022-05-15 16:42:26] [INFO ] Implicit Places using invariants in 180 ms returned []
// Phase 1: matrix 138 rows 104 cols
[2022-05-15 16:42:26] [INFO ] Computed 2 place invariants in 6 ms
[2022-05-15 16:42:26] [INFO ] State equation strengthened by 89 read => feed constraints.
[2022-05-15 16:42:26] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
// Phase 1: matrix 138 rows 104 cols
[2022-05-15 16:42:26] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-15 16:42:26] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 104/123 places, 138/169 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/123 places, 138/169 transitions.
Support contains 28 out of 104 places after structural reductions.
[2022-05-15 16:42:26] [INFO ] Flatten gal took : 32 ms
[2022-05-15 16:42:26] [INFO ] Flatten gal took : 14 ms
[2022-05-15 16:42:26] [INFO ] Input system was already deterministic with 138 transitions.
Finished random walk after 1931 steps, including 14 resets, run visited all 26 properties in 82 ms. (steps per millisecond=23 )
Computed a total of 15 stabilizing places and 13 stable transitions
Graph (complete) has 310 edges and 104 vertex of which 100 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.12 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 138/138 transitions.
Graph (complete) has 310 edges and 104 vertex of which 100 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 100 transition count 130
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 96 transition count 130
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 14 place count 91 transition count 125
Iterating global reduction 0 with 5 rules applied. Total rules applied 19 place count 91 transition count 125
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 0 with 2 rules applied. Total rules applied 21 place count 90 transition count 124
Applied a total of 21 rules in 42 ms. Remains 90 /104 variables (removed 14) and now considering 124/138 (removed 14) transitions.
// Phase 1: matrix 124 rows 90 cols
[2022-05-15 16:42:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:42:27] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 124 rows 90 cols
[2022-05-15 16:42:27] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-15 16:42:27] [INFO ] State equation strengthened by 85 read => feed constraints.
[2022-05-15 16:42:27] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2022-05-15 16:42:27] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 124 rows 90 cols
[2022-05-15 16:42:27] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:42:27] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/104 places, 124/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/104 places, 124/138 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s38 1) (EQ s89 1)), p1:(EQ s23 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1445 steps with 13 reset in 22 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-01 finished in 564 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(X(p0))||G(F(p1))||F(p2)))))'
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 138/138 transitions.
Graph (complete) has 310 edges and 104 vertex of which 100 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 100 transition count 129
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 95 transition count 129
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 18 place count 88 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 25 place count 88 transition count 122
Applied a total of 25 rules in 13 ms. Remains 88 /104 variables (removed 16) and now considering 122/138 (removed 16) transitions.
// Phase 1: matrix 122 rows 88 cols
[2022-05-15 16:42:27] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:42:27] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 122 rows 88 cols
[2022-05-15 16:42:27] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:42:27] [INFO ] State equation strengthened by 85 read => feed constraints.
[2022-05-15 16:42:28] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 141 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/104 places, 122/138 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 46 place count 64 transition count 99
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 53 transition count 77
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 53 transition count 77
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 77 place count 44 transition count 59
Iterating global reduction 0 with 9 rules applied. Total rules applied 86 place count 44 transition count 59
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 95 place count 35 transition count 50
Iterating global reduction 0 with 9 rules applied. Total rules applied 104 place count 35 transition count 50
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 112 place count 27 transition count 34
Iterating global reduction 0 with 8 rules applied. Total rules applied 120 place count 27 transition count 34
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 128 place count 19 transition count 26
Iterating global reduction 0 with 8 rules applied. Total rules applied 136 place count 19 transition count 26
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 137 place count 19 transition count 26
Applied a total of 137 rules in 19 ms. Remains 19 /87 variables (removed 68) and now considering 26/122 (removed 96) transitions.
[2022-05-15 16:42:28] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 19 cols
[2022-05-15 16:42:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:42:28] [INFO ] Implicit Places using invariants in 19 ms returned []
[2022-05-15 16:42:28] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 19 cols
[2022-05-15 16:42:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:42:28] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-15 16:42:28] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/104 places, 26/138 transitions.
Finished structural reductions, in 2 iterations. Remains : 19/104 places, 26/138 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s12 0) (EQ s18 0)), p0:(EQ s14 0), p2:(OR (EQ s7 0) (EQ s18 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3961 steps with 52 reset in 16 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-05 finished in 427 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||X(p1)))))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 138/138 transitions.
Graph (complete) has 310 edges and 104 vertex of which 100 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 100 transition count 130
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 96 transition count 130
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 16 place count 89 transition count 123
Iterating global reduction 0 with 7 rules applied. Total rules applied 23 place count 89 transition count 123
Applied a total of 23 rules in 13 ms. Remains 89 /104 variables (removed 15) and now considering 123/138 (removed 15) transitions.
// Phase 1: matrix 123 rows 89 cols
[2022-05-15 16:42:28] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:42:28] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 123 rows 89 cols
[2022-05-15 16:42:28] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:42:28] [INFO ] State equation strengthened by 85 read => feed constraints.
[2022-05-15 16:42:28] [INFO ] Implicit Places using invariants and state equation in 86 ms returned [88]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 133 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/104 places, 123/138 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 66 transition count 101
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 53 place count 57 transition count 83
Iterating global reduction 0 with 9 rules applied. Total rules applied 62 place count 57 transition count 83
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 71 place count 48 transition count 65
Iterating global reduction 0 with 9 rules applied. Total rules applied 80 place count 48 transition count 65
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 89 place count 39 transition count 56
Iterating global reduction 0 with 9 rules applied. Total rules applied 98 place count 39 transition count 56
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 107 place count 30 transition count 38
Iterating global reduction 0 with 9 rules applied. Total rules applied 116 place count 30 transition count 38
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 125 place count 21 transition count 29
Iterating global reduction 0 with 9 rules applied. Total rules applied 134 place count 21 transition count 29
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 136 place count 21 transition count 29
Applied a total of 136 rules in 13 ms. Remains 21 /88 variables (removed 67) and now considering 29/123 (removed 94) transitions.
[2022-05-15 16:42:28] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
// Phase 1: matrix 25 rows 21 cols
[2022-05-15 16:42:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:42:28] [INFO ] Implicit Places using invariants in 21 ms returned []
[2022-05-15 16:42:28] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
// Phase 1: matrix 25 rows 21 cols
[2022-05-15 16:42:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:42:28] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-15 16:42:28] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/104 places, 29/138 transitions.
Finished structural reductions, in 2 iterations. Remains : 21/104 places, 29/138 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s13 0), p1:(AND (EQ s8 1) (EQ s20 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 96 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-06 finished in 274 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p1)&&p0))))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 138/138 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 98 transition count 132
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 98 transition count 132
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 95 transition count 129
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 95 transition count 129
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 92 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 92 transition count 126
Applied a total of 24 rules in 4 ms. Remains 92 /104 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 92 cols
[2022-05-15 16:42:28] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:42:28] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 126 rows 92 cols
[2022-05-15 16:42:28] [INFO ] Computed 2 place invariants in 6 ms
[2022-05-15 16:42:28] [INFO ] State equation strengthened by 86 read => feed constraints.
[2022-05-15 16:42:28] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [91]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 144 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 91/104 places, 126/138 transitions.
Applied a total of 0 rules in 10 ms. Remains 91 /91 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 91/104 places, 126/138 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (NEQ s81 1) (NEQ s90 1)), p0:(AND (EQ s17 1) (EQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 335 ms.
Product exploration explored 100000 steps with 50000 reset in 284 ms.
Computed a total of 14 stabilizing places and 13 stable transitions
Graph (complete) has 249 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 13 stable transitions
Detected a total of 14/91 stabilizing places and 13/126 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 6 factoid took 170 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-07 finished in 1129 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(X(F(p1))))&&p0)))'
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 138/138 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 97 transition count 131
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 97 transition count 131
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 93 transition count 127
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 93 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 90 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 90 transition count 124
Applied a total of 28 rules in 13 ms. Remains 90 /104 variables (removed 14) and now considering 124/138 (removed 14) transitions.
// Phase 1: matrix 124 rows 90 cols
[2022-05-15 16:42:29] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-15 16:42:29] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 124 rows 90 cols
[2022-05-15 16:42:29] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:42:29] [INFO ] State equation strengthened by 85 read => feed constraints.
[2022-05-15 16:42:29] [INFO ] Implicit Places using invariants and state equation in 87 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 128 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/104 places, 124/138 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 89/104 places, 124/138 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (EQ s16 1) (EQ s88 1)), p0:(AND (EQ s9 1) (EQ s88 1) (OR (EQ s16 0) (EQ s88 0) (EQ s41 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-08 finished in 316 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(X(((p0 U X(p1))||p2))))))'
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 138/138 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 99 transition count 133
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 99 transition count 133
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 97 transition count 131
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 97 transition count 131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 96 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 96 transition count 130
Applied a total of 16 rules in 4 ms. Remains 96 /104 variables (removed 8) and now considering 130/138 (removed 8) transitions.
// Phase 1: matrix 130 rows 96 cols
[2022-05-15 16:42:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:42:30] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 130 rows 96 cols
[2022-05-15 16:42:30] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 16:42:30] [INFO ] State equation strengthened by 87 read => feed constraints.
[2022-05-15 16:42:30] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
// Phase 1: matrix 130 rows 96 cols
[2022-05-15 16:42:30] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:42:30] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/104 places, 130/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 96/104 places, 130/138 transitions.
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s1 0), p0:(EQ s70 1), p1:(AND (EQ s1 1) (EQ s21 1) (EQ s95 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][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 759 steps with 5 reset in 6 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-09 finished in 491 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!p0 U !(G((p1 U p2))||G(p3)||!p4)))'
Support contains 7 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 138/138 transitions.
Graph (complete) has 310 edges and 104 vertex of which 100 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 100 transition count 129
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 95 transition count 129
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 18 place count 88 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 25 place count 88 transition count 122
Applied a total of 25 rules in 13 ms. Remains 88 /104 variables (removed 16) and now considering 122/138 (removed 16) transitions.
// Phase 1: matrix 122 rows 88 cols
[2022-05-15 16:42:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:42:30] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 122 rows 88 cols
[2022-05-15 16:42:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:42:30] [INFO ] State equation strengthened by 85 read => feed constraints.
[2022-05-15 16:42:30] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2022-05-15 16:42:30] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 122 rows 88 cols
[2022-05-15 16:42:30] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:42:30] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/104 places, 122/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 88/104 places, 122/138 transitions.
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p2) (NOT p3) p4), true, (NOT p2), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p4)), acceptance={} source=0 dest: 0}, { cond=(AND p4 (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND p4 (NOT p2) p1 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p4 p2 (NOT p3)) (AND p4 p1 (NOT p3))), acceptance={} source=0 dest: 3}, { cond=(AND p4 (NOT p2) (NOT p1) p3), acceptance={} source=0 dest: 4}, { cond=(OR (AND p4 p2 p3) (AND p4 p1 p3)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(OR p2 p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=5 dest: 4}, { cond=(OR (AND p2 p3) (AND p1 p3)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s55 1) (EQ s87 1)), p4:(AND (EQ s59 1) (EQ s86 1)), p2:(AND (EQ s85 1) (EQ s86 1)), p1:(EQ s4 1), p3:(EQ s72 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, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 415 steps with 12 reset in 4 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-10 finished in 450 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 138/138 transitions.
Graph (complete) has 310 edges and 104 vertex of which 100 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 100 transition count 129
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 95 transition count 129
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 18 place count 88 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 25 place count 88 transition count 122
Applied a total of 25 rules in 16 ms. Remains 88 /104 variables (removed 16) and now considering 122/138 (removed 16) transitions.
// Phase 1: matrix 122 rows 88 cols
[2022-05-15 16:42:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:42:31] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 122 rows 88 cols
[2022-05-15 16:42:31] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 16:42:31] [INFO ] State equation strengthened by 85 read => feed constraints.
[2022-05-15 16:42:31] [INFO ] Implicit Places using invariants and state equation in 96 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 139 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/104 places, 122/138 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 46 place count 64 transition count 99
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 53 transition count 77
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 53 transition count 77
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 79 place count 42 transition count 55
Iterating global reduction 0 with 11 rules applied. Total rules applied 90 place count 42 transition count 55
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 100 place count 32 transition count 45
Iterating global reduction 0 with 10 rules applied. Total rules applied 110 place count 32 transition count 45
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 120 place count 22 transition count 25
Iterating global reduction 0 with 10 rules applied. Total rules applied 130 place count 22 transition count 25
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 140 place count 12 transition count 15
Iterating global reduction 0 with 10 rules applied. Total rules applied 150 place count 12 transition count 15
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 151 place count 12 transition count 15
Applied a total of 151 rules in 9 ms. Remains 12 /87 variables (removed 75) and now considering 15/122 (removed 107) transitions.
[2022-05-15 16:42:31] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 12 cols
[2022-05-15 16:42:31] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 16:42:31] [INFO ] Implicit Places using invariants in 22 ms returned []
[2022-05-15 16:42:31] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 12 cols
[2022-05-15 16:42:31] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:42:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-15 16:42:31] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/104 places, 15/138 transitions.
Finished structural reductions, in 2 iterations. Remains : 12/104 places, 15/138 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-11 finished in 268 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0 U p1)) U !F(p2)))'
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 138/138 transitions.
Graph (complete) has 310 edges and 104 vertex of which 101 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 101 transition count 130
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 96 transition count 130
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 17 place count 90 transition count 124
Iterating global reduction 0 with 6 rules applied. Total rules applied 23 place count 90 transition count 124
Applied a total of 23 rules in 12 ms. Remains 90 /104 variables (removed 14) and now considering 124/138 (removed 14) transitions.
// Phase 1: matrix 124 rows 90 cols
[2022-05-15 16:42:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:42:31] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 124 rows 90 cols
[2022-05-15 16:42:31] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:42:31] [INFO ] State equation strengthened by 86 read => feed constraints.
[2022-05-15 16:42:31] [INFO ] Implicit Places using invariants and state equation in 91 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 138 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/104 places, 124/138 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 46 place count 66 transition count 101
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 55 place count 57 transition count 83
Iterating global reduction 0 with 9 rules applied. Total rules applied 64 place count 57 transition count 83
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 73 place count 48 transition count 65
Iterating global reduction 0 with 9 rules applied. Total rules applied 82 place count 48 transition count 65
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 91 place count 39 transition count 56
Iterating global reduction 0 with 9 rules applied. Total rules applied 100 place count 39 transition count 56
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 109 place count 30 transition count 38
Iterating global reduction 0 with 9 rules applied. Total rules applied 118 place count 30 transition count 38
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 126 place count 22 transition count 30
Iterating global reduction 0 with 8 rules applied. Total rules applied 134 place count 22 transition count 30
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 135 place count 22 transition count 30
Applied a total of 135 rules in 9 ms. Remains 22 /89 variables (removed 67) and now considering 30/124 (removed 94) transitions.
[2022-05-15 16:42:31] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
// Phase 1: matrix 26 rows 22 cols
[2022-05-15 16:42:31] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:42:31] [INFO ] Implicit Places using invariants in 24 ms returned []
[2022-05-15 16:42:31] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
// Phase 1: matrix 26 rows 22 cols
[2022-05-15 16:42:31] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:42:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-15 16:42:31] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/104 places, 30/138 transitions.
Finished structural reductions, in 2 iterations. Remains : 22/104 places, 30/138 transitions.
Stuttering acceptance computed with spot in 153 ms :[p2, true, p2, (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 0}, { cond=(OR (AND p2 p1) (AND p2 (NOT p0))), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(OR (AND p2 p1) (AND p2 (NOT p0))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s14 1), p1:(AND (EQ s7 1) (EQ s21 1)), p0:(AND (EQ s9 1) (EQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-12 finished in 385 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 138/138 transitions.
Graph (complete) has 310 edges and 104 vertex of which 100 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 100 transition count 129
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 95 transition count 129
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 18 place count 88 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 25 place count 88 transition count 122
Applied a total of 25 rules in 7 ms. Remains 88 /104 variables (removed 16) and now considering 122/138 (removed 16) transitions.
// Phase 1: matrix 122 rows 88 cols
[2022-05-15 16:42:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:42:31] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 122 rows 88 cols
[2022-05-15 16:42:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:42:31] [INFO ] State equation strengthened by 85 read => feed constraints.
[2022-05-15 16:42:31] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2022-05-15 16:42:31] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 122 rows 88 cols
[2022-05-15 16:42:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:42:31] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/104 places, 122/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 88/104 places, 122/138 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s37 1), p1:(AND (EQ s51 1) (EQ s87 1))], nbAcceptance=2, 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 120 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-14 finished in 264 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(((p0 U p1)||p2)))||G(p0)))'
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 138/138 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 98 transition count 132
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 98 transition count 132
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 94 transition count 128
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 94 transition count 128
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 91 transition count 125
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 91 transition count 125
Applied a total of 26 rules in 6 ms. Remains 91 /104 variables (removed 13) and now considering 125/138 (removed 13) transitions.
// Phase 1: matrix 125 rows 91 cols
[2022-05-15 16:42:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:42:31] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 125 rows 91 cols
[2022-05-15 16:42:31] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-15 16:42:31] [INFO ] State equation strengthened by 85 read => feed constraints.
[2022-05-15 16:42:32] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 91 cols
[2022-05-15 16:42:32] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:42:32] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/104 places, 125/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 91/104 places, 125/138 transitions.
Stuttering acceptance computed with spot in 300 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 7}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 7}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={} source=6 dest: 1}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=2, aps=[p0:(EQ s60 1), p1:(EQ s41 1), p2:(AND (EQ s36 1) (EQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-15 finished in 509 ms.
All properties solved by simple procedures.
Total runtime 6538 ms.

BK_STOP 1652632952427

--------------------
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="DiscoveryGPU-PT-12a"
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 DiscoveryGPU-PT-12a, 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 r078-tall-165260109800100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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